/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/gj2007.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:12:24,251 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:12:24,252 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:12:24,313 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:12:24,313 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:12:24,315 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:12:24,318 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:12:24,320 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:12:24,322 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:12:24,326 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:12:24,327 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:12:24,329 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:12:24,329 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:12:24,331 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:12:24,332 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:12:24,335 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:12:24,336 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:12:24,336 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:12:24,339 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:12:24,344 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:12:24,346 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:12:24,347 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:12:24,348 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:12:24,349 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:12:24,350 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:12:24,357 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:12:24,357 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:12:24,358 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:12:24,358 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:12:24,359 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:12:24,360 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:12:24,360 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:12:24,362 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:12:24,362 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:12:24,363 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:12:24,364 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:12:24,364 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:12:24,365 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:12:24,365 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:12:24,365 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:12:24,366 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:12:24,367 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:12:24,368 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:24,380 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:12:24,381 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:12:24,382 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:12:24,382 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:12:24,382 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:12:24,383 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:12:24,383 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:12:24,383 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:12:24,383 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:12:24,384 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:12:24,384 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:12:24,384 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:12:24,384 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:12:24,384 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:12:24,385 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:12:24,385 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:12:24,385 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:12:24,385 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:12:24,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:12:24,385 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:12:24,385 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:12:24,385 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:12:24,386 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:12:24,386 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:12:24,386 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:12:24,386 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:24,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:12:24,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:12:24,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:12:24,670 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:12:24,671 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:12:24,672 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007.i [2022-04-28 03:12:24,729 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b8b43a5a/e7b3056882a642f6b3541df9cada4294/FLAG36834fec8 [2022-04-28 03:12:25,074 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:12:25,074 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007.i [2022-04-28 03:12:25,081 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b8b43a5a/e7b3056882a642f6b3541df9cada4294/FLAG36834fec8 [2022-04-28 03:12:25,506 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b8b43a5a/e7b3056882a642f6b3541df9cada4294 [2022-04-28 03:12:25,508 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:12:25,509 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:12:25,511 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:12:25,511 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:12:25,513 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:12:25,514 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:12:25" (1/1) ... [2022-04-28 03:12:25,515 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5864fe59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:25, skipping insertion in model container [2022-04-28 03:12:25,515 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:12:25" (1/1) ... [2022-04-28 03:12:25,521 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:12:25,532 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:12:25,661 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/gj2007.i[895,908] [2022-04-28 03:12:25,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:12:25,679 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:12:25,690 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/gj2007.i[895,908] [2022-04-28 03:12:25,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:12:25,704 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:12:25,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:25 WrapperNode [2022-04-28 03:12:25,705 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:12:25,706 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:12:25,706 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:12:25,706 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:12:25,715 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:25" (1/1) ... [2022-04-28 03:12:25,715 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:25" (1/1) ... [2022-04-28 03:12:25,722 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:25" (1/1) ... [2022-04-28 03:12:25,722 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:25" (1/1) ... [2022-04-28 03:12:25,731 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:25" (1/1) ... [2022-04-28 03:12:25,737 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:25" (1/1) ... [2022-04-28 03:12:25,743 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:25" (1/1) ... [2022-04-28 03:12:25,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:12:25,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:12:25,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:12:25,751 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:12:25,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:25" (1/1) ... [2022-04-28 03:12:25,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:12:25,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:12:25,780 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:25,798 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:25,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:12:25,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:12:25,824 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:12:25,824 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 03:12:25,824 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:12:25,825 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:12:25,825 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:12:25,825 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:12:25,826 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 03:12:25,826 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 03:12:25,827 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:12:25,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:12:25,828 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 03:12:25,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:12:25,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 03:12:25,828 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:12:25,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:12:25,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:12:25,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:12:25,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:12:25,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:12:25,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:12:25,886 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:12:25,888 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:12:26,045 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:12:26,066 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:12:26,067 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 03:12:26,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:12:26 BoogieIcfgContainer [2022-04-28 03:12:26,068 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:12:26,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:12:26,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:12:26,073 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:12:26,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:12:25" (1/3) ... [2022-04-28 03:12:26,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bdfe1ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:12:26, skipping insertion in model container [2022-04-28 03:12:26,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:25" (2/3) ... [2022-04-28 03:12:26,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bdfe1ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:12:26, skipping insertion in model container [2022-04-28 03:12:26,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:12:26" (3/3) ... [2022-04-28 03:12:26,075 INFO L111 eAbstractionObserver]: Analyzing ICFG gj2007.i [2022-04-28 03:12:26,102 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:12:26,102 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:12:26,154 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:12:26,159 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@5d55227c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4942d74c [2022-04-28 03:12:26,160 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:12:26,167 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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:26,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 03:12:26,178 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:12:26,179 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:12:26,179 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:12:26,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:12:26,194 INFO L85 PathProgramCache]: Analyzing trace with hash -242008288, now seen corresponding path program 1 times [2022-04-28 03:12:26,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:26,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [570983513] [2022-04-28 03:12:26,212 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:12:26,212 INFO L85 PathProgramCache]: Analyzing trace with hash -242008288, now seen corresponding path program 2 times [2022-04-28 03:12:26,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:12:26,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835002776] [2022-04-28 03:12:26,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:26,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:12:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:26,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:12:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:26,427 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(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); {23#true} is VALID [2022-04-28 03:12:26,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 03:12:26,428 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #56#return; {23#true} is VALID [2022-04-28 03:12:26,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:12:26,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(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); {23#true} is VALID [2022-04-28 03:12:26,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 03:12:26,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #56#return; {23#true} is VALID [2022-04-28 03:12:26,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret1 := main(); {23#true} is VALID [2022-04-28 03:12:26,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} ~x~0 := 0;~y~0 := 50; {23#true} is VALID [2022-04-28 03:12:26,434 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !true; {24#false} is VALID [2022-04-28 03:12:26,434 INFO L272 TraceCheckUtils]: 7: Hoare triple {24#false} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {24#false} is VALID [2022-04-28 03:12:26,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-28 03:12:26,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-28 03:12:26,435 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-28 03:12:26,435 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:26,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:12:26,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835002776] [2022-04-28 03:12:26,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835002776] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:26,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:26,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:12:26,440 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:12:26,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [570983513] [2022-04-28 03:12:26,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [570983513] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:26,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:26,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:12:26,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391443465] [2022-04-28 03:12:26,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:12:26,446 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:26,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:12:26,450 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:26,478 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:26,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 03:12:26,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:26,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 03:12:26,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 03:12:26,506 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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:26,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:26,595 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-28 03:12:26,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 03:12:26,596 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:26,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:12:26,597 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:26,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-28 03:12:26,605 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:26,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-28 03:12:26,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2022-04-28 03:12:26,647 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:26,653 INFO L225 Difference]: With dead ends: 32 [2022-04-28 03:12:26,654 INFO L226 Difference]: Without dead ends: 13 [2022-04-28 03:12:26,656 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:26,659 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 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:26,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 23 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:26,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-28 03:12:26,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-28 03:12:26,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:12:26,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call 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:26,690 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call 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:26,690 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call 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:26,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:26,692 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-28 03:12:26,692 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-28 03:12:26,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:26,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:26,693 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 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 13 states. [2022-04-28 03:12:26,693 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 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 13 states. [2022-04-28 03:12:26,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:26,696 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-28 03:12:26,696 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-28 03:12:26,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:26,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:26,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:12:26,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:12:26,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call 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:26,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-04-28 03:12:26,699 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-04-28 03:12:26,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:12:26,700 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-04-28 03:12:26,700 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:26,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 14 transitions. [2022-04-28 03:12:26,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:12:26,718 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-28 03:12:26,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 03:12:26,719 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:12:26,720 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:12:26,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:12:26,720 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:12:26,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:12:26,722 INFO L85 PathProgramCache]: Analyzing trace with hash -251243498, now seen corresponding path program 1 times [2022-04-28 03:12:26,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:26,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [704138029] [2022-04-28 03:12:26,728 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:12:26,728 INFO L85 PathProgramCache]: Analyzing trace with hash -251243498, now seen corresponding path program 2 times [2022-04-28 03:12:26,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:12:26,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378122713] [2022-04-28 03:12:26,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:26,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:12:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:26,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:12:26,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:26,814 INFO L290 TraceCheckUtils]: 0: Hoare triple {153#(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); {147#true} is VALID [2022-04-28 03:12:26,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {147#true} assume true; {147#true} is VALID [2022-04-28 03:12:26,816 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {147#true} {147#true} #56#return; {147#true} is VALID [2022-04-28 03:12:26,818 INFO L272 TraceCheckUtils]: 0: Hoare triple {147#true} call ULTIMATE.init(); {153#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:12:26,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {153#(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); {147#true} is VALID [2022-04-28 03:12:26,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {147#true} assume true; {147#true} is VALID [2022-04-28 03:12:26,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {147#true} {147#true} #56#return; {147#true} is VALID [2022-04-28 03:12:26,819 INFO L272 TraceCheckUtils]: 4: Hoare triple {147#true} call #t~ret1 := main(); {147#true} is VALID [2022-04-28 03:12:26,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {147#true} ~x~0 := 0;~y~0 := 50; {152#(= main_~x~0 0)} is VALID [2022-04-28 03:12:26,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {152#(= main_~x~0 0)} assume !(~x~0 < 100); {148#false} is VALID [2022-04-28 03:12:26,822 INFO L272 TraceCheckUtils]: 7: Hoare triple {148#false} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {148#false} is VALID [2022-04-28 03:12:26,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {148#false} ~cond := #in~cond; {148#false} is VALID [2022-04-28 03:12:26,822 INFO L290 TraceCheckUtils]: 9: Hoare triple {148#false} assume 0 == ~cond; {148#false} is VALID [2022-04-28 03:12:26,822 INFO L290 TraceCheckUtils]: 10: Hoare triple {148#false} assume !false; {148#false} is VALID [2022-04-28 03:12:26,823 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:26,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:12:26,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378122713] [2022-04-28 03:12:26,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378122713] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:26,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:26,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:12:26,824 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:12:26,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [704138029] [2022-04-28 03:12:26,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [704138029] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:26,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:26,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:12:26,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230605633] [2022-04-28 03:12:26,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:12:26,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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:26,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:12:26,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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:26,843 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:26,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 03:12:26,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:26,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 03:12:26,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 03:12:26,845 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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:26,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:26,926 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-28 03:12:26,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 03:12:26,926 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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:26,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:12:26,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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:26,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-28 03:12:26,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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:26,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-28 03:12:26,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2022-04-28 03:12:26,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:12:26,972 INFO L225 Difference]: With dead ends: 22 [2022-04-28 03:12:26,972 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 03:12:26,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:26,973 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:12:26,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:12:26,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 03:12:26,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 03:12:26,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:12:26,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call 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:26,979 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call 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:26,979 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call 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:26,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:26,980 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-28 03:12:26,980 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 03:12:26,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:26,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:26,981 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 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 15 states. [2022-04-28 03:12:26,981 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 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 15 states. [2022-04-28 03:12:26,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:26,983 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-28 03:12:26,983 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 03:12:26,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:26,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:26,983 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:12:26,983 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:12:26,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call 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:26,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-28 03:12:26,985 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-04-28 03:12:26,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:12:26,985 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-28 03:12:26,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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:26,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-28 03:12:27,001 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:27,001 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 03:12:27,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 03:12:27,002 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:12:27,002 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:12:27,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:12:27,002 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:12:27,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:12:27,003 INFO L85 PathProgramCache]: Analyzing trace with hash 85580979, now seen corresponding path program 1 times [2022-04-28 03:12:27,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:27,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [891380914] [2022-04-28 03:12:29,377 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:12:29,379 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:12:29,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1895159821, now seen corresponding path program 1 times [2022-04-28 03:12:29,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:12:29,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978053603] [2022-04-28 03:12:29,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:29,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:12:29,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:29,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:12:29,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:29,490 INFO L290 TraceCheckUtils]: 0: Hoare triple {269#(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); {262#true} is VALID [2022-04-28 03:12:29,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-28 03:12:29,490 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {262#true} {262#true} #56#return; {262#true} is VALID [2022-04-28 03:12:29,492 INFO L272 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:12:29,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#(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); {262#true} is VALID [2022-04-28 03:12:29,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-28 03:12:29,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {262#true} {262#true} #56#return; {262#true} is VALID [2022-04-28 03:12:29,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {262#true} call #t~ret1 := main(); {262#true} is VALID [2022-04-28 03:12:29,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {262#true} ~x~0 := 0;~y~0 := 50; {267#(= main_~x~0 0)} is VALID [2022-04-28 03:12:29,503 INFO L290 TraceCheckUtils]: 6: Hoare triple {267#(= main_~x~0 0)} [60] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_9 v_main_~x~0_8))) (or (and .cse0 (<= 50 v_main_~x~0_9)) .cse0 (and (< v_main_~x~0_8 51) (< v_main_~x~0_9 v_main_~x~0_8)))) InVars {main_~x~0=v_main_~x~0_9} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[main_~x~0] {268#(<= main_~x~0 50)} is VALID [2022-04-28 03:12:29,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {268#(<= main_~x~0 50)} [59] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {263#false} is VALID [2022-04-28 03:12:29,504 INFO L272 TraceCheckUtils]: 8: Hoare triple {263#false} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {263#false} is VALID [2022-04-28 03:12:29,504 INFO L290 TraceCheckUtils]: 9: Hoare triple {263#false} ~cond := #in~cond; {263#false} is VALID [2022-04-28 03:12:29,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {263#false} assume 0 == ~cond; {263#false} is VALID [2022-04-28 03:12:29,505 INFO L290 TraceCheckUtils]: 11: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-04-28 03:12:29,505 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:29,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:12:29,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978053603] [2022-04-28 03:12:29,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978053603] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:29,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:29,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:12:29,598 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:12:29,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [891380914] [2022-04-28 03:12:29,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [891380914] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:29,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:29,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:12:29,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98277660] [2022-04-28 03:12:29,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:12:29,599 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:29,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:12:29,601 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:29,612 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:29,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 03:12:29,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:29,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 03:12:29,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:12:29,615 INFO L87 Difference]: Start difference. First operand 15 states and 16 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:29,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:29,733 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-28 03:12:29,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 03:12:29,734 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:29,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:12:29,734 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:29,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-28 03:12:29,736 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:29,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-28 03:12:29,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 24 transitions. [2022-04-28 03:12:29,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:12:29,759 INFO L225 Difference]: With dead ends: 22 [2022-04-28 03:12:29,759 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 03:12:29,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-28 03:12:29,761 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:12:29,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 23 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:12:29,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 03:12:29,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 03:12:29,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:12:29,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 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:29,770 INFO L74 IsIncluded]: Start isIncluded. First operand 17 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:29,770 INFO L87 Difference]: Start difference. First operand 17 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:29,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:29,772 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 03:12:29,772 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 03:12:29,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:29,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:29,772 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 17 states. [2022-04-28 03:12:29,773 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 17 states. [2022-04-28 03:12:29,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:29,774 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 03:12:29,774 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 03:12:29,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:29,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:29,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:12:29,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:12:29,775 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:29,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-28 03:12:29,776 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2022-04-28 03:12:29,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:12:29,777 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-28 03:12:29,777 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:29,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-28 03:12:29,795 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:29,795 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 03:12:29,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 03:12:29,796 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:12:29,796 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:12:29,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 03:12:29,796 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:12:29,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:12:29,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1708614478, now seen corresponding path program 1 times [2022-04-28 03:12:29,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:29,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [649013713] [2022-04-28 03:12:33,304 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:12:33,409 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:12:33,770 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:12:33,771 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:12:33,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1039142196, now seen corresponding path program 1 times [2022-04-28 03:12:33,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:12:33,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698060405] [2022-04-28 03:12:33,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:33,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:12:33,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:33,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:12:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:33,976 INFO L290 TraceCheckUtils]: 0: Hoare triple {401#(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); {390#true} is VALID [2022-04-28 03:12:33,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {390#true} assume true; {390#true} is VALID [2022-04-28 03:12:33,978 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {390#true} {390#true} #56#return; {390#true} is VALID [2022-04-28 03:12:33,979 INFO L272 TraceCheckUtils]: 0: Hoare triple {390#true} call ULTIMATE.init(); {401#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:12:33,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {401#(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); {390#true} is VALID [2022-04-28 03:12:33,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {390#true} assume true; {390#true} is VALID [2022-04-28 03:12:33,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {390#true} {390#true} #56#return; {390#true} is VALID [2022-04-28 03:12:33,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {390#true} call #t~ret1 := main(); {390#true} is VALID [2022-04-28 03:12:33,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {390#true} ~x~0 := 0;~y~0 := 50; {395#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:12:33,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {395#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [62] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_16 v_main_~x~0_15))) (or (and (< v_main_~x~0_15 51) (< v_main_~x~0_16 v_main_~x~0_15)) (and (not (< v_main_~x~0_16 50)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_16} OutVars{main_~x~0=v_main_~x~0_15} AuxVars[] AssignedVars[main_~x~0] {396#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:12:33,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {396#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [63] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {396#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:12:33,987 INFO L290 TraceCheckUtils]: 8: Hoare triple {396#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [64] L28-2-->L27-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_18 v_main_~x~0_17)) (.cse2 (= v_main_~y~0_7 v_main_~y~0_6)) (.cse0 (<= 50 v_main_~x~0_18))) (or (and (= (+ v_main_~x~0_17 v_main_~y~0_7) (+ v_main_~x~0_18 v_main_~y~0_6)) (< v_main_~x~0_17 101) (< v_main_~x~0_18 v_main_~x~0_17) .cse0) (and .cse1 .cse2) (and .cse1 .cse2 (or (not (< v_main_~x~0_18 100)) (not .cse0))))) InVars {main_~x~0=v_main_~x~0_18, main_~y~0=v_main_~y~0_7} OutVars{main_~x~0=v_main_~x~0_17, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {397#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:12:33,988 INFO L290 TraceCheckUtils]: 9: Hoare triple {397#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} [61] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {398#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:12:33,989 INFO L272 TraceCheckUtils]: 10: Hoare triple {398#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {399#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:12:33,989 INFO L290 TraceCheckUtils]: 11: Hoare triple {399#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {400#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:12:33,990 INFO L290 TraceCheckUtils]: 12: Hoare triple {400#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {391#false} is VALID [2022-04-28 03:12:33,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {391#false} assume !false; {391#false} is VALID [2022-04-28 03:12:33,990 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:33,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:12:33,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698060405] [2022-04-28 03:12:33,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698060405] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:12:33,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555885804] [2022-04-28 03:12:33,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:33,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:12:33,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:12:33,995 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:34,021 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:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:34,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:12:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:34,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:12:34,501 INFO L272 TraceCheckUtils]: 0: Hoare triple {390#true} call ULTIMATE.init(); {390#true} is VALID [2022-04-28 03:12:34,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {390#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); {390#true} is VALID [2022-04-28 03:12:34,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {390#true} assume true; {390#true} is VALID [2022-04-28 03:12:34,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {390#true} {390#true} #56#return; {390#true} is VALID [2022-04-28 03:12:34,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {390#true} call #t~ret1 := main(); {390#true} is VALID [2022-04-28 03:12:34,504 INFO L290 TraceCheckUtils]: 5: Hoare triple {390#true} ~x~0 := 0;~y~0 := 50; {420#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:12:34,505 INFO L290 TraceCheckUtils]: 6: Hoare triple {420#(and (<= main_~x~0 0) (= main_~y~0 50))} [62] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_16 v_main_~x~0_15))) (or (and (< v_main_~x~0_15 51) (< v_main_~x~0_16 v_main_~x~0_15)) (and (not (< v_main_~x~0_16 50)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_16} OutVars{main_~x~0=v_main_~x~0_15} AuxVars[] AssignedVars[main_~x~0] {424#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:12:34,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {424#(and (= main_~y~0 50) (< main_~x~0 51))} [63] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {424#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:12:34,507 INFO L290 TraceCheckUtils]: 8: Hoare triple {424#(and (= main_~y~0 50) (< main_~x~0 51))} [64] L28-2-->L27-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_18 v_main_~x~0_17)) (.cse2 (= v_main_~y~0_7 v_main_~y~0_6)) (.cse0 (<= 50 v_main_~x~0_18))) (or (and (= (+ v_main_~x~0_17 v_main_~y~0_7) (+ v_main_~x~0_18 v_main_~y~0_6)) (< v_main_~x~0_17 101) (< v_main_~x~0_18 v_main_~x~0_17) .cse0) (and .cse1 .cse2) (and .cse1 .cse2 (or (not (< v_main_~x~0_18 100)) (not .cse0))))) InVars {main_~x~0=v_main_~x~0_18, main_~y~0=v_main_~y~0_7} OutVars{main_~x~0=v_main_~x~0_17, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {431#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:12:34,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {431#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [61] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {398#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:12:34,508 INFO L272 TraceCheckUtils]: 10: Hoare triple {398#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {438#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:12:34,509 INFO L290 TraceCheckUtils]: 11: Hoare triple {438#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {442#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:12:34,509 INFO L290 TraceCheckUtils]: 12: Hoare triple {442#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {391#false} is VALID [2022-04-28 03:12:34,510 INFO L290 TraceCheckUtils]: 13: Hoare triple {391#false} assume !false; {391#false} is VALID [2022-04-28 03:12:34,510 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:34,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:12:35,217 INFO L290 TraceCheckUtils]: 13: Hoare triple {391#false} assume !false; {391#false} is VALID [2022-04-28 03:12:35,218 INFO L290 TraceCheckUtils]: 12: Hoare triple {442#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {391#false} is VALID [2022-04-28 03:12:35,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {438#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {442#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:12:35,220 INFO L272 TraceCheckUtils]: 10: Hoare triple {398#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {438#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:12:35,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {461#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [61] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {398#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:12:35,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {465#(and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [64] L28-2-->L27-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_18 v_main_~x~0_17)) (.cse2 (= v_main_~y~0_7 v_main_~y~0_6)) (.cse0 (<= 50 v_main_~x~0_18))) (or (and (= (+ v_main_~x~0_17 v_main_~y~0_7) (+ v_main_~x~0_18 v_main_~y~0_6)) (< v_main_~x~0_17 101) (< v_main_~x~0_18 v_main_~x~0_17) .cse0) (and .cse1 .cse2) (and .cse1 .cse2 (or (not (< v_main_~x~0_18 100)) (not .cse0))))) InVars {main_~x~0=v_main_~x~0_18, main_~y~0=v_main_~y~0_7} OutVars{main_~x~0=v_main_~x~0_17, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {461#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:12:35,222 INFO L290 TraceCheckUtils]: 7: Hoare triple {465#(and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [63] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {465#(and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:12:35,224 INFO L290 TraceCheckUtils]: 6: Hoare triple {472#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (<= 50 main_~y~0) (<= main_~y~0 100) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [62] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_16 v_main_~x~0_15))) (or (and (< v_main_~x~0_15 51) (< v_main_~x~0_16 v_main_~x~0_15)) (and (not (< v_main_~x~0_16 50)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_16} OutVars{main_~x~0=v_main_~x~0_15} AuxVars[] AssignedVars[main_~x~0] {465#(and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:12:35,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {390#true} ~x~0 := 0;~y~0 := 50; {472#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (<= 50 main_~y~0) (<= main_~y~0 100) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:12:35,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {390#true} call #t~ret1 := main(); {390#true} is VALID [2022-04-28 03:12:35,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {390#true} {390#true} #56#return; {390#true} is VALID [2022-04-28 03:12:35,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {390#true} assume true; {390#true} is VALID [2022-04-28 03:12:35,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {390#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); {390#true} is VALID [2022-04-28 03:12:35,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {390#true} call ULTIMATE.init(); {390#true} is VALID [2022-04-28 03:12:35,226 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:35,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555885804] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:12:35,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:12:35,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:12:35,385 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:12:35,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [649013713] [2022-04-28 03:12:35,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [649013713] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:35,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:35,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:12:35,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327037473] [2022-04-28 03:12:35,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:12:35,388 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 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 15 [2022-04-28 03:12:35,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:12:35,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call 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,400 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,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 03:12:35,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:35,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 03:12:35,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2022-04-28 03:12:35,402 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call 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,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:35,696 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-28 03:12:35,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:12:35,696 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 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 15 [2022-04-28 03:12:35,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:12:35,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call 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,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-04-28 03:12:35,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call 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,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-04-28 03:12:35,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 31 transitions. [2022-04-28 03:12:35,729 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:35,730 INFO L225 Difference]: With dead ends: 26 [2022-04-28 03:12:35,730 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 03:12:35,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2022-04-28 03:12:35,731 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:12:35,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 43 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:12:35,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 03:12:35,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-28 03:12:35,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:12:35,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 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,747 INFO L74 IsIncluded]: Start isIncluded. First operand 19 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,747 INFO L87 Difference]: Start difference. First operand 19 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,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:35,748 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-28 03:12:35,748 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 03:12:35,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:35,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:35,749 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 19 states. [2022-04-28 03:12:35,749 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 19 states. [2022-04-28 03:12:35,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:35,750 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-28 03:12:35,750 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 03:12:35,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:35,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:35,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:12:35,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:12:35,751 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,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-28 03:12:35,752 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2022-04-28 03:12:35,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:12:35,752 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-28 03:12:35,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call 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,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions. [2022-04-28 03:12:35,771 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,771 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 03:12:35,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 03:12:35,772 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:12:35,772 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:12:35,790 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:35,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:12:35,980 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:12:35,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:12:35,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1924288727, now seen corresponding path program 2 times [2022-04-28 03:12:35,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:35,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [585391850] [2022-04-28 03:12:38,215 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:12:38,572 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:12:38,574 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:12:38,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1010389964, now seen corresponding path program 1 times [2022-04-28 03:12:38,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:12:38,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711638160] [2022-04-28 03:12:38,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:38,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:12:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:38,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:12:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:38,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {641#(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); {630#true} is VALID [2022-04-28 03:12:38,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {630#true} assume true; {630#true} is VALID [2022-04-28 03:12:38,733 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {630#true} {630#true} #56#return; {630#true} is VALID [2022-04-28 03:12:38,734 INFO L272 TraceCheckUtils]: 0: Hoare triple {630#true} call ULTIMATE.init(); {641#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:12:38,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {641#(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); {630#true} is VALID [2022-04-28 03:12:38,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {630#true} assume true; {630#true} is VALID [2022-04-28 03:12:38,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {630#true} {630#true} #56#return; {630#true} is VALID [2022-04-28 03:12:38,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {630#true} call #t~ret1 := main(); {630#true} is VALID [2022-04-28 03:12:38,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {630#true} ~x~0 := 0;~y~0 := 50; {635#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:12:38,735 INFO L290 TraceCheckUtils]: 6: Hoare triple {635#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [66] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_35 v_main_~x~0_34))) (or (and (< v_main_~x~0_34 51) (< v_main_~x~0_35 v_main_~x~0_34)) (and (not (< v_main_~x~0_35 50)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_35} OutVars{main_~x~0=v_main_~x~0_34} AuxVars[] AssignedVars[main_~x~0] {636#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:12:38,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {636#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [67] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {636#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:12:38,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {636#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [68] L28-2-->L27-2_primed: Formula: (let ((.cse1 (<= 50 v_main_~x~0_37)) (.cse2 (= v_main_~x~0_37 v_main_~x~0_36)) (.cse3 (= v_main_~y~0_17 v_main_~y~0_16))) (or (let ((.cse0 (+ v_main_~x~0_37 v_main_~y~0_16))) (and (< v_main_~y~0_17 v_main_~y~0_16) (= (+ v_main_~x~0_36 v_main_~y~0_17) .cse0) (< .cse0 (+ 101 v_main_~y~0_17)) .cse1)) (and .cse2 .cse3) (and (or (not .cse1) (not (< v_main_~x~0_37 100))) .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_37, main_~y~0=v_main_~y~0_17} OutVars{main_~x~0=v_main_~x~0_36, main_~y~0=v_main_~y~0_16} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {637#(or (and (or (< 99 main_~y~0) (<= main_~x~0 main_~y~0)) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:12:38,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {637#(or (and (or (< 99 main_~y~0) (<= main_~x~0 main_~y~0)) (<= main_~y~0 100)) (<= main_~x~0 50))} [65] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {638#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:12:38,738 INFO L272 TraceCheckUtils]: 10: Hoare triple {638#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {639#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:12:38,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {639#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {640#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:12:38,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {640#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {631#false} is VALID [2022-04-28 03:12:38,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {631#false} assume !false; {631#false} is VALID [2022-04-28 03:12:38,740 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:38,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:12:38,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711638160] [2022-04-28 03:12:38,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711638160] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:12:38,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356309466] [2022-04-28 03:12:38,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:38,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:12:38,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:12:38,742 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:38,743 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:38,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:38,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:12:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:38,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:12:39,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {630#true} call ULTIMATE.init(); {630#true} is VALID [2022-04-28 03:12:39,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {630#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); {630#true} is VALID [2022-04-28 03:12:39,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {630#true} assume true; {630#true} is VALID [2022-04-28 03:12:39,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {630#true} {630#true} #56#return; {630#true} is VALID [2022-04-28 03:12:39,144 INFO L272 TraceCheckUtils]: 4: Hoare triple {630#true} call #t~ret1 := main(); {630#true} is VALID [2022-04-28 03:12:39,144 INFO L290 TraceCheckUtils]: 5: Hoare triple {630#true} ~x~0 := 0;~y~0 := 50; {660#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:12:39,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {660#(and (<= main_~x~0 0) (= main_~y~0 50))} [66] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_35 v_main_~x~0_34))) (or (and (< v_main_~x~0_34 51) (< v_main_~x~0_35 v_main_~x~0_34)) (and (not (< v_main_~x~0_35 50)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_35} OutVars{main_~x~0=v_main_~x~0_34} AuxVars[] AssignedVars[main_~x~0] {664#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:12:39,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {664#(and (= main_~y~0 50) (< main_~x~0 51))} [67] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {664#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:12:39,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {664#(and (= main_~y~0 50) (< main_~x~0 51))} [68] L28-2-->L27-2_primed: Formula: (let ((.cse1 (<= 50 v_main_~x~0_37)) (.cse2 (= v_main_~x~0_37 v_main_~x~0_36)) (.cse3 (= v_main_~y~0_17 v_main_~y~0_16))) (or (let ((.cse0 (+ v_main_~x~0_37 v_main_~y~0_16))) (and (< v_main_~y~0_17 v_main_~y~0_16) (= (+ v_main_~x~0_36 v_main_~y~0_17) .cse0) (< .cse0 (+ 101 v_main_~y~0_17)) .cse1)) (and .cse2 .cse3) (and (or (not .cse1) (not (< v_main_~x~0_37 100))) .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_37, main_~y~0=v_main_~y~0_17} OutVars{main_~x~0=v_main_~x~0_36, main_~y~0=v_main_~y~0_16} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {671#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:12:39,149 INFO L290 TraceCheckUtils]: 9: Hoare triple {671#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [65] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {638#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:12:39,150 INFO L272 TraceCheckUtils]: 10: Hoare triple {638#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {678#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:12:39,150 INFO L290 TraceCheckUtils]: 11: Hoare triple {678#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {682#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:12:39,151 INFO L290 TraceCheckUtils]: 12: Hoare triple {682#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {631#false} is VALID [2022-04-28 03:12:39,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {631#false} assume !false; {631#false} is VALID [2022-04-28 03:12:39,151 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:39,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:12:39,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {631#false} assume !false; {631#false} is VALID [2022-04-28 03:12:39,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {682#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {631#false} is VALID [2022-04-28 03:12:39,788 INFO L290 TraceCheckUtils]: 11: Hoare triple {678#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {682#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:12:39,789 INFO L272 TraceCheckUtils]: 10: Hoare triple {638#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {678#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:12:39,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {701#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [65] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {638#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:12:39,791 INFO L290 TraceCheckUtils]: 8: Hoare triple {705#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [68] L28-2-->L27-2_primed: Formula: (let ((.cse1 (<= 50 v_main_~x~0_37)) (.cse2 (= v_main_~x~0_37 v_main_~x~0_36)) (.cse3 (= v_main_~y~0_17 v_main_~y~0_16))) (or (let ((.cse0 (+ v_main_~x~0_37 v_main_~y~0_16))) (and (< v_main_~y~0_17 v_main_~y~0_16) (= (+ v_main_~x~0_36 v_main_~y~0_17) .cse0) (< .cse0 (+ 101 v_main_~y~0_17)) .cse1)) (and .cse2 .cse3) (and (or (not .cse1) (not (< v_main_~x~0_37 100))) .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_37, main_~y~0=v_main_~y~0_17} OutVars{main_~x~0=v_main_~x~0_36, main_~y~0=v_main_~y~0_16} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {701#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:12:39,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {705#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [67] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {705#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:12:39,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {712#(and (<= 50 main_~y~0) (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [66] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_35 v_main_~x~0_34))) (or (and (< v_main_~x~0_34 51) (< v_main_~x~0_35 v_main_~x~0_34)) (and (not (< v_main_~x~0_35 50)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_35} OutVars{main_~x~0=v_main_~x~0_34} AuxVars[] AssignedVars[main_~x~0] {705#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:12:39,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {630#true} ~x~0 := 0;~y~0 := 50; {712#(and (<= 50 main_~y~0) (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:12:39,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {630#true} call #t~ret1 := main(); {630#true} is VALID [2022-04-28 03:12:39,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {630#true} {630#true} #56#return; {630#true} is VALID [2022-04-28 03:12:39,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {630#true} assume true; {630#true} is VALID [2022-04-28 03:12:39,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {630#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); {630#true} is VALID [2022-04-28 03:12:39,794 INFO L272 TraceCheckUtils]: 0: Hoare triple {630#true} call ULTIMATE.init(); {630#true} is VALID [2022-04-28 03:12:39,794 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:39,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356309466] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:12:39,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:12:39,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:12:39,994 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:12:39,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [585391850] [2022-04-28 03:12:39,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [585391850] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:39,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:39,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:12:39,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166637977] [2022-04-28 03:12:39,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:12:39,996 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (3), 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 17 [2022-04-28 03:12:39,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:12:39,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call 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:40,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:12:40,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 03:12:40,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:40,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 03:12:40,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2022-04-28 03:12:40,020 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call 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:40,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:40,305 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-04-28 03:12:40,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:12:40,306 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (3), 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 17 [2022-04-28 03:12:40,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:12:40,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call 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:40,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2022-04-28 03:12:40,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call 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:40,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2022-04-28 03:12:40,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 33 transitions. [2022-04-28 03:12:40,346 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:40,347 INFO L225 Difference]: With dead ends: 28 [2022-04-28 03:12:40,347 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 03:12:40,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2022-04-28 03:12:40,348 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:12:40,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 48 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:12:40,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 03:12:40,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-28 03:12:40,368 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:12:40,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call 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:40,369 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call 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:40,369 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call 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:40,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:40,370 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-28 03:12:40,370 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-28 03:12:40,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:40,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:40,371 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 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 21 states. [2022-04-28 03:12:40,371 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 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 21 states. [2022-04-28 03:12:40,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:40,372 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-28 03:12:40,372 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-28 03:12:40,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:40,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:40,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:12:40,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:12:40,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call 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:40,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-04-28 03:12:40,374 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 17 [2022-04-28 03:12:40,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:12:40,374 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-04-28 03:12:40,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call 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:40,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 23 transitions. [2022-04-28 03:12:40,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:12:40,396 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-28 03:12:40,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 03:12:40,396 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:12:40,396 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:12:40,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 03:12:40,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:12:40,603 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:12:40,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:12:40,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1335857084, now seen corresponding path program 3 times [2022-04-28 03:12:40,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:40,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [303418271] [2022-04-28 03:12:40,747 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:12:41,180 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:12:41,181 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:12:41,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1235045172, now seen corresponding path program 1 times [2022-04-28 03:12:41,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:12:41,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550465667] [2022-04-28 03:12:41,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:41,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:12:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:41,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:12:41,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:41,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {896#(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); {885#true} is VALID [2022-04-28 03:12:41,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {885#true} assume true; {885#true} is VALID [2022-04-28 03:12:41,312 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {885#true} {885#true} #56#return; {885#true} is VALID [2022-04-28 03:12:41,313 INFO L272 TraceCheckUtils]: 0: Hoare triple {885#true} call ULTIMATE.init(); {896#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:12:41,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {896#(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); {885#true} is VALID [2022-04-28 03:12:41,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {885#true} assume true; {885#true} is VALID [2022-04-28 03:12:41,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {885#true} {885#true} #56#return; {885#true} is VALID [2022-04-28 03:12:41,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {885#true} call #t~ret1 := main(); {885#true} is VALID [2022-04-28 03:12:41,314 INFO L290 TraceCheckUtils]: 5: Hoare triple {885#true} ~x~0 := 0;~y~0 := 50; {890#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:12:41,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {890#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [70] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_55 v_main_~x~0_54))) (or (and (< v_main_~x~0_54 51) (< v_main_~x~0_55 v_main_~x~0_54)) (and (not (< v_main_~x~0_55 50)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_55} OutVars{main_~x~0=v_main_~x~0_54} AuxVars[] AssignedVars[main_~x~0] {891#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:12:41,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {891#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [71] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {891#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:12:41,316 INFO L290 TraceCheckUtils]: 8: Hoare triple {891#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [72] L28-2-->L27-2_primed: Formula: (let ((.cse2 (<= 50 v_main_~x~0_57)) (.cse0 (= v_main_~y~0_28 v_main_~y~0_27)) (.cse1 (= v_main_~x~0_57 v_main_~x~0_56))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_57 100)))) (and (< v_main_~x~0_56 101) (= (+ v_main_~x~0_57 v_main_~y~0_27) (+ v_main_~x~0_56 v_main_~y~0_28)) (< v_main_~x~0_57 v_main_~x~0_56) .cse2) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_57, main_~y~0=v_main_~y~0_28} OutVars{main_~x~0=v_main_~x~0_56, main_~y~0=v_main_~y~0_27} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {892#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:12:41,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {892#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} [69] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {893#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:12:41,318 INFO L272 TraceCheckUtils]: 10: Hoare triple {893#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {894#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:12:41,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {894#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {895#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:12:41,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {895#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {886#false} is VALID [2022-04-28 03:12:41,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {886#false} assume !false; {886#false} is VALID [2022-04-28 03:12:41,319 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:41,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:12:41,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550465667] [2022-04-28 03:12:41,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550465667] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:12:41,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252392728] [2022-04-28 03:12:41,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:41,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:12:41,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:12:41,321 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:41,346 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:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:41,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:12:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:41,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:12:41,688 INFO L272 TraceCheckUtils]: 0: Hoare triple {885#true} call ULTIMATE.init(); {885#true} is VALID [2022-04-28 03:12:41,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {885#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); {885#true} is VALID [2022-04-28 03:12:41,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {885#true} assume true; {885#true} is VALID [2022-04-28 03:12:41,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {885#true} {885#true} #56#return; {885#true} is VALID [2022-04-28 03:12:41,689 INFO L272 TraceCheckUtils]: 4: Hoare triple {885#true} call #t~ret1 := main(); {885#true} is VALID [2022-04-28 03:12:41,689 INFO L290 TraceCheckUtils]: 5: Hoare triple {885#true} ~x~0 := 0;~y~0 := 50; {915#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:12:41,690 INFO L290 TraceCheckUtils]: 6: Hoare triple {915#(and (<= main_~x~0 0) (= main_~y~0 50))} [70] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_55 v_main_~x~0_54))) (or (and (< v_main_~x~0_54 51) (< v_main_~x~0_55 v_main_~x~0_54)) (and (not (< v_main_~x~0_55 50)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_55} OutVars{main_~x~0=v_main_~x~0_54} AuxVars[] AssignedVars[main_~x~0] {919#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:12:41,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {919#(and (= main_~y~0 50) (< main_~x~0 51))} [71] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {919#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:12:41,692 INFO L290 TraceCheckUtils]: 8: Hoare triple {919#(and (= main_~y~0 50) (< main_~x~0 51))} [72] L28-2-->L27-2_primed: Formula: (let ((.cse2 (<= 50 v_main_~x~0_57)) (.cse0 (= v_main_~y~0_28 v_main_~y~0_27)) (.cse1 (= v_main_~x~0_57 v_main_~x~0_56))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_57 100)))) (and (< v_main_~x~0_56 101) (= (+ v_main_~x~0_57 v_main_~y~0_27) (+ v_main_~x~0_56 v_main_~y~0_28)) (< v_main_~x~0_57 v_main_~x~0_56) .cse2) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_57, main_~y~0=v_main_~y~0_28} OutVars{main_~x~0=v_main_~x~0_56, main_~y~0=v_main_~y~0_27} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {926#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:12:41,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {926#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [69] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {893#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:12:41,693 INFO L272 TraceCheckUtils]: 10: Hoare triple {893#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {933#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:12:41,693 INFO L290 TraceCheckUtils]: 11: Hoare triple {933#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {937#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:12:41,694 INFO L290 TraceCheckUtils]: 12: Hoare triple {937#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {886#false} is VALID [2022-04-28 03:12:41,694 INFO L290 TraceCheckUtils]: 13: Hoare triple {886#false} assume !false; {886#false} is VALID [2022-04-28 03:12:41,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:12:41,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:12:42,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {886#false} assume !false; {886#false} is VALID [2022-04-28 03:12:42,255 INFO L290 TraceCheckUtils]: 12: Hoare triple {937#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {886#false} is VALID [2022-04-28 03:12:42,255 INFO L290 TraceCheckUtils]: 11: Hoare triple {933#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {937#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:12:42,256 INFO L272 TraceCheckUtils]: 10: Hoare triple {893#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {933#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:12:42,256 INFO L290 TraceCheckUtils]: 9: Hoare triple {956#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [69] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {893#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:12:42,258 INFO L290 TraceCheckUtils]: 8: Hoare triple {960#(and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [72] L28-2-->L27-2_primed: Formula: (let ((.cse2 (<= 50 v_main_~x~0_57)) (.cse0 (= v_main_~y~0_28 v_main_~y~0_27)) (.cse1 (= v_main_~x~0_57 v_main_~x~0_56))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_57 100)))) (and (< v_main_~x~0_56 101) (= (+ v_main_~x~0_57 v_main_~y~0_27) (+ v_main_~x~0_56 v_main_~y~0_28)) (< v_main_~x~0_57 v_main_~x~0_56) .cse2) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_57, main_~y~0=v_main_~y~0_28} OutVars{main_~x~0=v_main_~x~0_56, main_~y~0=v_main_~y~0_27} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {956#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:12:42,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {960#(and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [71] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {960#(and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:12:42,260 INFO L290 TraceCheckUtils]: 6: Hoare triple {967#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (<= 50 main_~y~0) (<= main_~y~0 100) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [70] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_55 v_main_~x~0_54))) (or (and (< v_main_~x~0_54 51) (< v_main_~x~0_55 v_main_~x~0_54)) (and (not (< v_main_~x~0_55 50)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_55} OutVars{main_~x~0=v_main_~x~0_54} AuxVars[] AssignedVars[main_~x~0] {960#(and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:12:42,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {885#true} ~x~0 := 0;~y~0 := 50; {967#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (<= 50 main_~y~0) (<= main_~y~0 100) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:12:42,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {885#true} call #t~ret1 := main(); {885#true} is VALID [2022-04-28 03:12:42,261 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {885#true} {885#true} #56#return; {885#true} is VALID [2022-04-28 03:12:42,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {885#true} assume true; {885#true} is VALID [2022-04-28 03:12:42,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {885#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); {885#true} is VALID [2022-04-28 03:12:42,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {885#true} call ULTIMATE.init(); {885#true} is VALID [2022-04-28 03:12:42,261 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:42,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252392728] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:12:42,261 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:12:42,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:12:42,489 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:12:42,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [303418271] [2022-04-28 03:12:42,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [303418271] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:42,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:42,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 03:12:42,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464631462] [2022-04-28 03:12:42,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:12:42,490 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 9 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:42,490 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:12:42,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.5) internal successors, (15), 9 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:42,507 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:42,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 03:12:42,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:42,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 03:12:42,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2022-04-28 03:12:42,508 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 9 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:42,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:42,871 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-28 03:12:42,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:12:42,871 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 9 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:42,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:12:42,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 9 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:42,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-28 03:12:42,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 9 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:42,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-28 03:12:42,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2022-04-28 03:12:42,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:12:42,911 INFO L225 Difference]: With dead ends: 30 [2022-04-28 03:12:42,911 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 03:12:42,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=541, Unknown=0, NotChecked=0, Total=702 [2022-04-28 03:12:42,912 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 13 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:12:42,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 48 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:12:42,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 03:12:42,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 03:12:42,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:12:42,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call 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:42,937 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call 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:42,937 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call 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:42,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:42,938 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-28 03:12:42,938 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 03:12:42,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:42,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:42,939 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 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 23 states. [2022-04-28 03:12:42,939 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 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 23 states. [2022-04-28 03:12:42,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:42,940 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-28 03:12:42,940 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 03:12:42,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:42,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:42,940 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:12:42,941 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:12:42,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call 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:42,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-04-28 03:12:42,942 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 19 [2022-04-28 03:12:42,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:12:42,942 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-04-28 03:12:42,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 9 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:42,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 25 transitions. [2022-04-28 03:12:42,963 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:42,963 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 03:12:42,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 03:12:42,964 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:12:42,964 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:12:42,980 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:43,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:12:43,168 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:12:43,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:12:43,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1506236063, now seen corresponding path program 4 times [2022-04-28 03:12:43,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:43,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [349263622] [2022-04-28 03:12:47,235 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:12:47,279 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:12:47,576 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:12:47,578 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:12:47,580 INFO L85 PathProgramCache]: Analyzing trace with hash 814486988, now seen corresponding path program 1 times [2022-04-28 03:12:47,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:12:47,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354812845] [2022-04-28 03:12:47,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:47,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:12:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:47,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:12:47,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:47,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {1166#(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); {1155#true} is VALID [2022-04-28 03:12:47,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {1155#true} assume true; {1155#true} is VALID [2022-04-28 03:12:47,742 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1155#true} {1155#true} #56#return; {1155#true} is VALID [2022-04-28 03:12:47,743 INFO L272 TraceCheckUtils]: 0: Hoare triple {1155#true} call ULTIMATE.init(); {1166#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:12:47,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {1166#(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); {1155#true} is VALID [2022-04-28 03:12:47,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {1155#true} assume true; {1155#true} is VALID [2022-04-28 03:12:47,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1155#true} {1155#true} #56#return; {1155#true} is VALID [2022-04-28 03:12:47,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {1155#true} call #t~ret1 := main(); {1155#true} is VALID [2022-04-28 03:12:47,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {1155#true} ~x~0 := 0;~y~0 := 50; {1160#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:12:47,746 INFO L290 TraceCheckUtils]: 6: Hoare triple {1160#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [74] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_76 v_main_~x~0_75))) (or .cse0 (and (< v_main_~x~0_76 v_main_~x~0_75) (< v_main_~x~0_75 51)) (and .cse0 (not (< v_main_~x~0_76 50))))) InVars {main_~x~0=v_main_~x~0_76} OutVars{main_~x~0=v_main_~x~0_75} AuxVars[] AssignedVars[main_~x~0] {1161#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:12:47,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {1161#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [75] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1161#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:12:47,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {1161#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [76] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_78 v_main_~x~0_77)) (.cse1 (<= 50 v_main_~x~0_78))) (or (and .cse0 (= v_main_~y~0_40 v_main_~y~0_39)) (and (= v_main_~y~0_39 v_main_~y~0_40) .cse0 (or (not (< v_main_~x~0_78 100)) (not .cse1))) (let ((.cse2 (+ v_main_~x~0_78 v_main_~y~0_39))) (and (< .cse2 (+ 101 v_main_~y~0_40)) (< v_main_~y~0_40 v_main_~y~0_39) (= (+ v_main_~x~0_77 v_main_~y~0_40) .cse2) .cse1)))) InVars {main_~x~0=v_main_~x~0_78, main_~y~0=v_main_~y~0_40} OutVars{main_~x~0=v_main_~x~0_77, main_~y~0=v_main_~y~0_39} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1162#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:12:47,748 INFO L290 TraceCheckUtils]: 9: Hoare triple {1162#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} [73] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1163#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:12:47,749 INFO L272 TraceCheckUtils]: 10: Hoare triple {1163#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {1164#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:12:47,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {1164#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1165#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:12:47,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {1165#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1156#false} is VALID [2022-04-28 03:12:47,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {1156#false} assume !false; {1156#false} is VALID [2022-04-28 03:12:47,750 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:47,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:12:47,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354812845] [2022-04-28 03:12:47,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354812845] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:12:47,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316738168] [2022-04-28 03:12:47,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:47,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:12:47,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:12:47,756 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:47,757 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:47,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:47,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:12:47,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:47,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:12:48,144 INFO L272 TraceCheckUtils]: 0: Hoare triple {1155#true} call ULTIMATE.init(); {1155#true} is VALID [2022-04-28 03:12:48,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {1155#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); {1155#true} is VALID [2022-04-28 03:12:48,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {1155#true} assume true; {1155#true} is VALID [2022-04-28 03:12:48,145 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1155#true} {1155#true} #56#return; {1155#true} is VALID [2022-04-28 03:12:48,145 INFO L272 TraceCheckUtils]: 4: Hoare triple {1155#true} call #t~ret1 := main(); {1155#true} is VALID [2022-04-28 03:12:48,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {1155#true} ~x~0 := 0;~y~0 := 50; {1185#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:12:48,151 INFO L290 TraceCheckUtils]: 6: Hoare triple {1185#(and (<= main_~x~0 0) (= main_~y~0 50))} [74] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_76 v_main_~x~0_75))) (or .cse0 (and (< v_main_~x~0_76 v_main_~x~0_75) (< v_main_~x~0_75 51)) (and .cse0 (not (< v_main_~x~0_76 50))))) InVars {main_~x~0=v_main_~x~0_76} OutVars{main_~x~0=v_main_~x~0_75} AuxVars[] AssignedVars[main_~x~0] {1189#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:12:48,151 INFO L290 TraceCheckUtils]: 7: Hoare triple {1189#(and (= main_~y~0 50) (< main_~x~0 51))} [75] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1189#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:12:48,152 INFO L290 TraceCheckUtils]: 8: Hoare triple {1189#(and (= main_~y~0 50) (< main_~x~0 51))} [76] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_78 v_main_~x~0_77)) (.cse1 (<= 50 v_main_~x~0_78))) (or (and .cse0 (= v_main_~y~0_40 v_main_~y~0_39)) (and (= v_main_~y~0_39 v_main_~y~0_40) .cse0 (or (not (< v_main_~x~0_78 100)) (not .cse1))) (let ((.cse2 (+ v_main_~x~0_78 v_main_~y~0_39))) (and (< .cse2 (+ 101 v_main_~y~0_40)) (< v_main_~y~0_40 v_main_~y~0_39) (= (+ v_main_~x~0_77 v_main_~y~0_40) .cse2) .cse1)))) InVars {main_~x~0=v_main_~x~0_78, main_~y~0=v_main_~y~0_40} OutVars{main_~x~0=v_main_~x~0_77, main_~y~0=v_main_~y~0_39} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1196#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:12:48,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {1196#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [73] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1163#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:12:48,153 INFO L272 TraceCheckUtils]: 10: Hoare triple {1163#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {1203#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:12:48,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {1203#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1207#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:12:48,154 INFO L290 TraceCheckUtils]: 12: Hoare triple {1207#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1156#false} is VALID [2022-04-28 03:12:48,154 INFO L290 TraceCheckUtils]: 13: Hoare triple {1156#false} assume !false; {1156#false} is VALID [2022-04-28 03:12:48,154 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:48,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:12:48,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {1156#false} assume !false; {1156#false} is VALID [2022-04-28 03:12:48,719 INFO L290 TraceCheckUtils]: 12: Hoare triple {1207#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1156#false} is VALID [2022-04-28 03:12:48,720 INFO L290 TraceCheckUtils]: 11: Hoare triple {1203#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1207#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:12:48,721 INFO L272 TraceCheckUtils]: 10: Hoare triple {1163#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {1203#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:12:48,722 INFO L290 TraceCheckUtils]: 9: Hoare triple {1226#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [73] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1163#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:12:48,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {1230#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [76] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_78 v_main_~x~0_77)) (.cse1 (<= 50 v_main_~x~0_78))) (or (and .cse0 (= v_main_~y~0_40 v_main_~y~0_39)) (and (= v_main_~y~0_39 v_main_~y~0_40) .cse0 (or (not (< v_main_~x~0_78 100)) (not .cse1))) (let ((.cse2 (+ v_main_~x~0_78 v_main_~y~0_39))) (and (< .cse2 (+ 101 v_main_~y~0_40)) (< v_main_~y~0_40 v_main_~y~0_39) (= (+ v_main_~x~0_77 v_main_~y~0_40) .cse2) .cse1)))) InVars {main_~x~0=v_main_~x~0_78, main_~y~0=v_main_~y~0_40} OutVars{main_~x~0=v_main_~x~0_77, main_~y~0=v_main_~y~0_39} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1226#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:12:48,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {1230#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [75] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1230#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:12:48,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {1237#(and (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)) (or (and (< main_~x~0 (+ main_~y~0 1)) (<= 50 main_~y~0)) (<= 99 main_~y~0)))} [74] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_76 v_main_~x~0_75))) (or .cse0 (and (< v_main_~x~0_76 v_main_~x~0_75) (< v_main_~x~0_75 51)) (and .cse0 (not (< v_main_~x~0_76 50))))) InVars {main_~x~0=v_main_~x~0_76} OutVars{main_~x~0=v_main_~x~0_75} AuxVars[] AssignedVars[main_~x~0] {1230#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:12:48,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {1155#true} ~x~0 := 0;~y~0 := 50; {1237#(and (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)) (or (and (< main_~x~0 (+ main_~y~0 1)) (<= 50 main_~y~0)) (<= 99 main_~y~0)))} is VALID [2022-04-28 03:12:48,726 INFO L272 TraceCheckUtils]: 4: Hoare triple {1155#true} call #t~ret1 := main(); {1155#true} is VALID [2022-04-28 03:12:48,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1155#true} {1155#true} #56#return; {1155#true} is VALID [2022-04-28 03:12:48,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {1155#true} assume true; {1155#true} is VALID [2022-04-28 03:12:48,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {1155#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); {1155#true} is VALID [2022-04-28 03:12:48,726 INFO L272 TraceCheckUtils]: 0: Hoare triple {1155#true} call ULTIMATE.init(); {1155#true} is VALID [2022-04-28 03:12:48,726 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:48,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316738168] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:12:48,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:12:48,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:12:49,009 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:12:49,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [349263622] [2022-04-28 03:12:49,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [349263622] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:49,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:49,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 03:12:49,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904428006] [2022-04-28 03:12:49,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:12:49,010 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 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 21 [2022-04-28 03:12:49,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:12:49,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call 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:49,030 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:49,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 03:12:49,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:49,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 03:12:49,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2022-04-28 03:12:49,031 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call 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:49,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:49,493 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-28 03:12:49,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:12:49,493 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 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 21 [2022-04-28 03:12:49,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:12:49,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call 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:49,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2022-04-28 03:12:49,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call 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:49,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2022-04-28 03:12:49,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 37 transitions. [2022-04-28 03:12:49,530 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:49,530 INFO L225 Difference]: With dead ends: 32 [2022-04-28 03:12:49,530 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 03:12:49,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=177, Invalid=635, Unknown=0, NotChecked=0, Total=812 [2022-04-28 03:12:49,531 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 14 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:12:49,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 58 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:12:49,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 03:12:49,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-28 03:12:49,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:12:49,566 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call 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:49,567 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call 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:49,567 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call 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:49,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:49,568 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-28 03:12:49,568 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 03:12:49,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:49,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:49,568 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 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 25 states. [2022-04-28 03:12:49,568 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 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 25 states. [2022-04-28 03:12:49,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:49,569 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-28 03:12:49,570 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 03:12:49,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:49,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:49,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:12:49,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:12:49,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call 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:49,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-28 03:12:49,571 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2022-04-28 03:12:49,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:12:49,571 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-28 03:12:49,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call 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:49,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2022-04-28 03:12:49,593 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:49,593 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 03:12:49,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 03:12:49,595 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:12:49,595 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:12:49,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-28 03:12:49,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:12:49,799 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:12:49,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:12:49,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1158550074, now seen corresponding path program 5 times [2022-04-28 03:12:49,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:49,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [481949452] [2022-04-28 03:12:49,942 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:12:52,106 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:12:52,210 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:12:52,211 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:12:52,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1430948148, now seen corresponding path program 1 times [2022-04-28 03:12:52,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:12:52,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159182821] [2022-04-28 03:12:52,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:52,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:12:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:52,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:12:52,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:52,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {1451#(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); {1440#true} is VALID [2022-04-28 03:12:52,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {1440#true} assume true; {1440#true} is VALID [2022-04-28 03:12:52,329 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1440#true} {1440#true} #56#return; {1440#true} is VALID [2022-04-28 03:12:52,330 INFO L272 TraceCheckUtils]: 0: Hoare triple {1440#true} call ULTIMATE.init(); {1451#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:12:52,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {1451#(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); {1440#true} is VALID [2022-04-28 03:12:52,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {1440#true} assume true; {1440#true} is VALID [2022-04-28 03:12:52,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1440#true} {1440#true} #56#return; {1440#true} is VALID [2022-04-28 03:12:52,330 INFO L272 TraceCheckUtils]: 4: Hoare triple {1440#true} call #t~ret1 := main(); {1440#true} is VALID [2022-04-28 03:12:52,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {1440#true} ~x~0 := 0;~y~0 := 50; {1445#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:12:52,332 INFO L290 TraceCheckUtils]: 6: Hoare triple {1445#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [78] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_98 v_main_~x~0_97))) (or .cse0 (and .cse0 (<= 50 v_main_~x~0_98)) (and (< v_main_~x~0_97 51) (< v_main_~x~0_98 v_main_~x~0_97)))) InVars {main_~x~0=v_main_~x~0_98} OutVars{main_~x~0=v_main_~x~0_97} AuxVars[] AssignedVars[main_~x~0] {1446#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:12:52,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {1446#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [79] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1446#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:12:52,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {1446#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [80] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_53 v_main_~y~0_52)) (.cse1 (= v_main_~x~0_100 v_main_~x~0_99)) (.cse2 (<= 50 v_main_~x~0_100))) (or (and .cse0 .cse1) (and (or (not .cse2) (not (< v_main_~x~0_100 100))) .cse0 .cse1) (and .cse2 (< v_main_~x~0_100 v_main_~x~0_99) (< v_main_~x~0_99 101) (= (+ v_main_~x~0_99 v_main_~y~0_53) (+ v_main_~x~0_100 v_main_~y~0_52))))) InVars {main_~x~0=v_main_~x~0_100, main_~y~0=v_main_~y~0_53} OutVars{main_~x~0=v_main_~x~0_99, main_~y~0=v_main_~y~0_52} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1447#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:12:52,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {1447#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} [77] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1448#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:12:52,335 INFO L272 TraceCheckUtils]: 10: Hoare triple {1448#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {1449#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:12:52,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {1449#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1450#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:12:52,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {1450#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1441#false} is VALID [2022-04-28 03:12:52,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {1441#false} assume !false; {1441#false} is VALID [2022-04-28 03:12:52,336 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:52,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:12:52,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159182821] [2022-04-28 03:12:52,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159182821] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:12:52,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901735944] [2022-04-28 03:12:52,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:52,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:12:52,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:12:52,340 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:52,342 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:52,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:52,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:12:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:52,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:12:52,769 INFO L272 TraceCheckUtils]: 0: Hoare triple {1440#true} call ULTIMATE.init(); {1440#true} is VALID [2022-04-28 03:12:52,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {1440#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); {1440#true} is VALID [2022-04-28 03:12:52,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {1440#true} assume true; {1440#true} is VALID [2022-04-28 03:12:52,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1440#true} {1440#true} #56#return; {1440#true} is VALID [2022-04-28 03:12:52,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {1440#true} call #t~ret1 := main(); {1440#true} is VALID [2022-04-28 03:12:52,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {1440#true} ~x~0 := 0;~y~0 := 50; {1470#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:12:52,771 INFO L290 TraceCheckUtils]: 6: Hoare triple {1470#(and (<= main_~x~0 0) (= main_~y~0 50))} [78] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_98 v_main_~x~0_97))) (or .cse0 (and .cse0 (<= 50 v_main_~x~0_98)) (and (< v_main_~x~0_97 51) (< v_main_~x~0_98 v_main_~x~0_97)))) InVars {main_~x~0=v_main_~x~0_98} OutVars{main_~x~0=v_main_~x~0_97} AuxVars[] AssignedVars[main_~x~0] {1474#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:12:52,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {1474#(and (= main_~y~0 50) (< main_~x~0 51))} [79] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1474#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:12:52,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {1474#(and (= main_~y~0 50) (< main_~x~0 51))} [80] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_53 v_main_~y~0_52)) (.cse1 (= v_main_~x~0_100 v_main_~x~0_99)) (.cse2 (<= 50 v_main_~x~0_100))) (or (and .cse0 .cse1) (and (or (not .cse2) (not (< v_main_~x~0_100 100))) .cse0 .cse1) (and .cse2 (< v_main_~x~0_100 v_main_~x~0_99) (< v_main_~x~0_99 101) (= (+ v_main_~x~0_99 v_main_~y~0_53) (+ v_main_~x~0_100 v_main_~y~0_52))))) InVars {main_~x~0=v_main_~x~0_100, main_~y~0=v_main_~y~0_53} OutVars{main_~x~0=v_main_~x~0_99, main_~y~0=v_main_~y~0_52} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1481#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:12:52,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {1481#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [77] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1448#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:12:52,777 INFO L272 TraceCheckUtils]: 10: Hoare triple {1448#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {1488#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:12:52,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {1488#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1492#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:12:52,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {1492#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1441#false} is VALID [2022-04-28 03:12:52,778 INFO L290 TraceCheckUtils]: 13: Hoare triple {1441#false} assume !false; {1441#false} is VALID [2022-04-28 03:12:52,778 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:52,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:12:53,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {1441#false} assume !false; {1441#false} is VALID [2022-04-28 03:12:53,317 INFO L290 TraceCheckUtils]: 12: Hoare triple {1492#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1441#false} is VALID [2022-04-28 03:12:53,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {1488#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1492#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:12:53,319 INFO L272 TraceCheckUtils]: 10: Hoare triple {1448#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {1488#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:12:53,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {1511#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [77] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1448#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:12:53,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {1515#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (< main_~x~0 (+ main_~y~0 1)) (not (<= 50 main_~x~0)) (<= 99 main_~y~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [80] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_53 v_main_~y~0_52)) (.cse1 (= v_main_~x~0_100 v_main_~x~0_99)) (.cse2 (<= 50 v_main_~x~0_100))) (or (and .cse0 .cse1) (and (or (not .cse2) (not (< v_main_~x~0_100 100))) .cse0 .cse1) (and .cse2 (< v_main_~x~0_100 v_main_~x~0_99) (< v_main_~x~0_99 101) (= (+ v_main_~x~0_99 v_main_~y~0_53) (+ v_main_~x~0_100 v_main_~y~0_52))))) InVars {main_~x~0=v_main_~x~0_100, main_~y~0=v_main_~y~0_53} OutVars{main_~x~0=v_main_~x~0_99, main_~y~0=v_main_~y~0_52} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1511#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:12:53,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {1515#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (< main_~x~0 (+ main_~y~0 1)) (not (<= 50 main_~x~0)) (<= 99 main_~y~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [79] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1515#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (< main_~x~0 (+ main_~y~0 1)) (not (<= 50 main_~x~0)) (<= 99 main_~y~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:12:53,323 INFO L290 TraceCheckUtils]: 6: Hoare triple {1522#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (<= 50 main_~y~0) (<= main_~y~0 100) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [78] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_98 v_main_~x~0_97))) (or .cse0 (and .cse0 (<= 50 v_main_~x~0_98)) (and (< v_main_~x~0_97 51) (< v_main_~x~0_98 v_main_~x~0_97)))) InVars {main_~x~0=v_main_~x~0_98} OutVars{main_~x~0=v_main_~x~0_97} AuxVars[] AssignedVars[main_~x~0] {1515#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (< main_~x~0 (+ main_~y~0 1)) (not (<= 50 main_~x~0)) (<= 99 main_~y~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:12:53,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {1440#true} ~x~0 := 0;~y~0 := 50; {1522#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (<= 50 main_~y~0) (<= main_~y~0 100) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:12:53,323 INFO L272 TraceCheckUtils]: 4: Hoare triple {1440#true} call #t~ret1 := main(); {1440#true} is VALID [2022-04-28 03:12:53,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1440#true} {1440#true} #56#return; {1440#true} is VALID [2022-04-28 03:12:53,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {1440#true} assume true; {1440#true} is VALID [2022-04-28 03:12:53,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {1440#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); {1440#true} is VALID [2022-04-28 03:12:53,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {1440#true} call ULTIMATE.init(); {1440#true} is VALID [2022-04-28 03:12:53,324 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,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901735944] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:12:53,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:12:53,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:12:53,595 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:12:53,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [481949452] [2022-04-28 03:12:53,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [481949452] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:53,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:53,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 03:12:53,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47726355] [2022-04-28 03:12:53,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:12:53,597 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 2 states have call successors, (3), 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 23 [2022-04-28 03:12:53,597 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:12:53,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call 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,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:12:53,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 03:12:53,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:53,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 03:12:53,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2022-04-28 03:12:53,617 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call 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,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:54,194 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-28 03:12:54,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 03:12:54,195 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 2 states have call successors, (3), 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 23 [2022-04-28 03:12:54,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:12:54,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call 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,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 39 transitions. [2022-04-28 03:12:54,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call 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,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 39 transitions. [2022-04-28 03:12:54,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 39 transitions. [2022-04-28 03:12:54,237 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,238 INFO L225 Difference]: With dead ends: 34 [2022-04-28 03:12:54,238 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 03:12:54,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=193, Invalid=737, Unknown=0, NotChecked=0, Total=930 [2022-04-28 03:12:54,239 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:12:54,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 63 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:12:54,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 03:12:54,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-28 03:12:54,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:12:54,270 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call 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,270 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call 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,270 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call 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,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:54,271 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-28 03:12:54,272 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-28 03:12:54,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:54,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:54,272 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 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:54,272 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 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:54,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:54,273 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-28 03:12:54,273 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-28 03:12:54,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:54,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:54,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:12:54,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:12:54,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call 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,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-04-28 03:12:54,275 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 23 [2022-04-28 03:12:54,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:12:54,275 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-04-28 03:12:54,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call 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,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 29 transitions. [2022-04-28 03:12:54,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:12:54,312 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-28 03:12:54,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 03:12:54,312 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:12:54,312 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:12:54,329 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:54,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:12:54,516 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:12:54,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:12:54,516 INFO L85 PathProgramCache]: Analyzing trace with hash 2039763733, now seen corresponding path program 6 times [2022-04-28 03:12:54,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:54,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [74973328] [2022-04-28 03:12:57,813 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:12:57,856 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:12:58,126 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:12:58,128 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:12:58,130 INFO L85 PathProgramCache]: Analyzing trace with hash 618584012, now seen corresponding path program 1 times [2022-04-28 03:12:58,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:12:58,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293076211] [2022-04-28 03:12:58,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:58,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:12:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:58,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:12:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:58,243 INFO L290 TraceCheckUtils]: 0: Hoare triple {1751#(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); {1740#true} is VALID [2022-04-28 03:12:58,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {1740#true} assume true; {1740#true} is VALID [2022-04-28 03:12:58,244 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1740#true} {1740#true} #56#return; {1740#true} is VALID [2022-04-28 03:12:58,244 INFO L272 TraceCheckUtils]: 0: Hoare triple {1740#true} call ULTIMATE.init(); {1751#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:12:58,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {1751#(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); {1740#true} is VALID [2022-04-28 03:12:58,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {1740#true} assume true; {1740#true} is VALID [2022-04-28 03:12:58,244 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1740#true} {1740#true} #56#return; {1740#true} is VALID [2022-04-28 03:12:58,244 INFO L272 TraceCheckUtils]: 4: Hoare triple {1740#true} call #t~ret1 := main(); {1740#true} is VALID [2022-04-28 03:12:58,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {1740#true} ~x~0 := 0;~y~0 := 50; {1745#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:12:58,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {1745#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [82] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_121 v_main_~x~0_120))) (or (and (not (< v_main_~x~0_121 50)) .cse0) (and (< v_main_~x~0_121 v_main_~x~0_120) (< v_main_~x~0_120 51)) .cse0)) InVars {main_~x~0=v_main_~x~0_121} OutVars{main_~x~0=v_main_~x~0_120} AuxVars[] AssignedVars[main_~x~0] {1746#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:12:58,246 INFO L290 TraceCheckUtils]: 7: Hoare triple {1746#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [83] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1746#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:12:58,247 INFO L290 TraceCheckUtils]: 8: Hoare triple {1746#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [84] L28-2-->L27-2_primed: Formula: (let ((.cse2 (<= 50 v_main_~x~0_123)) (.cse0 (= v_main_~y~0_67 v_main_~y~0_66)) (.cse1 (= v_main_~x~0_123 v_main_~x~0_122))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_123 100)))) (and .cse2 (< v_main_~x~0_122 101) (= (+ v_main_~x~0_123 v_main_~y~0_66) (+ v_main_~x~0_122 v_main_~y~0_67)) (< v_main_~x~0_123 v_main_~x~0_122)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_123, main_~y~0=v_main_~y~0_67} OutVars{main_~x~0=v_main_~x~0_122, main_~y~0=v_main_~y~0_66} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1747#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:12:58,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {1747#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} [81] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1748#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:12:58,248 INFO L272 TraceCheckUtils]: 10: Hoare triple {1748#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {1749#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:12:58,249 INFO L290 TraceCheckUtils]: 11: Hoare triple {1749#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1750#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:12:58,249 INFO L290 TraceCheckUtils]: 12: Hoare triple {1750#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1741#false} is VALID [2022-04-28 03:12:58,249 INFO L290 TraceCheckUtils]: 13: Hoare triple {1741#false} assume !false; {1741#false} is VALID [2022-04-28 03:12:58,249 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:58,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:12:58,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293076211] [2022-04-28 03:12:58,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293076211] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:12:58,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528959502] [2022-04-28 03:12:58,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:58,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:12:58,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:12:58,251 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:12:58,252 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:12:58,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:58,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:12:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:58,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:12:58,556 INFO L272 TraceCheckUtils]: 0: Hoare triple {1740#true} call ULTIMATE.init(); {1740#true} is VALID [2022-04-28 03:12:58,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {1740#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); {1740#true} is VALID [2022-04-28 03:12:58,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {1740#true} assume true; {1740#true} is VALID [2022-04-28 03:12:58,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1740#true} {1740#true} #56#return; {1740#true} is VALID [2022-04-28 03:12:58,556 INFO L272 TraceCheckUtils]: 4: Hoare triple {1740#true} call #t~ret1 := main(); {1740#true} is VALID [2022-04-28 03:12:58,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {1740#true} ~x~0 := 0;~y~0 := 50; {1770#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:12:58,557 INFO L290 TraceCheckUtils]: 6: Hoare triple {1770#(and (<= main_~x~0 0) (= main_~y~0 50))} [82] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_121 v_main_~x~0_120))) (or (and (not (< v_main_~x~0_121 50)) .cse0) (and (< v_main_~x~0_121 v_main_~x~0_120) (< v_main_~x~0_120 51)) .cse0)) InVars {main_~x~0=v_main_~x~0_121} OutVars{main_~x~0=v_main_~x~0_120} AuxVars[] AssignedVars[main_~x~0] {1774#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:12:58,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {1774#(and (= main_~y~0 50) (< main_~x~0 51))} [83] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1774#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:12:58,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {1774#(and (= main_~y~0 50) (< main_~x~0 51))} [84] L28-2-->L27-2_primed: Formula: (let ((.cse2 (<= 50 v_main_~x~0_123)) (.cse0 (= v_main_~y~0_67 v_main_~y~0_66)) (.cse1 (= v_main_~x~0_123 v_main_~x~0_122))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_123 100)))) (and .cse2 (< v_main_~x~0_122 101) (= (+ v_main_~x~0_123 v_main_~y~0_66) (+ v_main_~x~0_122 v_main_~y~0_67)) (< v_main_~x~0_123 v_main_~x~0_122)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_123, main_~y~0=v_main_~y~0_67} OutVars{main_~x~0=v_main_~x~0_122, main_~y~0=v_main_~y~0_66} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1781#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:12:58,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {1781#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [81] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1748#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:12:58,560 INFO L272 TraceCheckUtils]: 10: Hoare triple {1748#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {1788#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:12:58,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {1788#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1792#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:12:58,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {1792#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1741#false} is VALID [2022-04-28 03:12:58,561 INFO L290 TraceCheckUtils]: 13: Hoare triple {1741#false} assume !false; {1741#false} is VALID [2022-04-28 03:12:58,562 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:58,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:12:59,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {1741#false} assume !false; {1741#false} is VALID [2022-04-28 03:12:59,072 INFO L290 TraceCheckUtils]: 12: Hoare triple {1792#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1741#false} is VALID [2022-04-28 03:12:59,072 INFO L290 TraceCheckUtils]: 11: Hoare triple {1788#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1792#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:12:59,073 INFO L272 TraceCheckUtils]: 10: Hoare triple {1748#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {1788#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:12:59,073 INFO L290 TraceCheckUtils]: 9: Hoare triple {1811#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [81] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1748#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:12:59,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {1815#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [84] L28-2-->L27-2_primed: Formula: (let ((.cse2 (<= 50 v_main_~x~0_123)) (.cse0 (= v_main_~y~0_67 v_main_~y~0_66)) (.cse1 (= v_main_~x~0_123 v_main_~x~0_122))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_123 100)))) (and .cse2 (< v_main_~x~0_122 101) (= (+ v_main_~x~0_123 v_main_~y~0_66) (+ v_main_~x~0_122 v_main_~y~0_67)) (< v_main_~x~0_123 v_main_~x~0_122)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_123, main_~y~0=v_main_~y~0_67} OutVars{main_~x~0=v_main_~x~0_122, main_~y~0=v_main_~y~0_66} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1811#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:12:59,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {1815#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [83] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1815#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:12:59,076 INFO L290 TraceCheckUtils]: 6: Hoare triple {1822#(and (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)) (or (and (< main_~x~0 (+ main_~y~0 1)) (<= 50 main_~y~0)) (<= 99 main_~y~0)))} [82] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_121 v_main_~x~0_120))) (or (and (not (< v_main_~x~0_121 50)) .cse0) (and (< v_main_~x~0_121 v_main_~x~0_120) (< v_main_~x~0_120 51)) .cse0)) InVars {main_~x~0=v_main_~x~0_121} OutVars{main_~x~0=v_main_~x~0_120} AuxVars[] AssignedVars[main_~x~0] {1815#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:12:59,076 INFO L290 TraceCheckUtils]: 5: Hoare triple {1740#true} ~x~0 := 0;~y~0 := 50; {1822#(and (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)) (or (and (< main_~x~0 (+ main_~y~0 1)) (<= 50 main_~y~0)) (<= 99 main_~y~0)))} is VALID [2022-04-28 03:12:59,077 INFO L272 TraceCheckUtils]: 4: Hoare triple {1740#true} call #t~ret1 := main(); {1740#true} is VALID [2022-04-28 03:12:59,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1740#true} {1740#true} #56#return; {1740#true} is VALID [2022-04-28 03:12:59,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {1740#true} assume true; {1740#true} is VALID [2022-04-28 03:12:59,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {1740#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); {1740#true} is VALID [2022-04-28 03:12:59,077 INFO L272 TraceCheckUtils]: 0: Hoare triple {1740#true} call ULTIMATE.init(); {1740#true} is VALID [2022-04-28 03:12:59,077 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:59,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528959502] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:12:59,077 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:12:59,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:12:59,368 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:12:59,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [74973328] [2022-04-28 03:12:59,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [74973328] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:59,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:59,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 03:12:59,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311293502] [2022-04-28 03:12:59,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:12:59,369 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 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:59,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:12:59,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 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:59,389 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:59,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 03:12:59,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:59,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 03:12:59,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2022-04-28 03:12:59,390 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 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:59,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:59,977 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-28 03:12:59,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 03:12:59,977 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 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:59,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:12:59,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 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:59,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 41 transitions. [2022-04-28 03:12:59,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 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:59,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 41 transitions. [2022-04-28 03:12:59,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 41 transitions. [2022-04-28 03:13:00,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:00,021 INFO L225 Difference]: With dead ends: 36 [2022-04-28 03:13:00,021 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 03:13:00,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=209, Invalid=847, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 03:13:00,023 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:13:00,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 68 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:13:00,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 03:13:00,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-28 03:13:00,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:13:00,057 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call 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:00,058 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call 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:00,058 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call 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:00,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:00,059 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-04-28 03:13:00,059 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-28 03:13:00,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:00,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:00,059 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 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:13:00,060 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 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:13:00,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:00,061 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-04-28 03:13:00,061 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-28 03:13:00,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:00,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:00,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:13:00,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:13:00,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call 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:00,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-28 03:13:00,062 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 25 [2022-04-28 03:13:00,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:13:00,062 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-28 03:13:00,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 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:13:00,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 31 transitions. [2022-04-28 03:13:00,099 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:00,099 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-28 03:13:00,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 03:13:00,099 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:13:00,099 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:13:00,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 03:13:00,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:13:00,300 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:13:00,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:13:00,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1517434576, now seen corresponding path program 7 times [2022-04-28 03:13:00,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:00,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [877542143] [2022-04-28 03:13:00,415 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:00,625 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:00,626 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:13:00,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1626851124, now seen corresponding path program 1 times [2022-04-28 03:13:00,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:13:00,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599580078] [2022-04-28 03:13:00,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:00,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:13:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:00,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:13:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:00,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {2066#(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); {2055#true} is VALID [2022-04-28 03:13:00,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {2055#true} assume true; {2055#true} is VALID [2022-04-28 03:13:00,754 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2055#true} {2055#true} #56#return; {2055#true} is VALID [2022-04-28 03:13:00,754 INFO L272 TraceCheckUtils]: 0: Hoare triple {2055#true} call ULTIMATE.init(); {2066#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:13:00,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {2066#(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); {2055#true} is VALID [2022-04-28 03:13:00,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {2055#true} assume true; {2055#true} is VALID [2022-04-28 03:13:00,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2055#true} {2055#true} #56#return; {2055#true} is VALID [2022-04-28 03:13:00,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {2055#true} call #t~ret1 := main(); {2055#true} is VALID [2022-04-28 03:13:00,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {2055#true} ~x~0 := 0;~y~0 := 50; {2060#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:13:00,756 INFO L290 TraceCheckUtils]: 6: Hoare triple {2060#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [86] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_145 v_main_~x~0_144))) (or (and (< v_main_~x~0_145 v_main_~x~0_144) (< v_main_~x~0_144 51)) .cse0 (and .cse0 (not (< v_main_~x~0_145 50))))) InVars {main_~x~0=v_main_~x~0_145} OutVars{main_~x~0=v_main_~x~0_144} AuxVars[] AssignedVars[main_~x~0] {2061#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:13:00,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {2061#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [87] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2061#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:13:00,757 INFO L290 TraceCheckUtils]: 8: Hoare triple {2061#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [88] L28-2-->L27-2_primed: Formula: (let ((.cse2 (<= 50 v_main_~x~0_147)) (.cse0 (= v_main_~y~0_82 v_main_~y~0_81)) (.cse1 (= v_main_~x~0_147 v_main_~x~0_146))) (or (and .cse0 .cse1) (and .cse2 (< v_main_~x~0_146 101) (< v_main_~x~0_147 v_main_~x~0_146) (= (+ v_main_~x~0_146 v_main_~y~0_82) (+ v_main_~x~0_147 v_main_~y~0_81))) (and (or (not .cse2) (not (< v_main_~x~0_147 100))) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_147, main_~y~0=v_main_~y~0_82} OutVars{main_~x~0=v_main_~x~0_146, main_~y~0=v_main_~y~0_81} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {2062#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:13:00,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {2062#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} [85] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2063#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:13:00,758 INFO L272 TraceCheckUtils]: 10: Hoare triple {2063#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {2064#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:13:00,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {2064#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2065#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:13:00,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {2065#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2056#false} is VALID [2022-04-28 03:13:00,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {2056#false} assume !false; {2056#false} is VALID [2022-04-28 03:13:00,759 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:00,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:13:00,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599580078] [2022-04-28 03:13:00,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599580078] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:13:00,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930095841] [2022-04-28 03:13:00,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:00,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:13:00,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:13:00,760 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:00,761 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:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:00,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:13:00,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:00,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:13:01,097 INFO L272 TraceCheckUtils]: 0: Hoare triple {2055#true} call ULTIMATE.init(); {2055#true} is VALID [2022-04-28 03:13:01,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {2055#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); {2055#true} is VALID [2022-04-28 03:13:01,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {2055#true} assume true; {2055#true} is VALID [2022-04-28 03:13:01,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2055#true} {2055#true} #56#return; {2055#true} is VALID [2022-04-28 03:13:01,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {2055#true} call #t~ret1 := main(); {2055#true} is VALID [2022-04-28 03:13:01,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {2055#true} ~x~0 := 0;~y~0 := 50; {2085#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:13:01,099 INFO L290 TraceCheckUtils]: 6: Hoare triple {2085#(and (<= main_~x~0 0) (= main_~y~0 50))} [86] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_145 v_main_~x~0_144))) (or (and (< v_main_~x~0_145 v_main_~x~0_144) (< v_main_~x~0_144 51)) .cse0 (and .cse0 (not (< v_main_~x~0_145 50))))) InVars {main_~x~0=v_main_~x~0_145} OutVars{main_~x~0=v_main_~x~0_144} AuxVars[] AssignedVars[main_~x~0] {2089#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:13:01,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {2089#(and (= main_~y~0 50) (< main_~x~0 51))} [87] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2089#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:13:01,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {2089#(and (= main_~y~0 50) (< main_~x~0 51))} [88] L28-2-->L27-2_primed: Formula: (let ((.cse2 (<= 50 v_main_~x~0_147)) (.cse0 (= v_main_~y~0_82 v_main_~y~0_81)) (.cse1 (= v_main_~x~0_147 v_main_~x~0_146))) (or (and .cse0 .cse1) (and .cse2 (< v_main_~x~0_146 101) (< v_main_~x~0_147 v_main_~x~0_146) (= (+ v_main_~x~0_146 v_main_~y~0_82) (+ v_main_~x~0_147 v_main_~y~0_81))) (and (or (not .cse2) (not (< v_main_~x~0_147 100))) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_147, main_~y~0=v_main_~y~0_82} OutVars{main_~x~0=v_main_~x~0_146, main_~y~0=v_main_~y~0_81} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {2096#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:13:01,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {2096#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [85] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2063#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:13:01,102 INFO L272 TraceCheckUtils]: 10: Hoare triple {2063#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {2103#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:13:01,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {2103#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2107#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:13:01,103 INFO L290 TraceCheckUtils]: 12: Hoare triple {2107#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2056#false} is VALID [2022-04-28 03:13:01,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {2056#false} assume !false; {2056#false} is VALID [2022-04-28 03:13:01,103 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:01,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:13:01,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {2056#false} assume !false; {2056#false} is VALID [2022-04-28 03:13:01,596 INFO L290 TraceCheckUtils]: 12: Hoare triple {2107#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2056#false} is VALID [2022-04-28 03:13:01,596 INFO L290 TraceCheckUtils]: 11: Hoare triple {2103#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2107#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:13:01,597 INFO L272 TraceCheckUtils]: 10: Hoare triple {2063#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {2103#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:13:01,598 INFO L290 TraceCheckUtils]: 9: Hoare triple {2126#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [85] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2063#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:13:01,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {2130#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [88] L28-2-->L27-2_primed: Formula: (let ((.cse2 (<= 50 v_main_~x~0_147)) (.cse0 (= v_main_~y~0_82 v_main_~y~0_81)) (.cse1 (= v_main_~x~0_147 v_main_~x~0_146))) (or (and .cse0 .cse1) (and .cse2 (< v_main_~x~0_146 101) (< v_main_~x~0_147 v_main_~x~0_146) (= (+ v_main_~x~0_146 v_main_~y~0_82) (+ v_main_~x~0_147 v_main_~y~0_81))) (and (or (not .cse2) (not (< v_main_~x~0_147 100))) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_147, main_~y~0=v_main_~y~0_82} OutVars{main_~x~0=v_main_~x~0_146, main_~y~0=v_main_~y~0_81} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {2126#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:13:01,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {2130#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [87] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2130#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:13:01,601 INFO L290 TraceCheckUtils]: 6: Hoare triple {2137#(and (<= 50 main_~y~0) (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [86] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_145 v_main_~x~0_144))) (or (and (< v_main_~x~0_145 v_main_~x~0_144) (< v_main_~x~0_144 51)) .cse0 (and .cse0 (not (< v_main_~x~0_145 50))))) InVars {main_~x~0=v_main_~x~0_145} OutVars{main_~x~0=v_main_~x~0_144} AuxVars[] AssignedVars[main_~x~0] {2130#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:13:01,601 INFO L290 TraceCheckUtils]: 5: Hoare triple {2055#true} ~x~0 := 0;~y~0 := 50; {2137#(and (<= 50 main_~y~0) (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:13:01,602 INFO L272 TraceCheckUtils]: 4: Hoare triple {2055#true} call #t~ret1 := main(); {2055#true} is VALID [2022-04-28 03:13:01,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2055#true} {2055#true} #56#return; {2055#true} is VALID [2022-04-28 03:13:01,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {2055#true} assume true; {2055#true} is VALID [2022-04-28 03:13:01,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {2055#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); {2055#true} is VALID [2022-04-28 03:13:01,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {2055#true} call ULTIMATE.init(); {2055#true} is VALID [2022-04-28 03:13:01,602 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:01,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930095841] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:13:01,603 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:13:01,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:13:01,930 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:13:01,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [877542143] [2022-04-28 03:13:01,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [877542143] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:13:01,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:13:01,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 03:13:01,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506823210] [2022-04-28 03:13:01,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:13:01,931 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 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 27 [2022-04-28 03:13:01,931 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:13:01,931 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call 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:01,957 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:13:01,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 03:13:01,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:01,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 03:13:01,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2022-04-28 03:13:01,958 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call 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:02,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:02,651 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-04-28 03:13:02,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 03:13:02,651 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 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 27 [2022-04-28 03:13:02,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:13:02,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call 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:02,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 43 transitions. [2022-04-28 03:13:02,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call 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:02,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 43 transitions. [2022-04-28 03:13:02,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 43 transitions. [2022-04-28 03:13:02,690 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:02,690 INFO L225 Difference]: With dead ends: 38 [2022-04-28 03:13:02,690 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 03:13:02,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=225, Invalid=965, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 03:13:02,692 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 17 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:13:02,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 68 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:13:02,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 03:13:02,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-28 03:13:02,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:13:02,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 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:13:02,728 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 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:13:02,728 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 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:13:02,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:02,729 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-28 03:13:02,729 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-28 03:13:02,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:02,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:02,729 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 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 31 states. [2022-04-28 03:13:02,729 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 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 31 states. [2022-04-28 03:13:02,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:02,730 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-28 03:13:02,730 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-28 03:13:02,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:02,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:02,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:13:02,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:13:02,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 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:13:02,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2022-04-28 03:13:02,732 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2022-04-28 03:13:02,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:13:02,732 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-04-28 03:13:02,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call 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:02,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 33 transitions. [2022-04-28 03:13:02,761 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:13:02,761 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-28 03:13:02,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 03:13:02,762 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:13:02,762 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:13:02,779 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:02,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:13:02,968 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:13:02,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:13:02,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1191041909, now seen corresponding path program 8 times [2022-04-28 03:13:02,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:02,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [148738498] [2022-04-28 03:13:07,034 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:13:07,086 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:09,297 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:13:09,389 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:09,390 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:13:09,393 INFO L85 PathProgramCache]: Analyzing trace with hash 422681036, now seen corresponding path program 1 times [2022-04-28 03:13:09,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:13:09,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838415349] [2022-04-28 03:13:09,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:09,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:13:09,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:09,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:13:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:09,522 INFO L290 TraceCheckUtils]: 0: Hoare triple {2396#(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); {2385#true} is VALID [2022-04-28 03:13:09,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {2385#true} assume true; {2385#true} is VALID [2022-04-28 03:13:09,522 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2385#true} {2385#true} #56#return; {2385#true} is VALID [2022-04-28 03:13:09,523 INFO L272 TraceCheckUtils]: 0: Hoare triple {2385#true} call ULTIMATE.init(); {2396#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:13:09,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {2396#(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); {2385#true} is VALID [2022-04-28 03:13:09,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {2385#true} assume true; {2385#true} is VALID [2022-04-28 03:13:09,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2385#true} {2385#true} #56#return; {2385#true} is VALID [2022-04-28 03:13:09,523 INFO L272 TraceCheckUtils]: 4: Hoare triple {2385#true} call #t~ret1 := main(); {2385#true} is VALID [2022-04-28 03:13:09,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {2385#true} ~x~0 := 0;~y~0 := 50; {2390#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:13:09,525 INFO L290 TraceCheckUtils]: 6: Hoare triple {2390#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [90] L28-2-->L27-2_primed: Formula: (or (and (< v_main_~x~0_169 51) (< v_main_~x~0_170 v_main_~x~0_169)) (and (not (< v_main_~x~0_170 50)) (= v_main_~x~0_169 v_main_~x~0_170)) (= v_main_~x~0_170 v_main_~x~0_169)) InVars {main_~x~0=v_main_~x~0_170} OutVars{main_~x~0=v_main_~x~0_169} AuxVars[] AssignedVars[main_~x~0] {2391#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:13:09,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {2391#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [91] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2391#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:13:09,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {2391#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [92] L28-2-->L27-2_primed: Formula: (let ((.cse1 (= v_main_~y~0_98 v_main_~y~0_97)) (.cse0 (<= 50 v_main_~x~0_172)) (.cse2 (= v_main_~x~0_172 v_main_~x~0_171))) (or (and (< v_main_~x~0_171 101) (= (+ v_main_~x~0_171 v_main_~y~0_98) (+ v_main_~x~0_172 v_main_~y~0_97)) .cse0 (< v_main_~x~0_172 v_main_~x~0_171)) (and .cse1 .cse2) (and .cse1 (or (not .cse0) (not (< v_main_~x~0_172 100))) .cse2))) InVars {main_~x~0=v_main_~x~0_172, main_~y~0=v_main_~y~0_98} OutVars{main_~x~0=v_main_~x~0_171, main_~y~0=v_main_~y~0_97} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {2392#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:13:09,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {2392#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} [89] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2393#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:13:09,528 INFO L272 TraceCheckUtils]: 10: Hoare triple {2393#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {2394#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:13:09,529 INFO L290 TraceCheckUtils]: 11: Hoare triple {2394#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2395#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:13:09,529 INFO L290 TraceCheckUtils]: 12: Hoare triple {2395#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2386#false} is VALID [2022-04-28 03:13:09,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {2386#false} assume !false; {2386#false} is VALID [2022-04-28 03:13:09,530 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:09,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:13:09,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838415349] [2022-04-28 03:13:09,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838415349] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:13:09,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222110664] [2022-04-28 03:13:09,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:09,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:13:09,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:13:09,533 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:09,534 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:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:09,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:13:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:09,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:13:09,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {2385#true} call ULTIMATE.init(); {2385#true} is VALID [2022-04-28 03:13:09,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {2385#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); {2385#true} is VALID [2022-04-28 03:13:09,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {2385#true} assume true; {2385#true} is VALID [2022-04-28 03:13:09,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2385#true} {2385#true} #56#return; {2385#true} is VALID [2022-04-28 03:13:09,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {2385#true} call #t~ret1 := main(); {2385#true} is VALID [2022-04-28 03:13:09,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {2385#true} ~x~0 := 0;~y~0 := 50; {2415#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:13:09,894 INFO L290 TraceCheckUtils]: 6: Hoare triple {2415#(and (<= main_~x~0 0) (= main_~y~0 50))} [90] L28-2-->L27-2_primed: Formula: (or (and (< v_main_~x~0_169 51) (< v_main_~x~0_170 v_main_~x~0_169)) (and (not (< v_main_~x~0_170 50)) (= v_main_~x~0_169 v_main_~x~0_170)) (= v_main_~x~0_170 v_main_~x~0_169)) InVars {main_~x~0=v_main_~x~0_170} OutVars{main_~x~0=v_main_~x~0_169} AuxVars[] AssignedVars[main_~x~0] {2419#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:13:09,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {2419#(and (= main_~y~0 50) (< main_~x~0 51))} [91] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2419#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:13:09,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {2419#(and (= main_~y~0 50) (< main_~x~0 51))} [92] L28-2-->L27-2_primed: Formula: (let ((.cse1 (= v_main_~y~0_98 v_main_~y~0_97)) (.cse0 (<= 50 v_main_~x~0_172)) (.cse2 (= v_main_~x~0_172 v_main_~x~0_171))) (or (and (< v_main_~x~0_171 101) (= (+ v_main_~x~0_171 v_main_~y~0_98) (+ v_main_~x~0_172 v_main_~y~0_97)) .cse0 (< v_main_~x~0_172 v_main_~x~0_171)) (and .cse1 .cse2) (and .cse1 (or (not .cse0) (not (< v_main_~x~0_172 100))) .cse2))) InVars {main_~x~0=v_main_~x~0_172, main_~y~0=v_main_~y~0_98} OutVars{main_~x~0=v_main_~x~0_171, main_~y~0=v_main_~y~0_97} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {2426#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:13:09,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {2426#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [89] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2393#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:13:09,896 INFO L272 TraceCheckUtils]: 10: Hoare triple {2393#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {2433#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:13:09,901 INFO L290 TraceCheckUtils]: 11: Hoare triple {2433#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2437#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:13:09,902 INFO L290 TraceCheckUtils]: 12: Hoare triple {2437#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2386#false} is VALID [2022-04-28 03:13:09,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {2386#false} assume !false; {2386#false} is VALID [2022-04-28 03:13:09,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:13:09,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:13:10,390 INFO L290 TraceCheckUtils]: 13: Hoare triple {2386#false} assume !false; {2386#false} is VALID [2022-04-28 03:13:10,391 INFO L290 TraceCheckUtils]: 12: Hoare triple {2437#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2386#false} is VALID [2022-04-28 03:13:10,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {2433#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2437#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:13:10,392 INFO L272 TraceCheckUtils]: 10: Hoare triple {2393#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {2433#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:13:10,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {2456#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [89] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2393#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:13:10,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {2460#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [92] L28-2-->L27-2_primed: Formula: (let ((.cse1 (= v_main_~y~0_98 v_main_~y~0_97)) (.cse0 (<= 50 v_main_~x~0_172)) (.cse2 (= v_main_~x~0_172 v_main_~x~0_171))) (or (and (< v_main_~x~0_171 101) (= (+ v_main_~x~0_171 v_main_~y~0_98) (+ v_main_~x~0_172 v_main_~y~0_97)) .cse0 (< v_main_~x~0_172 v_main_~x~0_171)) (and .cse1 .cse2) (and .cse1 (or (not .cse0) (not (< v_main_~x~0_172 100))) .cse2))) InVars {main_~x~0=v_main_~x~0_172, main_~y~0=v_main_~y~0_98} OutVars{main_~x~0=v_main_~x~0_171, main_~y~0=v_main_~y~0_97} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {2456#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:13:10,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {2460#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [91] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2460#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:13:10,395 INFO L290 TraceCheckUtils]: 6: Hoare triple {2467#(and (<= 50 main_~y~0) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [90] L28-2-->L27-2_primed: Formula: (or (and (< v_main_~x~0_169 51) (< v_main_~x~0_170 v_main_~x~0_169)) (and (not (< v_main_~x~0_170 50)) (= v_main_~x~0_169 v_main_~x~0_170)) (= v_main_~x~0_170 v_main_~x~0_169)) InVars {main_~x~0=v_main_~x~0_170} OutVars{main_~x~0=v_main_~x~0_169} AuxVars[] AssignedVars[main_~x~0] {2460#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:13:10,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {2385#true} ~x~0 := 0;~y~0 := 50; {2467#(and (<= 50 main_~y~0) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:13:10,395 INFO L272 TraceCheckUtils]: 4: Hoare triple {2385#true} call #t~ret1 := main(); {2385#true} is VALID [2022-04-28 03:13:10,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2385#true} {2385#true} #56#return; {2385#true} is VALID [2022-04-28 03:13:10,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {2385#true} assume true; {2385#true} is VALID [2022-04-28 03:13:10,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {2385#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); {2385#true} is VALID [2022-04-28 03:13:10,396 INFO L272 TraceCheckUtils]: 0: Hoare triple {2385#true} call ULTIMATE.init(); {2385#true} is VALID [2022-04-28 03:13:10,396 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,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222110664] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:13:10,396 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:13:10,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:13:10,764 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:13:10,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [148738498] [2022-04-28 03:13:10,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [148738498] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:13:10,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:13:10,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 03:13:10,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604110423] [2022-04-28 03:13:10,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:13:10,765 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (3), 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 29 [2022-04-28 03:13:10,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:13:10,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call 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,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:10,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 03:13:10,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:10,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 03:13:10,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=557, Unknown=0, NotChecked=0, Total=702 [2022-04-28 03:13:10,788 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call 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:11,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:11,555 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-04-28 03:13:11,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 03:13:11,555 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (3), 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 29 [2022-04-28 03:13:11,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:13:11,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call 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:11,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 45 transitions. [2022-04-28 03:13:11,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call 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:11,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 45 transitions. [2022-04-28 03:13:11,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 45 transitions. [2022-04-28 03:13:11,605 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:11,606 INFO L225 Difference]: With dead ends: 40 [2022-04-28 03:13:11,606 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 03:13:11,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=241, Invalid=1091, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 03:13:11,607 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 18 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:13:11,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 78 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:13:11,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 03:13:11,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-28 03:13:11,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:13:11,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call 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:11,645 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call 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:11,645 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call 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:11,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:11,646 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-28 03:13:11,646 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 03:13:11,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:11,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:11,647 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 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:13:11,647 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 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:13:11,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:11,647 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-28 03:13:11,648 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 03:13:11,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:11,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:11,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:13:11,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:13:11,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call 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:11,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-28 03:13:11,649 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2022-04-28 03:13:11,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:13:11,649 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-28 03:13:11,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call 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:11,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 35 transitions. [2022-04-28 03:13:11,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:11,683 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 03:13:11,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 03:13:11,683 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:13:11,683 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:13:11,699 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:11,884 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,SelfDestructingSolverStorable10 [2022-04-28 03:13:11,884 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:13:11,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:13:11,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1060301530, now seen corresponding path program 9 times [2022-04-28 03:13:11,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:11,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [73968137] [2022-04-28 03:13:11,985 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:12,360 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:12,361 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:13:12,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1822754100, now seen corresponding path program 1 times [2022-04-28 03:13:12,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:13:12,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963287205] [2022-04-28 03:13:12,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:12,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:13:12,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:12,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:13:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:12,464 INFO L290 TraceCheckUtils]: 0: Hoare triple {2741#(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); {2730#true} is VALID [2022-04-28 03:13:12,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {2730#true} assume true; {2730#true} is VALID [2022-04-28 03:13:12,464 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2730#true} {2730#true} #56#return; {2730#true} is VALID [2022-04-28 03:13:12,465 INFO L272 TraceCheckUtils]: 0: Hoare triple {2730#true} call ULTIMATE.init(); {2741#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:13:12,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {2741#(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); {2730#true} is VALID [2022-04-28 03:13:12,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {2730#true} assume true; {2730#true} is VALID [2022-04-28 03:13:12,465 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2730#true} {2730#true} #56#return; {2730#true} is VALID [2022-04-28 03:13:12,465 INFO L272 TraceCheckUtils]: 4: Hoare triple {2730#true} call #t~ret1 := main(); {2730#true} is VALID [2022-04-28 03:13:12,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {2730#true} ~x~0 := 0;~y~0 := 50; {2735#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:13:12,466 INFO L290 TraceCheckUtils]: 6: Hoare triple {2735#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [94] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_196 v_main_~x~0_195))) (or (and (< v_main_~x~0_196 v_main_~x~0_195) (< v_main_~x~0_195 51)) .cse0 (and .cse0 (<= 50 v_main_~x~0_196)))) InVars {main_~x~0=v_main_~x~0_196} OutVars{main_~x~0=v_main_~x~0_195} AuxVars[] AssignedVars[main_~x~0] {2736#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:13:12,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {2736#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [95] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2736#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:13:12,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {2736#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [96] L28-2-->L27-2_primed: Formula: (let ((.cse2 (<= 50 v_main_~x~0_198)) (.cse0 (= v_main_~y~0_115 v_main_~y~0_114)) (.cse1 (= v_main_~x~0_198 v_main_~x~0_197))) (or (and .cse0 .cse1) (and (< v_main_~x~0_197 101) (< v_main_~x~0_198 v_main_~x~0_197) .cse2 (= (+ v_main_~x~0_198 v_main_~y~0_114) (+ v_main_~x~0_197 v_main_~y~0_115))) (and (or (not .cse2) (not (< v_main_~x~0_198 100))) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_198, main_~y~0=v_main_~y~0_115} OutVars{main_~x~0=v_main_~x~0_197, main_~y~0=v_main_~y~0_114} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {2737#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:13:12,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {2737#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} [93] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2738#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:13:12,469 INFO L272 TraceCheckUtils]: 10: Hoare triple {2738#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {2739#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:13:12,469 INFO L290 TraceCheckUtils]: 11: Hoare triple {2739#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2740#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:13:12,469 INFO L290 TraceCheckUtils]: 12: Hoare triple {2740#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2731#false} is VALID [2022-04-28 03:13:12,469 INFO L290 TraceCheckUtils]: 13: Hoare triple {2731#false} assume !false; {2731#false} is VALID [2022-04-28 03:13:12,470 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,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:13:12,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963287205] [2022-04-28 03:13:12,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963287205] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:13:12,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064116159] [2022-04-28 03:13:12,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:12,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:13:12,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:13:12,471 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:12,472 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:12,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:12,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:13:12,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:12,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:13:12,823 INFO L272 TraceCheckUtils]: 0: Hoare triple {2730#true} call ULTIMATE.init(); {2730#true} is VALID [2022-04-28 03:13:12,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {2730#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); {2730#true} is VALID [2022-04-28 03:13:12,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {2730#true} assume true; {2730#true} is VALID [2022-04-28 03:13:12,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2730#true} {2730#true} #56#return; {2730#true} is VALID [2022-04-28 03:13:12,824 INFO L272 TraceCheckUtils]: 4: Hoare triple {2730#true} call #t~ret1 := main(); {2730#true} is VALID [2022-04-28 03:13:12,824 INFO L290 TraceCheckUtils]: 5: Hoare triple {2730#true} ~x~0 := 0;~y~0 := 50; {2760#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:13:12,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {2760#(and (<= main_~x~0 0) (= main_~y~0 50))} [94] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_196 v_main_~x~0_195))) (or (and (< v_main_~x~0_196 v_main_~x~0_195) (< v_main_~x~0_195 51)) .cse0 (and .cse0 (<= 50 v_main_~x~0_196)))) InVars {main_~x~0=v_main_~x~0_196} OutVars{main_~x~0=v_main_~x~0_195} AuxVars[] AssignedVars[main_~x~0] {2764#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:13:12,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {2764#(and (= main_~y~0 50) (< main_~x~0 51))} [95] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2764#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:13:12,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {2764#(and (= main_~y~0 50) (< main_~x~0 51))} [96] L28-2-->L27-2_primed: Formula: (let ((.cse2 (<= 50 v_main_~x~0_198)) (.cse0 (= v_main_~y~0_115 v_main_~y~0_114)) (.cse1 (= v_main_~x~0_198 v_main_~x~0_197))) (or (and .cse0 .cse1) (and (< v_main_~x~0_197 101) (< v_main_~x~0_198 v_main_~x~0_197) .cse2 (= (+ v_main_~x~0_198 v_main_~y~0_114) (+ v_main_~x~0_197 v_main_~y~0_115))) (and (or (not .cse2) (not (< v_main_~x~0_198 100))) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_198, main_~y~0=v_main_~y~0_115} OutVars{main_~x~0=v_main_~x~0_197, main_~y~0=v_main_~y~0_114} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {2771#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:13:12,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {2771#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [93] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2738#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:13:12,828 INFO L272 TraceCheckUtils]: 10: Hoare triple {2738#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {2778#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:13:12,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {2778#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2782#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:13:12,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {2782#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2731#false} is VALID [2022-04-28 03:13:12,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {2731#false} assume !false; {2731#false} is VALID [2022-04-28 03:13:12,829 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,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:13:13,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {2731#false} assume !false; {2731#false} is VALID [2022-04-28 03:13:13,362 INFO L290 TraceCheckUtils]: 12: Hoare triple {2782#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2731#false} is VALID [2022-04-28 03:13:13,362 INFO L290 TraceCheckUtils]: 11: Hoare triple {2778#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2782#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:13:13,363 INFO L272 TraceCheckUtils]: 10: Hoare triple {2738#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {2778#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:13:13,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {2801#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [93] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2738#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:13:13,364 INFO L290 TraceCheckUtils]: 8: Hoare triple {2805#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [96] L28-2-->L27-2_primed: Formula: (let ((.cse2 (<= 50 v_main_~x~0_198)) (.cse0 (= v_main_~y~0_115 v_main_~y~0_114)) (.cse1 (= v_main_~x~0_198 v_main_~x~0_197))) (or (and .cse0 .cse1) (and (< v_main_~x~0_197 101) (< v_main_~x~0_198 v_main_~x~0_197) .cse2 (= (+ v_main_~x~0_198 v_main_~y~0_114) (+ v_main_~x~0_197 v_main_~y~0_115))) (and (or (not .cse2) (not (< v_main_~x~0_198 100))) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_198, main_~y~0=v_main_~y~0_115} OutVars{main_~x~0=v_main_~x~0_197, main_~y~0=v_main_~y~0_114} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {2801#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:13:13,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {2805#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [95] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2805#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:13:13,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {2812#(and (<= 50 main_~y~0) (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [94] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_196 v_main_~x~0_195))) (or (and (< v_main_~x~0_196 v_main_~x~0_195) (< v_main_~x~0_195 51)) .cse0 (and .cse0 (<= 50 v_main_~x~0_196)))) InVars {main_~x~0=v_main_~x~0_196} OutVars{main_~x~0=v_main_~x~0_195} AuxVars[] AssignedVars[main_~x~0] {2805#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:13:13,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {2730#true} ~x~0 := 0;~y~0 := 50; {2812#(and (<= 50 main_~y~0) (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:13:13,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {2730#true} call #t~ret1 := main(); {2730#true} is VALID [2022-04-28 03:13:13,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2730#true} {2730#true} #56#return; {2730#true} is VALID [2022-04-28 03:13:13,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {2730#true} assume true; {2730#true} is VALID [2022-04-28 03:13:13,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {2730#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); {2730#true} is VALID [2022-04-28 03:13:13,367 INFO L272 TraceCheckUtils]: 0: Hoare triple {2730#true} call ULTIMATE.init(); {2730#true} is VALID [2022-04-28 03:13:13,367 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:13,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064116159] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:13:13,367 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:13:13,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:13:13,758 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:13:13,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [73968137] [2022-04-28 03:13:13,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [73968137] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:13:13,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:13:13,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 03:13:13,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071195780] [2022-04-28 03:13:13,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:13:13,759 INFO L78 Accepts]: Start accepts. Automaton has has 17 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:13,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:13:13,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 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:13,782 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:13,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 03:13:13,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:13,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 03:13:13,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2022-04-28 03:13:13,783 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 17 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:14,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:14,669 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-28 03:13:14,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 03:13:14,669 INFO L78 Accepts]: Start accepts. Automaton has has 17 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:14,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:13:14,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 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:14,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 47 transitions. [2022-04-28 03:13:14,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 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:14,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 47 transitions. [2022-04-28 03:13:14,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 47 transitions. [2022-04-28 03:13:14,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:14,713 INFO L225 Difference]: With dead ends: 42 [2022-04-28 03:13:14,713 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 03:13:14,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=257, Invalid=1225, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 03:13:14,714 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 19 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:13:14,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 83 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:13:14,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 03:13:14,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-28 03:13:14,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:13:14,769 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call 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:14,769 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call 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:14,769 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call 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:14,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:14,770 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-28 03:13:14,770 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-28 03:13:14,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:14,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:14,770 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 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 35 states. [2022-04-28 03:13:14,771 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 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 35 states. [2022-04-28 03:13:14,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:14,771 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-28 03:13:14,771 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-28 03:13:14,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:14,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:14,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:13:14,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:13:14,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call 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:14,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2022-04-28 03:13:14,773 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 31 [2022-04-28 03:13:14,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:13:14,773 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2022-04-28 03:13:14,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 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:14,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 37 transitions. [2022-04-28 03:13:14,803 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:14,803 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-28 03:13:14,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 03:13:14,803 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:13:14,804 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:13:14,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 03:13:15,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:13:15,008 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:13:15,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:13:15,008 INFO L85 PathProgramCache]: Analyzing trace with hash 27151105, now seen corresponding path program 10 times [2022-04-28 03:13:15,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:15,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1651659813] [2022-04-28 03:13:15,101 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:15,328 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:15,329 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:13:15,331 INFO L85 PathProgramCache]: Analyzing trace with hash 226778060, now seen corresponding path program 1 times [2022-04-28 03:13:15,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:13:15,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027496405] [2022-04-28 03:13:15,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:15,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:13:15,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:15,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:13:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:15,432 INFO L290 TraceCheckUtils]: 0: Hoare triple {3101#(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); {3090#true} is VALID [2022-04-28 03:13:15,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {3090#true} assume true; {3090#true} is VALID [2022-04-28 03:13:15,433 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3090#true} {3090#true} #56#return; {3090#true} is VALID [2022-04-28 03:13:15,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {3090#true} call ULTIMATE.init(); {3101#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:13:15,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {3101#(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); {3090#true} is VALID [2022-04-28 03:13:15,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {3090#true} assume true; {3090#true} is VALID [2022-04-28 03:13:15,434 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3090#true} {3090#true} #56#return; {3090#true} is VALID [2022-04-28 03:13:15,434 INFO L272 TraceCheckUtils]: 4: Hoare triple {3090#true} call #t~ret1 := main(); {3090#true} is VALID [2022-04-28 03:13:15,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {3090#true} ~x~0 := 0;~y~0 := 50; {3095#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:13:15,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {3095#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [98] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_223 v_main_~x~0_222))) (or (and (< v_main_~x~0_223 v_main_~x~0_222) (< v_main_~x~0_222 51)) (and (not (< v_main_~x~0_223 50)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_223} OutVars{main_~x~0=v_main_~x~0_222} AuxVars[] AssignedVars[main_~x~0] {3096#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:13:15,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {3096#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [99] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3096#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:13:15,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {3096#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [100] L28-2-->L27-2_primed: Formula: (let ((.cse1 (<= 50 v_main_~x~0_225)) (.cse2 (= v_main_~x~0_225 v_main_~x~0_224)) (.cse3 (= v_main_~y~0_133 v_main_~y~0_132))) (or (let ((.cse0 (+ v_main_~x~0_225 v_main_~y~0_132))) (and (< v_main_~y~0_133 v_main_~y~0_132) (= .cse0 (+ v_main_~x~0_224 v_main_~y~0_133)) .cse1 (< .cse0 (+ 101 v_main_~y~0_133)))) (and (or (not (< v_main_~x~0_225 100)) (not .cse1)) .cse2 .cse3) (and .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_225, main_~y~0=v_main_~y~0_133} OutVars{main_~x~0=v_main_~x~0_224, main_~y~0=v_main_~y~0_132} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {3097#(or (and (or (< 99 main_~y~0) (<= main_~x~0 main_~y~0)) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:13:15,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {3097#(or (and (or (< 99 main_~y~0) (<= main_~x~0 main_~y~0)) (<= main_~y~0 100)) (<= main_~x~0 50))} [97] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3098#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:13:15,437 INFO L272 TraceCheckUtils]: 10: Hoare triple {3098#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {3099#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:13:15,438 INFO L290 TraceCheckUtils]: 11: Hoare triple {3099#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3100#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:13:15,438 INFO L290 TraceCheckUtils]: 12: Hoare triple {3100#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3091#false} is VALID [2022-04-28 03:13:15,439 INFO L290 TraceCheckUtils]: 13: Hoare triple {3091#false} assume !false; {3091#false} is VALID [2022-04-28 03:13:15,439 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:15,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:13:15,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027496405] [2022-04-28 03:13:15,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027496405] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:13:15,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855749415] [2022-04-28 03:13:15,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:15,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:13:15,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:13:15,440 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:15,441 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:15,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:15,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:13:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:15,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:13:15,741 INFO L272 TraceCheckUtils]: 0: Hoare triple {3090#true} call ULTIMATE.init(); {3090#true} is VALID [2022-04-28 03:13:15,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {3090#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); {3090#true} is VALID [2022-04-28 03:13:15,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {3090#true} assume true; {3090#true} is VALID [2022-04-28 03:13:15,741 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3090#true} {3090#true} #56#return; {3090#true} is VALID [2022-04-28 03:13:15,742 INFO L272 TraceCheckUtils]: 4: Hoare triple {3090#true} call #t~ret1 := main(); {3090#true} is VALID [2022-04-28 03:13:15,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {3090#true} ~x~0 := 0;~y~0 := 50; {3120#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:13:15,743 INFO L290 TraceCheckUtils]: 6: Hoare triple {3120#(and (<= main_~x~0 0) (= main_~y~0 50))} [98] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_223 v_main_~x~0_222))) (or (and (< v_main_~x~0_223 v_main_~x~0_222) (< v_main_~x~0_222 51)) (and (not (< v_main_~x~0_223 50)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_223} OutVars{main_~x~0=v_main_~x~0_222} AuxVars[] AssignedVars[main_~x~0] {3124#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:13:15,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {3124#(and (= main_~y~0 50) (< main_~x~0 51))} [99] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3124#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:13:15,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {3124#(and (= main_~y~0 50) (< main_~x~0 51))} [100] L28-2-->L27-2_primed: Formula: (let ((.cse1 (<= 50 v_main_~x~0_225)) (.cse2 (= v_main_~x~0_225 v_main_~x~0_224)) (.cse3 (= v_main_~y~0_133 v_main_~y~0_132))) (or (let ((.cse0 (+ v_main_~x~0_225 v_main_~y~0_132))) (and (< v_main_~y~0_133 v_main_~y~0_132) (= .cse0 (+ v_main_~x~0_224 v_main_~y~0_133)) .cse1 (< .cse0 (+ 101 v_main_~y~0_133)))) (and (or (not (< v_main_~x~0_225 100)) (not .cse1)) .cse2 .cse3) (and .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_225, main_~y~0=v_main_~y~0_133} OutVars{main_~x~0=v_main_~x~0_224, main_~y~0=v_main_~y~0_132} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {3131#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:13:15,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {3131#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [97] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3098#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:13:15,745 INFO L272 TraceCheckUtils]: 10: Hoare triple {3098#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {3138#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:13:15,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {3138#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3142#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:13:15,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {3142#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3091#false} is VALID [2022-04-28 03:13:15,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {3091#false} assume !false; {3091#false} is VALID [2022-04-28 03:13:15,746 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:15,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:13:16,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {3091#false} assume !false; {3091#false} is VALID [2022-04-28 03:13:16,224 INFO L290 TraceCheckUtils]: 12: Hoare triple {3142#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3091#false} is VALID [2022-04-28 03:13:16,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {3138#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3142#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:13:16,225 INFO L272 TraceCheckUtils]: 10: Hoare triple {3098#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {3138#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:13:16,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {3161#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [97] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3098#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:13:16,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {3165#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [100] L28-2-->L27-2_primed: Formula: (let ((.cse1 (<= 50 v_main_~x~0_225)) (.cse2 (= v_main_~x~0_225 v_main_~x~0_224)) (.cse3 (= v_main_~y~0_133 v_main_~y~0_132))) (or (let ((.cse0 (+ v_main_~x~0_225 v_main_~y~0_132))) (and (< v_main_~y~0_133 v_main_~y~0_132) (= .cse0 (+ v_main_~x~0_224 v_main_~y~0_133)) .cse1 (< .cse0 (+ 101 v_main_~y~0_133)))) (and (or (not (< v_main_~x~0_225 100)) (not .cse1)) .cse2 .cse3) (and .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_225, main_~y~0=v_main_~y~0_133} OutVars{main_~x~0=v_main_~x~0_224, main_~y~0=v_main_~y~0_132} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {3161#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:13:16,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {3165#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [99] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3165#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:13:16,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {3172#(and (<= 50 main_~y~0) (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [98] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_223 v_main_~x~0_222))) (or (and (< v_main_~x~0_223 v_main_~x~0_222) (< v_main_~x~0_222 51)) (and (not (< v_main_~x~0_223 50)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_223} OutVars{main_~x~0=v_main_~x~0_222} AuxVars[] AssignedVars[main_~x~0] {3165#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:13:16,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {3090#true} ~x~0 := 0;~y~0 := 50; {3172#(and (<= 50 main_~y~0) (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:13:16,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {3090#true} call #t~ret1 := main(); {3090#true} is VALID [2022-04-28 03:13:16,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3090#true} {3090#true} #56#return; {3090#true} is VALID [2022-04-28 03:13:16,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {3090#true} assume true; {3090#true} is VALID [2022-04-28 03:13:16,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {3090#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); {3090#true} is VALID [2022-04-28 03:13:16,229 INFO L272 TraceCheckUtils]: 0: Hoare triple {3090#true} call ULTIMATE.init(); {3090#true} is VALID [2022-04-28 03:13:16,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:13:16,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855749415] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:13:16,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:13:16,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:13:16,679 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:13:16,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1651659813] [2022-04-28 03:13:16,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1651659813] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:13:16,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:13:16,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 03:13:16,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800094428] [2022-04-28 03:13:16,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:13:16,680 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 states have internal predecessors, (29), 2 states have call successors, (3), 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 33 [2022-04-28 03:13:16,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:13:16,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call 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:16,705 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:13:16,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 03:13:16,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:16,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 03:13:16,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2022-04-28 03:13:16,706 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 18 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call 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:17,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:17,659 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-04-28 03:13:17,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 03:13:17,659 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 states have internal predecessors, (29), 2 states have call successors, (3), 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 33 [2022-04-28 03:13:17,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:13:17,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call 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:17,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 49 transitions. [2022-04-28 03:13:17,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call 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:17,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 49 transitions. [2022-04-28 03:13:17,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 49 transitions. [2022-04-28 03:13:17,709 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:17,710 INFO L225 Difference]: With dead ends: 44 [2022-04-28 03:13:17,710 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 03:13:17,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=273, Invalid=1367, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 03:13:17,711 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 20 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:13:17,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 83 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 03:13:17,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 03:13:17,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-28 03:13:17,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:13:17,765 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.09375) internal successors, (35), 32 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:13:17,765 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.09375) internal successors, (35), 32 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:13:17,765 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.09375) internal successors, (35), 32 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:13:17,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:17,766 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-28 03:13:17,766 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-28 03:13:17,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:17,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:17,767 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.09375) internal successors, (35), 32 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 37 states. [2022-04-28 03:13:17,767 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.09375) internal successors, (35), 32 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 37 states. [2022-04-28 03:13:17,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:17,768 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-28 03:13:17,768 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-28 03:13:17,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:17,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:17,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:13:17,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:13:17,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.09375) internal successors, (35), 32 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:13:17,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-04-28 03:13:17,769 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 33 [2022-04-28 03:13:17,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:13:17,769 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-04-28 03:13:17,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call 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:17,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 39 transitions. [2022-04-28 03:13:17,807 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:13:17,807 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-28 03:13:17,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 03:13:17,808 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:13:17,808 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:13:17,831 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:18,008 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,SelfDestructingSolverStorable12 [2022-04-28 03:13:18,008 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:13:18,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:13:18,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1392080412, now seen corresponding path program 11 times [2022-04-28 03:13:18,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:18,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1134129259] [2022-04-28 03:13:22,083 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:13:22,133 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:22,321 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:22,322 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:13:22,325 INFO L85 PathProgramCache]: Analyzing trace with hash -2018657076, now seen corresponding path program 1 times [2022-04-28 03:13:22,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:13:22,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566957093] [2022-04-28 03:13:22,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:22,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:13:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:22,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:13:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:22,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {3476#(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); {3465#true} is VALID [2022-04-28 03:13:22,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {3465#true} assume true; {3465#true} is VALID [2022-04-28 03:13:22,438 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3465#true} {3465#true} #56#return; {3465#true} is VALID [2022-04-28 03:13:22,439 INFO L272 TraceCheckUtils]: 0: Hoare triple {3465#true} call ULTIMATE.init(); {3476#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:13:22,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {3476#(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); {3465#true} is VALID [2022-04-28 03:13:22,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {3465#true} assume true; {3465#true} is VALID [2022-04-28 03:13:22,439 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3465#true} {3465#true} #56#return; {3465#true} is VALID [2022-04-28 03:13:22,439 INFO L272 TraceCheckUtils]: 4: Hoare triple {3465#true} call #t~ret1 := main(); {3465#true} is VALID [2022-04-28 03:13:22,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {3465#true} ~x~0 := 0;~y~0 := 50; {3470#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:13:22,443 INFO L290 TraceCheckUtils]: 6: Hoare triple {3470#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [102] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_251 v_main_~x~0_250))) (or (and (< v_main_~x~0_251 v_main_~x~0_250) (< v_main_~x~0_250 51)) .cse0 (and (<= 50 v_main_~x~0_251) .cse0))) InVars {main_~x~0=v_main_~x~0_251} OutVars{main_~x~0=v_main_~x~0_250} AuxVars[] AssignedVars[main_~x~0] {3471#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:13:22,443 INFO L290 TraceCheckUtils]: 7: Hoare triple {3471#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [103] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3471#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:13:22,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {3471#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [104] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_152 v_main_~y~0_151)) (.cse2 (= v_main_~x~0_253 v_main_~x~0_252)) (.cse1 (<= 50 v_main_~x~0_253))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_253 100))) .cse2) (and .cse0 .cse2) (let ((.cse3 (+ v_main_~x~0_253 v_main_~y~0_151))) (and (= (+ v_main_~x~0_252 v_main_~y~0_152) .cse3) (< .cse3 (+ 101 v_main_~y~0_152)) .cse1 (< v_main_~y~0_152 v_main_~y~0_151))))) InVars {main_~x~0=v_main_~x~0_253, main_~y~0=v_main_~y~0_152} OutVars{main_~x~0=v_main_~x~0_252, main_~y~0=v_main_~y~0_151} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {3472#(or (and (or (< 99 main_~y~0) (<= main_~x~0 main_~y~0)) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:13:22,451 INFO L290 TraceCheckUtils]: 9: Hoare triple {3472#(or (and (or (< 99 main_~y~0) (<= main_~x~0 main_~y~0)) (<= main_~y~0 100)) (<= main_~x~0 50))} [101] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3473#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:13:22,452 INFO L272 TraceCheckUtils]: 10: Hoare triple {3473#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {3474#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:13:22,452 INFO L290 TraceCheckUtils]: 11: Hoare triple {3474#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3475#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:13:22,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {3475#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3466#false} is VALID [2022-04-28 03:13:22,453 INFO L290 TraceCheckUtils]: 13: Hoare triple {3466#false} assume !false; {3466#false} is VALID [2022-04-28 03:13:22,453 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:22,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:13:22,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566957093] [2022-04-28 03:13:22,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566957093] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:13:22,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915528061] [2022-04-28 03:13:22,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:22,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:13:22,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:13:22,455 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:22,483 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:22,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:22,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:13:22,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:22,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:13:22,789 INFO L272 TraceCheckUtils]: 0: Hoare triple {3465#true} call ULTIMATE.init(); {3465#true} is VALID [2022-04-28 03:13:22,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {3465#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); {3465#true} is VALID [2022-04-28 03:13:22,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {3465#true} assume true; {3465#true} is VALID [2022-04-28 03:13:22,790 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3465#true} {3465#true} #56#return; {3465#true} is VALID [2022-04-28 03:13:22,790 INFO L272 TraceCheckUtils]: 4: Hoare triple {3465#true} call #t~ret1 := main(); {3465#true} is VALID [2022-04-28 03:13:22,790 INFO L290 TraceCheckUtils]: 5: Hoare triple {3465#true} ~x~0 := 0;~y~0 := 50; {3495#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:13:22,791 INFO L290 TraceCheckUtils]: 6: Hoare triple {3495#(and (<= main_~x~0 0) (= main_~y~0 50))} [102] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_251 v_main_~x~0_250))) (or (and (< v_main_~x~0_251 v_main_~x~0_250) (< v_main_~x~0_250 51)) .cse0 (and (<= 50 v_main_~x~0_251) .cse0))) InVars {main_~x~0=v_main_~x~0_251} OutVars{main_~x~0=v_main_~x~0_250} AuxVars[] AssignedVars[main_~x~0] {3499#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:13:22,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {3499#(and (= main_~y~0 50) (< main_~x~0 51))} [103] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3499#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:13:22,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {3499#(and (= main_~y~0 50) (< main_~x~0 51))} [104] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_152 v_main_~y~0_151)) (.cse2 (= v_main_~x~0_253 v_main_~x~0_252)) (.cse1 (<= 50 v_main_~x~0_253))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_253 100))) .cse2) (and .cse0 .cse2) (let ((.cse3 (+ v_main_~x~0_253 v_main_~y~0_151))) (and (= (+ v_main_~x~0_252 v_main_~y~0_152) .cse3) (< .cse3 (+ 101 v_main_~y~0_152)) .cse1 (< v_main_~y~0_152 v_main_~y~0_151))))) InVars {main_~x~0=v_main_~x~0_253, main_~y~0=v_main_~y~0_152} OutVars{main_~x~0=v_main_~x~0_252, main_~y~0=v_main_~y~0_151} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {3506#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:13:22,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {3506#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [101] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3473#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:13:22,793 INFO L272 TraceCheckUtils]: 10: Hoare triple {3473#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {3513#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:13:22,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {3513#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3517#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:13:22,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {3517#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3466#false} is VALID [2022-04-28 03:13:22,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {3466#false} assume !false; {3466#false} is VALID [2022-04-28 03:13:22,794 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:22,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:13:23,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {3466#false} assume !false; {3466#false} is VALID [2022-04-28 03:13:23,283 INFO L290 TraceCheckUtils]: 12: Hoare triple {3517#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3466#false} is VALID [2022-04-28 03:13:23,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {3513#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3517#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:13:23,284 INFO L272 TraceCheckUtils]: 10: Hoare triple {3473#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {3513#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:13:23,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {3536#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [101] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3473#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:13:23,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {3540#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [104] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_152 v_main_~y~0_151)) (.cse2 (= v_main_~x~0_253 v_main_~x~0_252)) (.cse1 (<= 50 v_main_~x~0_253))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_253 100))) .cse2) (and .cse0 .cse2) (let ((.cse3 (+ v_main_~x~0_253 v_main_~y~0_151))) (and (= (+ v_main_~x~0_252 v_main_~y~0_152) .cse3) (< .cse3 (+ 101 v_main_~y~0_152)) .cse1 (< v_main_~y~0_152 v_main_~y~0_151))))) InVars {main_~x~0=v_main_~x~0_253, main_~y~0=v_main_~y~0_152} OutVars{main_~x~0=v_main_~x~0_252, main_~y~0=v_main_~y~0_151} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {3536#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:13:23,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {3540#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [103] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3540#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:13:23,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {3547#(and (<= 50 main_~y~0) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))) (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [102] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_251 v_main_~x~0_250))) (or (and (< v_main_~x~0_251 v_main_~x~0_250) (< v_main_~x~0_250 51)) .cse0 (and (<= 50 v_main_~x~0_251) .cse0))) InVars {main_~x~0=v_main_~x~0_251} OutVars{main_~x~0=v_main_~x~0_250} AuxVars[] AssignedVars[main_~x~0] {3540#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:13:23,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {3465#true} ~x~0 := 0;~y~0 := 50; {3547#(and (<= 50 main_~y~0) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))) (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:13:23,288 INFO L272 TraceCheckUtils]: 4: Hoare triple {3465#true} call #t~ret1 := main(); {3465#true} is VALID [2022-04-28 03:13:23,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3465#true} {3465#true} #56#return; {3465#true} is VALID [2022-04-28 03:13:23,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {3465#true} assume true; {3465#true} is VALID [2022-04-28 03:13:23,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {3465#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); {3465#true} is VALID [2022-04-28 03:13:23,288 INFO L272 TraceCheckUtils]: 0: Hoare triple {3465#true} call ULTIMATE.init(); {3465#true} is VALID [2022-04-28 03:13:23,288 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:23,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915528061] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:13:23,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:13:23,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:13:23,749 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:13:23,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1134129259] [2022-04-28 03:13:23,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1134129259] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:13:23,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:13:23,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 03:13:23,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807181456] [2022-04-28 03:13:23,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:13:23,750 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 17 states have internal predecessors, (31), 2 states have call successors, (3), 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 35 [2022-04-28 03:13:23,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:13:23,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 17 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call 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:23,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:23,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 03:13:23,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:23,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 03:13:23,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=704, Unknown=0, NotChecked=0, Total=870 [2022-04-28 03:13:23,778 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 17 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call 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:24,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:24,821 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-28 03:13:24,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 03:13:24,821 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 17 states have internal predecessors, (31), 2 states have call successors, (3), 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 35 [2022-04-28 03:13:24,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:13:24,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 17 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call 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:24,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 51 transitions. [2022-04-28 03:13:24,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 17 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call 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:24,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 51 transitions. [2022-04-28 03:13:24,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 51 transitions. [2022-04-28 03:13:24,867 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:24,868 INFO L225 Difference]: With dead ends: 46 [2022-04-28 03:13:24,868 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 03:13:24,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=289, Invalid=1517, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 03:13:24,869 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 21 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:13:24,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 88 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 03:13:24,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 03:13:24,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-28 03:13:24,919 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:13:24,919 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call 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:24,919 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call 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:24,919 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call 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:24,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:24,920 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-04-28 03:13:24,920 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-28 03:13:24,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:24,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:24,921 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 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 39 states. [2022-04-28 03:13:24,921 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 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 39 states. [2022-04-28 03:13:24,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:24,922 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-04-28 03:13:24,922 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-28 03:13:24,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:24,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:24,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:13:24,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:13:24,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call 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:24,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2022-04-28 03:13:24,923 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 35 [2022-04-28 03:13:24,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:13:24,924 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2022-04-28 03:13:24,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 17 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call 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:24,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 41 transitions. [2022-04-28 03:13:24,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:24,968 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-28 03:13:24,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 03:13:24,968 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:13:24,968 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:13:24,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 03:13:25,168 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,SelfDestructingSolverStorable13 [2022-04-28 03:13:25,169 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:13:25,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:13:25,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1170848137, now seen corresponding path program 12 times [2022-04-28 03:13:25,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:25,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [838547953] [2022-04-28 03:13:25,270 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:25,465 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:25,466 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:13:25,468 INFO L85 PathProgramCache]: Analyzing trace with hash 30875084, now seen corresponding path program 1 times [2022-04-28 03:13:25,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:13:25,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362454384] [2022-04-28 03:13:25,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:25,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:13:25,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:25,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:13:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:25,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {3866#(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); {3855#true} is VALID [2022-04-28 03:13:25,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {3855#true} assume true; {3855#true} is VALID [2022-04-28 03:13:25,567 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3855#true} {3855#true} #56#return; {3855#true} is VALID [2022-04-28 03:13:25,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {3855#true} call ULTIMATE.init(); {3866#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:13:25,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {3866#(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); {3855#true} is VALID [2022-04-28 03:13:25,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {3855#true} assume true; {3855#true} is VALID [2022-04-28 03:13:25,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3855#true} {3855#true} #56#return; {3855#true} is VALID [2022-04-28 03:13:25,568 INFO L272 TraceCheckUtils]: 4: Hoare triple {3855#true} call #t~ret1 := main(); {3855#true} is VALID [2022-04-28 03:13:25,568 INFO L290 TraceCheckUtils]: 5: Hoare triple {3855#true} ~x~0 := 0;~y~0 := 50; {3860#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:13:25,569 INFO L290 TraceCheckUtils]: 6: Hoare triple {3860#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [106] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_280 v_main_~x~0_279))) (or (and .cse0 (not (< v_main_~x~0_280 50))) (and (< v_main_~x~0_279 51) (< v_main_~x~0_280 v_main_~x~0_279)) .cse0)) InVars {main_~x~0=v_main_~x~0_280} OutVars{main_~x~0=v_main_~x~0_279} AuxVars[] AssignedVars[main_~x~0] {3861#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:13:25,569 INFO L290 TraceCheckUtils]: 7: Hoare triple {3861#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [107] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3861#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:13:25,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {3861#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [108] L28-2-->L27-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_282 v_main_~x~0_281)) (.cse0 (<= 50 v_main_~x~0_282)) (.cse2 (= v_main_~y~0_172 v_main_~y~0_171))) (or (and (= (+ v_main_~x~0_281 v_main_~y~0_172) (+ v_main_~x~0_282 v_main_~y~0_171)) (< v_main_~x~0_282 v_main_~x~0_281) .cse0 (< v_main_~x~0_281 101)) (and .cse1 .cse2) (and .cse1 (or (not (< v_main_~x~0_282 100)) (not .cse0)) .cse2))) InVars {main_~x~0=v_main_~x~0_282, main_~y~0=v_main_~y~0_172} OutVars{main_~x~0=v_main_~x~0_281, main_~y~0=v_main_~y~0_171} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {3862#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:13:25,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {3862#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} [105] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3863#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:13:25,571 INFO L272 TraceCheckUtils]: 10: Hoare triple {3863#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {3864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:13:25,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {3864#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3865#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:13:25,572 INFO L290 TraceCheckUtils]: 12: Hoare triple {3865#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3856#false} is VALID [2022-04-28 03:13:25,572 INFO L290 TraceCheckUtils]: 13: Hoare triple {3856#false} assume !false; {3856#false} is VALID [2022-04-28 03:13:25,572 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,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:13:25,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362454384] [2022-04-28 03:13:25,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362454384] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:13:25,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341347017] [2022-04-28 03:13:25,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:25,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:13:25,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:13:25,574 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:25,575 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:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:25,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:13:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:25,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:13:25,888 INFO L272 TraceCheckUtils]: 0: Hoare triple {3855#true} call ULTIMATE.init(); {3855#true} is VALID [2022-04-28 03:13:25,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {3855#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); {3855#true} is VALID [2022-04-28 03:13:25,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {3855#true} assume true; {3855#true} is VALID [2022-04-28 03:13:25,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3855#true} {3855#true} #56#return; {3855#true} is VALID [2022-04-28 03:13:25,888 INFO L272 TraceCheckUtils]: 4: Hoare triple {3855#true} call #t~ret1 := main(); {3855#true} is VALID [2022-04-28 03:13:25,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {3855#true} ~x~0 := 0;~y~0 := 50; {3885#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:13:25,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {3885#(and (<= main_~x~0 0) (= main_~y~0 50))} [106] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_280 v_main_~x~0_279))) (or (and .cse0 (not (< v_main_~x~0_280 50))) (and (< v_main_~x~0_279 51) (< v_main_~x~0_280 v_main_~x~0_279)) .cse0)) InVars {main_~x~0=v_main_~x~0_280} OutVars{main_~x~0=v_main_~x~0_279} AuxVars[] AssignedVars[main_~x~0] {3889#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:13:25,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {3889#(and (= main_~y~0 50) (< main_~x~0 51))} [107] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3889#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:13:25,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {3889#(and (= main_~y~0 50) (< main_~x~0 51))} [108] L28-2-->L27-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_282 v_main_~x~0_281)) (.cse0 (<= 50 v_main_~x~0_282)) (.cse2 (= v_main_~y~0_172 v_main_~y~0_171))) (or (and (= (+ v_main_~x~0_281 v_main_~y~0_172) (+ v_main_~x~0_282 v_main_~y~0_171)) (< v_main_~x~0_282 v_main_~x~0_281) .cse0 (< v_main_~x~0_281 101)) (and .cse1 .cse2) (and .cse1 (or (not (< v_main_~x~0_282 100)) (not .cse0)) .cse2))) InVars {main_~x~0=v_main_~x~0_282, main_~y~0=v_main_~y~0_172} OutVars{main_~x~0=v_main_~x~0_281, main_~y~0=v_main_~y~0_171} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {3896#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:13:25,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {3896#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [105] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3863#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:13:25,892 INFO L272 TraceCheckUtils]: 10: Hoare triple {3863#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {3903#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:13:25,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {3903#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3907#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:13:25,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {3907#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3856#false} is VALID [2022-04-28 03:13:25,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {3856#false} assume !false; {3856#false} is VALID [2022-04-28 03:13:25,893 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,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:13:26,331 INFO L290 TraceCheckUtils]: 13: Hoare triple {3856#false} assume !false; {3856#false} is VALID [2022-04-28 03:13:26,331 INFO L290 TraceCheckUtils]: 12: Hoare triple {3907#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3856#false} is VALID [2022-04-28 03:13:26,331 INFO L290 TraceCheckUtils]: 11: Hoare triple {3903#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3907#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:13:26,332 INFO L272 TraceCheckUtils]: 10: Hoare triple {3863#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {3903#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:13:26,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {3926#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [105] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3863#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:13:26,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {3930#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [108] L28-2-->L27-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_282 v_main_~x~0_281)) (.cse0 (<= 50 v_main_~x~0_282)) (.cse2 (= v_main_~y~0_172 v_main_~y~0_171))) (or (and (= (+ v_main_~x~0_281 v_main_~y~0_172) (+ v_main_~x~0_282 v_main_~y~0_171)) (< v_main_~x~0_282 v_main_~x~0_281) .cse0 (< v_main_~x~0_281 101)) (and .cse1 .cse2) (and .cse1 (or (not (< v_main_~x~0_282 100)) (not .cse0)) .cse2))) InVars {main_~x~0=v_main_~x~0_282, main_~y~0=v_main_~y~0_172} OutVars{main_~x~0=v_main_~x~0_281, main_~y~0=v_main_~y~0_171} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {3926#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:13:26,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {3930#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [107] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3930#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:13:26,335 INFO L290 TraceCheckUtils]: 6: Hoare triple {3937#(and (<= 50 main_~y~0) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [106] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_280 v_main_~x~0_279))) (or (and .cse0 (not (< v_main_~x~0_280 50))) (and (< v_main_~x~0_279 51) (< v_main_~x~0_280 v_main_~x~0_279)) .cse0)) InVars {main_~x~0=v_main_~x~0_280} OutVars{main_~x~0=v_main_~x~0_279} AuxVars[] AssignedVars[main_~x~0] {3930#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:13:26,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {3855#true} ~x~0 := 0;~y~0 := 50; {3937#(and (<= 50 main_~y~0) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:13:26,335 INFO L272 TraceCheckUtils]: 4: Hoare triple {3855#true} call #t~ret1 := main(); {3855#true} is VALID [2022-04-28 03:13:26,336 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3855#true} {3855#true} #56#return; {3855#true} is VALID [2022-04-28 03:13:26,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {3855#true} assume true; {3855#true} is VALID [2022-04-28 03:13:26,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {3855#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); {3855#true} is VALID [2022-04-28 03:13:26,336 INFO L272 TraceCheckUtils]: 0: Hoare triple {3855#true} call ULTIMATE.init(); {3855#true} is VALID [2022-04-28 03:13:26,336 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:26,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341347017] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:13:26,336 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:13:26,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:13:26,827 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:13:26,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [838547953] [2022-04-28 03:13:26,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [838547953] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:13:26,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:13:26,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 03:13:26,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437276720] [2022-04-28 03:13:26,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:13:26,828 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 18 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:26,828 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:13:26,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 18 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:26,859 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:26,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 03:13:26,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:26,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 03:13:26,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2022-04-28 03:13:26,860 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 18 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:28,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:28,049 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-04-28 03:13:28,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 03:13:28,050 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 18 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:28,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:13:28,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 18 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:28,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 53 transitions. [2022-04-28 03:13:28,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 18 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:28,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 53 transitions. [2022-04-28 03:13:28,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 53 transitions. [2022-04-28 03:13:28,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:28,095 INFO L225 Difference]: With dead ends: 48 [2022-04-28 03:13:28,095 INFO L226 Difference]: Without dead ends: 41 [2022-04-28 03:13:28,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=305, Invalid=1675, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 03:13:28,098 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 22 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:13:28,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 93 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 03:13:28,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-28 03:13:28,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-28 03:13:28,159 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:13:28,159 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call 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,159 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call 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,159 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call 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,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:28,160 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-04-28 03:13:28,160 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-04-28 03:13:28,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:28,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:28,161 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 3 states have call successors, (3), 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 41 states. [2022-04-28 03:13:28,161 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 3 states have call successors, (3), 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 41 states. [2022-04-28 03:13:28,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:28,162 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-04-28 03:13:28,162 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-04-28 03:13:28,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:28,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:28,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:13:28,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:13:28,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call 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,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2022-04-28 03:13:28,163 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 37 [2022-04-28 03:13:28,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:13:28,163 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2022-04-28 03:13:28,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 18 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:28,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 43 transitions. [2022-04-28 03:13:28,205 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:28,205 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-04-28 03:13:28,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 03:13:28,205 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:13:28,206 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:13:28,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-28 03:13:28,406 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,SelfDestructingSolverStorable14 [2022-04-28 03:13:28,406 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:13:28,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:13:28,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1166044178, now seen corresponding path program 13 times [2022-04-28 03:13:28,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:28,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1447437352] [2022-04-28 03:13:32,471 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:13:32,524 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:32,894 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:32,895 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:13:32,897 INFO L85 PathProgramCache]: Analyzing trace with hash 2080407244, now seen corresponding path program 1 times [2022-04-28 03:13:32,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:13:32,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666595187] [2022-04-28 03:13:32,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:32,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:13:32,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:33,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:13:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:33,017 INFO L290 TraceCheckUtils]: 0: Hoare triple {4271#(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); {4260#true} is VALID [2022-04-28 03:13:33,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {4260#true} assume true; {4260#true} is VALID [2022-04-28 03:13:33,017 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4260#true} {4260#true} #56#return; {4260#true} is VALID [2022-04-28 03:13:33,018 INFO L272 TraceCheckUtils]: 0: Hoare triple {4260#true} call ULTIMATE.init(); {4271#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:13:33,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {4271#(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); {4260#true} is VALID [2022-04-28 03:13:33,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {4260#true} assume true; {4260#true} is VALID [2022-04-28 03:13:33,018 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4260#true} {4260#true} #56#return; {4260#true} is VALID [2022-04-28 03:13:33,018 INFO L272 TraceCheckUtils]: 4: Hoare triple {4260#true} call #t~ret1 := main(); {4260#true} is VALID [2022-04-28 03:13:33,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {4260#true} ~x~0 := 0;~y~0 := 50; {4265#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:13:33,019 INFO L290 TraceCheckUtils]: 6: Hoare triple {4265#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [110] L28-2-->L27-2_primed: Formula: (or (and (< v_main_~x~0_309 51) (< v_main_~x~0_310 v_main_~x~0_309)) (and (not (< v_main_~x~0_310 50)) (= v_main_~x~0_309 v_main_~x~0_310)) (= v_main_~x~0_310 v_main_~x~0_309)) InVars {main_~x~0=v_main_~x~0_310} OutVars{main_~x~0=v_main_~x~0_309} AuxVars[] AssignedVars[main_~x~0] {4266#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:13:33,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {4266#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [111] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4266#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:13:33,021 INFO L290 TraceCheckUtils]: 8: Hoare triple {4266#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [112] L28-2-->L27-2_primed: Formula: (let ((.cse1 (= v_main_~y~0_193 v_main_~y~0_192)) (.cse2 (= v_main_~x~0_312 v_main_~x~0_311)) (.cse0 (<= 50 v_main_~x~0_312))) (or (and .cse0 (< v_main_~x~0_312 v_main_~x~0_311) (= (+ v_main_~x~0_311 v_main_~y~0_193) (+ v_main_~x~0_312 v_main_~y~0_192)) (< v_main_~x~0_311 101)) (and .cse1 .cse2) (and .cse1 .cse2 (or (not (< v_main_~x~0_312 100)) (not .cse0))))) InVars {main_~x~0=v_main_~x~0_312, main_~y~0=v_main_~y~0_193} OutVars{main_~x~0=v_main_~x~0_311, main_~y~0=v_main_~y~0_192} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {4267#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:13:33,021 INFO L290 TraceCheckUtils]: 9: Hoare triple {4267#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} [109] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4268#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:13:33,022 INFO L272 TraceCheckUtils]: 10: Hoare triple {4268#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {4269#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:13:33,023 INFO L290 TraceCheckUtils]: 11: Hoare triple {4269#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4270#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:13:33,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {4270#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4261#false} is VALID [2022-04-28 03:13:33,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {4261#false} assume !false; {4261#false} is VALID [2022-04-28 03:13:33,023 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:33,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:13:33,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666595187] [2022-04-28 03:13:33,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666595187] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:13:33,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936079215] [2022-04-28 03:13:33,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:33,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:13:33,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:13:33,025 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:33,027 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:33,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:33,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:13:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:33,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:13:33,351 INFO L272 TraceCheckUtils]: 0: Hoare triple {4260#true} call ULTIMATE.init(); {4260#true} is VALID [2022-04-28 03:13:33,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {4260#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); {4260#true} is VALID [2022-04-28 03:13:33,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {4260#true} assume true; {4260#true} is VALID [2022-04-28 03:13:33,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4260#true} {4260#true} #56#return; {4260#true} is VALID [2022-04-28 03:13:33,351 INFO L272 TraceCheckUtils]: 4: Hoare triple {4260#true} call #t~ret1 := main(); {4260#true} is VALID [2022-04-28 03:13:33,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {4260#true} ~x~0 := 0;~y~0 := 50; {4290#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:13:33,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {4290#(and (<= main_~x~0 0) (= main_~y~0 50))} [110] L28-2-->L27-2_primed: Formula: (or (and (< v_main_~x~0_309 51) (< v_main_~x~0_310 v_main_~x~0_309)) (and (not (< v_main_~x~0_310 50)) (= v_main_~x~0_309 v_main_~x~0_310)) (= v_main_~x~0_310 v_main_~x~0_309)) InVars {main_~x~0=v_main_~x~0_310} OutVars{main_~x~0=v_main_~x~0_309} AuxVars[] AssignedVars[main_~x~0] {4294#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:13:33,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {4294#(and (= main_~y~0 50) (< main_~x~0 51))} [111] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4294#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:13:33,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {4294#(and (= main_~y~0 50) (< main_~x~0 51))} [112] L28-2-->L27-2_primed: Formula: (let ((.cse1 (= v_main_~y~0_193 v_main_~y~0_192)) (.cse2 (= v_main_~x~0_312 v_main_~x~0_311)) (.cse0 (<= 50 v_main_~x~0_312))) (or (and .cse0 (< v_main_~x~0_312 v_main_~x~0_311) (= (+ v_main_~x~0_311 v_main_~y~0_193) (+ v_main_~x~0_312 v_main_~y~0_192)) (< v_main_~x~0_311 101)) (and .cse1 .cse2) (and .cse1 .cse2 (or (not (< v_main_~x~0_312 100)) (not .cse0))))) InVars {main_~x~0=v_main_~x~0_312, main_~y~0=v_main_~y~0_193} OutVars{main_~x~0=v_main_~x~0_311, main_~y~0=v_main_~y~0_192} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {4301#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:13:33,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {4301#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [109] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4268#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:13:33,356 INFO L272 TraceCheckUtils]: 10: Hoare triple {4268#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {4308#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:13:33,356 INFO L290 TraceCheckUtils]: 11: Hoare triple {4308#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4312#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:13:33,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {4312#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4261#false} is VALID [2022-04-28 03:13:33,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {4261#false} assume !false; {4261#false} is VALID [2022-04-28 03:13:33,357 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:33,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:13:33,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {4261#false} assume !false; {4261#false} is VALID [2022-04-28 03:13:33,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {4312#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4261#false} is VALID [2022-04-28 03:13:33,788 INFO L290 TraceCheckUtils]: 11: Hoare triple {4308#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4312#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:13:33,789 INFO L272 TraceCheckUtils]: 10: Hoare triple {4268#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {4308#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:13:33,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {4331#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [109] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4268#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:13:33,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {4335#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [112] L28-2-->L27-2_primed: Formula: (let ((.cse1 (= v_main_~y~0_193 v_main_~y~0_192)) (.cse2 (= v_main_~x~0_312 v_main_~x~0_311)) (.cse0 (<= 50 v_main_~x~0_312))) (or (and .cse0 (< v_main_~x~0_312 v_main_~x~0_311) (= (+ v_main_~x~0_311 v_main_~y~0_193) (+ v_main_~x~0_312 v_main_~y~0_192)) (< v_main_~x~0_311 101)) (and .cse1 .cse2) (and .cse1 .cse2 (or (not (< v_main_~x~0_312 100)) (not .cse0))))) InVars {main_~x~0=v_main_~x~0_312, main_~y~0=v_main_~y~0_193} OutVars{main_~x~0=v_main_~x~0_311, main_~y~0=v_main_~y~0_192} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {4331#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:13:33,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {4335#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [111] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4335#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:13:33,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {4342#(and (<= 50 main_~y~0) (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [110] L28-2-->L27-2_primed: Formula: (or (and (< v_main_~x~0_309 51) (< v_main_~x~0_310 v_main_~x~0_309)) (and (not (< v_main_~x~0_310 50)) (= v_main_~x~0_309 v_main_~x~0_310)) (= v_main_~x~0_310 v_main_~x~0_309)) InVars {main_~x~0=v_main_~x~0_310} OutVars{main_~x~0=v_main_~x~0_309} AuxVars[] AssignedVars[main_~x~0] {4335#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:13:33,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {4260#true} ~x~0 := 0;~y~0 := 50; {4342#(and (<= 50 main_~y~0) (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:13:33,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {4260#true} call #t~ret1 := main(); {4260#true} is VALID [2022-04-28 03:13:33,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4260#true} {4260#true} #56#return; {4260#true} is VALID [2022-04-28 03:13:33,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {4260#true} assume true; {4260#true} is VALID [2022-04-28 03:13:33,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {4260#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); {4260#true} is VALID [2022-04-28 03:13:33,794 INFO L272 TraceCheckUtils]: 0: Hoare triple {4260#true} call ULTIMATE.init(); {4260#true} is VALID [2022-04-28 03:13:33,794 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:33,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936079215] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:13:33,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:13:33,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:13:34,335 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:13:34,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1447437352] [2022-04-28 03:13:34,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1447437352] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:13:34,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:13:34,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 03:13:34,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971027586] [2022-04-28 03:13:34,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:13:34,336 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 2 states have call successors, (3), 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 39 [2022-04-28 03:13:34,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:13:34,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call 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:34,366 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:13:34,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 03:13:34,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:34,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 03:13:34,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=812, Unknown=0, NotChecked=0, Total=992 [2022-04-28 03:13:34,368 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand has 21 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call 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,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:35,750 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2022-04-28 03:13:35,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 03:13:35,750 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 2 states have call successors, (3), 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 39 [2022-04-28 03:13:35,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:13:35,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call 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,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 55 transitions. [2022-04-28 03:13:35,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call 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,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 55 transitions. [2022-04-28 03:13:35,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 55 transitions. [2022-04-28 03:13:35,806 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:35,806 INFO L225 Difference]: With dead ends: 50 [2022-04-28 03:13:35,806 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 03:13:35,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=321, Invalid=1841, Unknown=0, NotChecked=0, Total=2162 [2022-04-28 03:13:35,807 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 23 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:13:35,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 98 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 03:13:35,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 03:13:35,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-28 03:13:35,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:13:35,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 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:35,863 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 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:35,863 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 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:35,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:35,864 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2022-04-28 03:13:35,864 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2022-04-28 03:13:35,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:35,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:35,864 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 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 43 states. [2022-04-28 03:13:35,864 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 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 43 states. [2022-04-28 03:13:35,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:35,865 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2022-04-28 03:13:35,865 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2022-04-28 03:13:35,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:35,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:35,865 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:13:35,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:13:35,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 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:35,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2022-04-28 03:13:35,866 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 39 [2022-04-28 03:13:35,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:13:35,866 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2022-04-28 03:13:35,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call 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,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 45 transitions. [2022-04-28 03:13:35,903 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:35,903 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2022-04-28 03:13:35,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 03:13:35,903 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:13:35,904 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:13:35,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-28 03:13:36,104 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,SelfDestructingSolverStorable15 [2022-04-28 03:13:36,104 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:13:36,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:13:36,105 INFO L85 PathProgramCache]: Analyzing trace with hash 651663085, now seen corresponding path program 14 times [2022-04-28 03:13:36,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:36,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [799814913] [2022-04-28 03:13:38,290 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:13:38,333 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:38,545 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:38,547 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:13:38,549 INFO L85 PathProgramCache]: Analyzing trace with hash -165027892, now seen corresponding path program 1 times [2022-04-28 03:13:38,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:13:38,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193890523] [2022-04-28 03:13:38,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:38,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:13:38,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:38,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:13:38,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:38,654 INFO L290 TraceCheckUtils]: 0: Hoare triple {4691#(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); {4680#true} is VALID [2022-04-28 03:13:38,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {4680#true} assume true; {4680#true} is VALID [2022-04-28 03:13:38,655 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4680#true} {4680#true} #56#return; {4680#true} is VALID [2022-04-28 03:13:38,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {4680#true} call ULTIMATE.init(); {4691#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:13:38,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {4691#(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); {4680#true} is VALID [2022-04-28 03:13:38,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {4680#true} assume true; {4680#true} is VALID [2022-04-28 03:13:38,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4680#true} {4680#true} #56#return; {4680#true} is VALID [2022-04-28 03:13:38,656 INFO L272 TraceCheckUtils]: 4: Hoare triple {4680#true} call #t~ret1 := main(); {4680#true} is VALID [2022-04-28 03:13:38,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {4680#true} ~x~0 := 0;~y~0 := 50; {4685#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:13:38,657 INFO L290 TraceCheckUtils]: 6: Hoare triple {4685#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [114] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_341 v_main_~x~0_340))) (or .cse0 (and (< v_main_~x~0_340 51) (< v_main_~x~0_341 v_main_~x~0_340)) (and (not (< v_main_~x~0_341 50)) .cse0))) InVars {main_~x~0=v_main_~x~0_341} OutVars{main_~x~0=v_main_~x~0_340} AuxVars[] AssignedVars[main_~x~0] {4686#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:13:38,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {4686#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [115] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4686#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:13:38,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {4686#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [116] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_215 v_main_~y~0_214)) (.cse2 (<= 50 v_main_~x~0_343)) (.cse1 (= v_main_~x~0_343 v_main_~x~0_342))) (or (and .cse0 .cse1) (and (= (+ v_main_~x~0_343 v_main_~y~0_214) (+ v_main_~x~0_342 v_main_~y~0_215)) .cse2 (< v_main_~x~0_343 v_main_~x~0_342) (< v_main_~x~0_342 101)) (and .cse0 (or (not (< v_main_~x~0_343 100)) (not .cse2)) .cse1))) InVars {main_~x~0=v_main_~x~0_343, main_~y~0=v_main_~y~0_215} OutVars{main_~x~0=v_main_~x~0_342, main_~y~0=v_main_~y~0_214} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {4687#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:13:38,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {4687#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} [113] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4688#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:13:38,659 INFO L272 TraceCheckUtils]: 10: Hoare triple {4688#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {4689#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:13:38,659 INFO L290 TraceCheckUtils]: 11: Hoare triple {4689#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4690#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:13:38,660 INFO L290 TraceCheckUtils]: 12: Hoare triple {4690#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4681#false} is VALID [2022-04-28 03:13:38,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {4681#false} assume !false; {4681#false} is VALID [2022-04-28 03:13:38,660 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:38,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:13:38,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193890523] [2022-04-28 03:13:38,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193890523] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:13:38,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911419156] [2022-04-28 03:13:38,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:38,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:13:38,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:13:38,663 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:38,664 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:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:38,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:13:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:38,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:13:39,014 INFO L272 TraceCheckUtils]: 0: Hoare triple {4680#true} call ULTIMATE.init(); {4680#true} is VALID [2022-04-28 03:13:39,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {4680#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); {4680#true} is VALID [2022-04-28 03:13:39,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {4680#true} assume true; {4680#true} is VALID [2022-04-28 03:13:39,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4680#true} {4680#true} #56#return; {4680#true} is VALID [2022-04-28 03:13:39,014 INFO L272 TraceCheckUtils]: 4: Hoare triple {4680#true} call #t~ret1 := main(); {4680#true} is VALID [2022-04-28 03:13:39,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {4680#true} ~x~0 := 0;~y~0 := 50; {4710#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:13:39,020 INFO L290 TraceCheckUtils]: 6: Hoare triple {4710#(and (<= main_~x~0 0) (= main_~y~0 50))} [114] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_341 v_main_~x~0_340))) (or .cse0 (and (< v_main_~x~0_340 51) (< v_main_~x~0_341 v_main_~x~0_340)) (and (not (< v_main_~x~0_341 50)) .cse0))) InVars {main_~x~0=v_main_~x~0_341} OutVars{main_~x~0=v_main_~x~0_340} AuxVars[] AssignedVars[main_~x~0] {4714#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:13:39,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {4714#(and (= main_~y~0 50) (< main_~x~0 51))} [115] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4714#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:13:39,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {4714#(and (= main_~y~0 50) (< main_~x~0 51))} [116] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_215 v_main_~y~0_214)) (.cse2 (<= 50 v_main_~x~0_343)) (.cse1 (= v_main_~x~0_343 v_main_~x~0_342))) (or (and .cse0 .cse1) (and (= (+ v_main_~x~0_343 v_main_~y~0_214) (+ v_main_~x~0_342 v_main_~y~0_215)) .cse2 (< v_main_~x~0_343 v_main_~x~0_342) (< v_main_~x~0_342 101)) (and .cse0 (or (not (< v_main_~x~0_343 100)) (not .cse2)) .cse1))) InVars {main_~x~0=v_main_~x~0_343, main_~y~0=v_main_~y~0_215} OutVars{main_~x~0=v_main_~x~0_342, main_~y~0=v_main_~y~0_214} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {4721#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:13:39,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {4721#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [113] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4688#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:13:39,030 INFO L272 TraceCheckUtils]: 10: Hoare triple {4688#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {4728#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:13:39,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {4728#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4732#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:13:39,031 INFO L290 TraceCheckUtils]: 12: Hoare triple {4732#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4681#false} is VALID [2022-04-28 03:13:39,031 INFO L290 TraceCheckUtils]: 13: Hoare triple {4681#false} assume !false; {4681#false} is VALID [2022-04-28 03:13:39,031 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:39,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:13:39,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {4681#false} assume !false; {4681#false} is VALID [2022-04-28 03:13:39,485 INFO L290 TraceCheckUtils]: 12: Hoare triple {4732#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4681#false} is VALID [2022-04-28 03:13:39,486 INFO L290 TraceCheckUtils]: 11: Hoare triple {4728#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4732#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:13:39,486 INFO L272 TraceCheckUtils]: 10: Hoare triple {4688#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {4728#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:13:39,487 INFO L290 TraceCheckUtils]: 9: Hoare triple {4751#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [113] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4688#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:13:39,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {4755#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [116] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_215 v_main_~y~0_214)) (.cse2 (<= 50 v_main_~x~0_343)) (.cse1 (= v_main_~x~0_343 v_main_~x~0_342))) (or (and .cse0 .cse1) (and (= (+ v_main_~x~0_343 v_main_~y~0_214) (+ v_main_~x~0_342 v_main_~y~0_215)) .cse2 (< v_main_~x~0_343 v_main_~x~0_342) (< v_main_~x~0_342 101)) (and .cse0 (or (not (< v_main_~x~0_343 100)) (not .cse2)) .cse1))) InVars {main_~x~0=v_main_~x~0_343, main_~y~0=v_main_~y~0_215} OutVars{main_~x~0=v_main_~x~0_342, main_~y~0=v_main_~y~0_214} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {4751#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:13:39,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {4755#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [115] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4755#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:13:39,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {4762#(and (<= 50 main_~y~0) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [114] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_341 v_main_~x~0_340))) (or .cse0 (and (< v_main_~x~0_340 51) (< v_main_~x~0_341 v_main_~x~0_340)) (and (not (< v_main_~x~0_341 50)) .cse0))) InVars {main_~x~0=v_main_~x~0_341} OutVars{main_~x~0=v_main_~x~0_340} AuxVars[] AssignedVars[main_~x~0] {4755#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:13:39,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {4680#true} ~x~0 := 0;~y~0 := 50; {4762#(and (<= 50 main_~y~0) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:13:39,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {4680#true} call #t~ret1 := main(); {4680#true} is VALID [2022-04-28 03:13:39,490 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4680#true} {4680#true} #56#return; {4680#true} is VALID [2022-04-28 03:13:39,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {4680#true} assume true; {4680#true} is VALID [2022-04-28 03:13:39,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {4680#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); {4680#true} is VALID [2022-04-28 03:13:39,490 INFO L272 TraceCheckUtils]: 0: Hoare triple {4680#true} call ULTIMATE.init(); {4680#true} is VALID [2022-04-28 03:13:39,490 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:39,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911419156] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:13:39,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:13:39,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:13:40,063 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:13:40,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [799814913] [2022-04-28 03:13:40,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [799814913] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:13:40,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:13:40,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 03:13:40,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614251979] [2022-04-28 03:13:40,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:13:40,064 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 20 states have internal predecessors, (37), 2 states have call successors, (3), 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 41 [2022-04-28 03:13:40,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:13:40,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 20 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call 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:40,096 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:40,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 03:13:40,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:40,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 03:13:40,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=869, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 03:13:40,097 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand has 22 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 20 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call 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:41,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:41,683 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2022-04-28 03:13:41,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 03:13:41,683 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 20 states have internal predecessors, (37), 2 states have call successors, (3), 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 41 [2022-04-28 03:13:41,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:13:41,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 20 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call 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:41,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 57 transitions. [2022-04-28 03:13:41,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 20 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call 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:41,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 57 transitions. [2022-04-28 03:13:41,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 57 transitions. [2022-04-28 03:13:41,731 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:41,732 INFO L225 Difference]: With dead ends: 52 [2022-04-28 03:13:41,732 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 03:13:41,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=337, Invalid=2015, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 03:13:41,733 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 24 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:13:41,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 108 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 03:13:41,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 03:13:41,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-28 03:13:41,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:13:41,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call 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:41,791 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call 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:41,791 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call 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:41,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:41,792 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2022-04-28 03:13:41,792 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-28 03:13:41,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:41,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:41,792 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 3 states have call successors, (3), 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:41,792 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 3 states have call successors, (3), 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:41,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:41,793 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2022-04-28 03:13:41,793 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-28 03:13:41,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:41,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:41,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:13:41,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:13:41,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call 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:41,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2022-04-28 03:13:41,794 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 41 [2022-04-28 03:13:41,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:13:41,794 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2022-04-28 03:13:41,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 20 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call 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:41,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 47 transitions. [2022-04-28 03:13:41,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:41,848 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-28 03:13:41,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 03:13:41,848 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:13:41,848 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:13:41,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-28 03:13:42,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:13:42,051 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:13:42,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:13:42,052 INFO L85 PathProgramCache]: Analyzing trace with hash 252671752, now seen corresponding path program 15 times [2022-04-28 03:13:42,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:42,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [203578690] [2022-04-28 03:13:42,143 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:42,358 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:42,360 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:13:42,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1884504268, now seen corresponding path program 1 times [2022-04-28 03:13:42,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:13:42,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008485810] [2022-04-28 03:13:42,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:42,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:13:42,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:42,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:13:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:42,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {5126#(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); {5115#true} is VALID [2022-04-28 03:13:42,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {5115#true} assume true; {5115#true} is VALID [2022-04-28 03:13:42,475 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5115#true} {5115#true} #56#return; {5115#true} is VALID [2022-04-28 03:13:42,475 INFO L272 TraceCheckUtils]: 0: Hoare triple {5115#true} call ULTIMATE.init(); {5126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:13:42,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {5126#(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); {5115#true} is VALID [2022-04-28 03:13:42,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {5115#true} assume true; {5115#true} is VALID [2022-04-28 03:13:42,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5115#true} {5115#true} #56#return; {5115#true} is VALID [2022-04-28 03:13:42,476 INFO L272 TraceCheckUtils]: 4: Hoare triple {5115#true} call #t~ret1 := main(); {5115#true} is VALID [2022-04-28 03:13:42,476 INFO L290 TraceCheckUtils]: 5: Hoare triple {5115#true} ~x~0 := 0;~y~0 := 50; {5120#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:13:42,477 INFO L290 TraceCheckUtils]: 6: Hoare triple {5120#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [118] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_373 v_main_~x~0_372))) (or .cse0 (and .cse0 (not (< v_main_~x~0_373 50))) (and (< v_main_~x~0_373 v_main_~x~0_372) (< v_main_~x~0_372 51)))) InVars {main_~x~0=v_main_~x~0_373} OutVars{main_~x~0=v_main_~x~0_372} AuxVars[] AssignedVars[main_~x~0] {5121#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:13:42,477 INFO L290 TraceCheckUtils]: 7: Hoare triple {5121#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [119] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5121#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:13:42,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {5121#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [120] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_238 v_main_~y~0_237)) (.cse1 (= v_main_~x~0_375 v_main_~x~0_374)) (.cse2 (<= 50 v_main_~x~0_375))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_375 100)))) (and .cse0 .cse1) (let ((.cse3 (+ v_main_~x~0_375 v_main_~y~0_237))) (and (= .cse3 (+ v_main_~x~0_374 v_main_~y~0_238)) .cse2 (< v_main_~y~0_238 v_main_~y~0_237) (< .cse3 (+ 101 v_main_~y~0_238)))))) InVars {main_~x~0=v_main_~x~0_375, main_~y~0=v_main_~y~0_238} OutVars{main_~x~0=v_main_~x~0_374, main_~y~0=v_main_~y~0_237} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {5122#(or (<= main_~x~0 99) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:13:42,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {5122#(or (<= main_~x~0 99) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [117] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5123#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:13:42,479 INFO L272 TraceCheckUtils]: 10: Hoare triple {5123#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {5124#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:13:42,480 INFO L290 TraceCheckUtils]: 11: Hoare triple {5124#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {5125#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:13:42,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {5125#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5116#false} is VALID [2022-04-28 03:13:42,480 INFO L290 TraceCheckUtils]: 13: Hoare triple {5116#false} assume !false; {5116#false} is VALID [2022-04-28 03:13:42,480 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,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:13:42,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008485810] [2022-04-28 03:13:42,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008485810] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:13:42,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84793188] [2022-04-28 03:13:42,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:42,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:13:42,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:13:42,482 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:42,482 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:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:42,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:13:42,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:42,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:13:42,811 INFO L272 TraceCheckUtils]: 0: Hoare triple {5115#true} call ULTIMATE.init(); {5115#true} is VALID [2022-04-28 03:13:42,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {5115#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); {5115#true} is VALID [2022-04-28 03:13:42,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {5115#true} assume true; {5115#true} is VALID [2022-04-28 03:13:42,812 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5115#true} {5115#true} #56#return; {5115#true} is VALID [2022-04-28 03:13:42,812 INFO L272 TraceCheckUtils]: 4: Hoare triple {5115#true} call #t~ret1 := main(); {5115#true} is VALID [2022-04-28 03:13:42,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {5115#true} ~x~0 := 0;~y~0 := 50; {5145#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:13:42,813 INFO L290 TraceCheckUtils]: 6: Hoare triple {5145#(and (<= main_~x~0 0) (= main_~y~0 50))} [118] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_373 v_main_~x~0_372))) (or .cse0 (and .cse0 (not (< v_main_~x~0_373 50))) (and (< v_main_~x~0_373 v_main_~x~0_372) (< v_main_~x~0_372 51)))) InVars {main_~x~0=v_main_~x~0_373} OutVars{main_~x~0=v_main_~x~0_372} AuxVars[] AssignedVars[main_~x~0] {5149#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:13:42,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {5149#(and (= main_~y~0 50) (< main_~x~0 51))} [119] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5149#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:13:42,814 INFO L290 TraceCheckUtils]: 8: Hoare triple {5149#(and (= main_~y~0 50) (< main_~x~0 51))} [120] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_238 v_main_~y~0_237)) (.cse1 (= v_main_~x~0_375 v_main_~x~0_374)) (.cse2 (<= 50 v_main_~x~0_375))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_375 100)))) (and .cse0 .cse1) (let ((.cse3 (+ v_main_~x~0_375 v_main_~y~0_237))) (and (= .cse3 (+ v_main_~x~0_374 v_main_~y~0_238)) .cse2 (< v_main_~y~0_238 v_main_~y~0_237) (< .cse3 (+ 101 v_main_~y~0_238)))))) InVars {main_~x~0=v_main_~x~0_375, main_~y~0=v_main_~y~0_238} OutVars{main_~x~0=v_main_~x~0_374, main_~y~0=v_main_~y~0_237} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {5156#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:13:42,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {5156#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [117] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5123#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:13:42,815 INFO L272 TraceCheckUtils]: 10: Hoare triple {5123#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {5163#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:13:42,815 INFO L290 TraceCheckUtils]: 11: Hoare triple {5163#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5167#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:13:42,816 INFO L290 TraceCheckUtils]: 12: Hoare triple {5167#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5116#false} is VALID [2022-04-28 03:13:42,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {5116#false} assume !false; {5116#false} is VALID [2022-04-28 03:13:42,816 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,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:13:43,281 INFO L290 TraceCheckUtils]: 13: Hoare triple {5116#false} assume !false; {5116#false} is VALID [2022-04-28 03:13:43,282 INFO L290 TraceCheckUtils]: 12: Hoare triple {5167#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5116#false} is VALID [2022-04-28 03:13:43,282 INFO L290 TraceCheckUtils]: 11: Hoare triple {5163#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5167#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:13:43,283 INFO L272 TraceCheckUtils]: 10: Hoare triple {5123#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {5163#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:13:43,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {5122#(or (<= main_~x~0 99) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [117] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5123#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:13:43,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {5189#(and (or (<= main_~x~0 main_~y~0) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (<= main_~x~0 99) (<= main_~y~0 100)) (or (< 99 main_~y~0) (<= main_~x~0 99)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [120] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_238 v_main_~y~0_237)) (.cse1 (= v_main_~x~0_375 v_main_~x~0_374)) (.cse2 (<= 50 v_main_~x~0_375))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_375 100)))) (and .cse0 .cse1) (let ((.cse3 (+ v_main_~x~0_375 v_main_~y~0_237))) (and (= .cse3 (+ v_main_~x~0_374 v_main_~y~0_238)) .cse2 (< v_main_~y~0_238 v_main_~y~0_237) (< .cse3 (+ 101 v_main_~y~0_238)))))) InVars {main_~x~0=v_main_~x~0_375, main_~y~0=v_main_~y~0_238} OutVars{main_~x~0=v_main_~x~0_374, main_~y~0=v_main_~y~0_237} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {5122#(or (<= main_~x~0 99) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:13:43,284 INFO L290 TraceCheckUtils]: 7: Hoare triple {5189#(and (or (<= main_~x~0 main_~y~0) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (<= main_~x~0 99) (<= main_~y~0 100)) (or (< 99 main_~y~0) (<= main_~x~0 99)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [119] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5189#(and (or (<= main_~x~0 main_~y~0) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (<= main_~x~0 99) (<= main_~y~0 100)) (or (< 99 main_~y~0) (<= main_~x~0 99)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:13:43,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {5196#(and (<= 50 main_~y~0) (or (<= main_~x~0 main_~y~0) (<= 100 main_~x~0)) (<= main_~y~0 100) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< 99 main_~y~0) (<= main_~x~0 99)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [118] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_373 v_main_~x~0_372))) (or .cse0 (and .cse0 (not (< v_main_~x~0_373 50))) (and (< v_main_~x~0_373 v_main_~x~0_372) (< v_main_~x~0_372 51)))) InVars {main_~x~0=v_main_~x~0_373} OutVars{main_~x~0=v_main_~x~0_372} AuxVars[] AssignedVars[main_~x~0] {5189#(and (or (<= main_~x~0 main_~y~0) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (<= main_~x~0 99) (<= main_~y~0 100)) (or (< 99 main_~y~0) (<= main_~x~0 99)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:13:43,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {5115#true} ~x~0 := 0;~y~0 := 50; {5196#(and (<= 50 main_~y~0) (or (<= main_~x~0 main_~y~0) (<= 100 main_~x~0)) (<= main_~y~0 100) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< 99 main_~y~0) (<= main_~x~0 99)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:13:43,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {5115#true} call #t~ret1 := main(); {5115#true} is VALID [2022-04-28 03:13:43,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5115#true} {5115#true} #56#return; {5115#true} is VALID [2022-04-28 03:13:43,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {5115#true} assume true; {5115#true} is VALID [2022-04-28 03:13:43,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {5115#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); {5115#true} is VALID [2022-04-28 03:13:43,286 INFO L272 TraceCheckUtils]: 0: Hoare triple {5115#true} call ULTIMATE.init(); {5115#true} is VALID [2022-04-28 03:13:43,286 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:43,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84793188] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:13:43,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:13:43,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-28 03:13:43,921 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:13:43,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [203578690] [2022-04-28 03:13:43,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [203578690] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:13:43,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:13:43,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 03:13:43,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996542175] [2022-04-28 03:13:43,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:13:43,922 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 21 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:43,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:13:43,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 21 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:43,956 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:43,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 03:13:43,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:43,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 03:13:43,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=890, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 03:13:43,957 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 21 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:45,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:45,601 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2022-04-28 03:13:45,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 03:13:45,601 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 21 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:45,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:13:45,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 21 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:45,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 59 transitions. [2022-04-28 03:13:45,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 21 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:45,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 59 transitions. [2022-04-28 03:13:45,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 59 transitions. [2022-04-28 03:13:45,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:45,662 INFO L225 Difference]: With dead ends: 54 [2022-04-28 03:13:45,662 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 03:13:45,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=308, Invalid=2142, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 03:13:45,663 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 25 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:13:45,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 108 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 03:13:45,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 03:13:45,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-28 03:13:45,730 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:13:45,730 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call 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,730 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call 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,730 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call 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,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:45,731 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-28 03:13:45,731 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-28 03:13:45,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:45,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:45,732 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 3 states have call successors, (3), 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 47 states. [2022-04-28 03:13:45,732 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 3 states have call successors, (3), 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 47 states. [2022-04-28 03:13:45,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:45,733 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-28 03:13:45,733 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-28 03:13:45,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:45,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:45,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:13:45,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:13:45,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call 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,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2022-04-28 03:13:45,734 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 43 [2022-04-28 03:13:45,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:13:45,734 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2022-04-28 03:13:45,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 21 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:45,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 49 transitions. [2022-04-28 03:13:45,781 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:45,781 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-28 03:13:45,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 03:13:45,781 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:13:45,781 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:13:45,799 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:45,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 03:13:45,982 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:13:45,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:13:45,982 INFO L85 PathProgramCache]: Analyzing trace with hash -925909917, now seen corresponding path program 16 times [2022-04-28 03:13:45,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:45,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1002177559] [2022-04-28 03:13:48,111 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:48,338 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:48,339 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:13:48,342 INFO L85 PathProgramCache]: Analyzing trace with hash -360930868, now seen corresponding path program 1 times [2022-04-28 03:13:48,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:13:48,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265254673] [2022-04-28 03:13:48,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:48,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:13:48,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:48,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:13:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:48,460 INFO L290 TraceCheckUtils]: 0: Hoare triple {5575#(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); {5564#true} is VALID [2022-04-28 03:13:48,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {5564#true} assume true; {5564#true} is VALID [2022-04-28 03:13:48,460 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5564#true} {5564#true} #56#return; {5564#true} is VALID [2022-04-28 03:13:48,461 INFO L272 TraceCheckUtils]: 0: Hoare triple {5564#true} call ULTIMATE.init(); {5575#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:13:48,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {5575#(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); {5564#true} is VALID [2022-04-28 03:13:48,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {5564#true} assume true; {5564#true} is VALID [2022-04-28 03:13:48,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5564#true} {5564#true} #56#return; {5564#true} is VALID [2022-04-28 03:13:48,461 INFO L272 TraceCheckUtils]: 4: Hoare triple {5564#true} call #t~ret1 := main(); {5564#true} is VALID [2022-04-28 03:13:48,461 INFO L290 TraceCheckUtils]: 5: Hoare triple {5564#true} ~x~0 := 0;~y~0 := 50; {5569#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:13:48,462 INFO L290 TraceCheckUtils]: 6: Hoare triple {5569#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [122] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_406 v_main_~x~0_405))) (or (and (<= 50 v_main_~x~0_406) .cse0) (and (< v_main_~x~0_406 v_main_~x~0_405) (< v_main_~x~0_405 51)) .cse0)) InVars {main_~x~0=v_main_~x~0_406} OutVars{main_~x~0=v_main_~x~0_405} AuxVars[] AssignedVars[main_~x~0] {5570#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:13:48,463 INFO L290 TraceCheckUtils]: 7: Hoare triple {5570#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [123] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5570#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:13:48,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {5570#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [124] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_262 v_main_~y~0_261)) (.cse1 (= v_main_~x~0_408 v_main_~x~0_407)) (.cse2 (<= 50 v_main_~x~0_408))) (or (and .cse0 .cse1) (and .cse0 .cse1 (or (not (< v_main_~x~0_408 100)) (not .cse2))) (let ((.cse3 (+ v_main_~x~0_408 v_main_~y~0_261))) (and (< .cse3 (+ 101 v_main_~y~0_262)) .cse2 (= .cse3 (+ v_main_~x~0_407 v_main_~y~0_262)) (< v_main_~y~0_262 v_main_~y~0_261))))) InVars {main_~x~0=v_main_~x~0_408, main_~y~0=v_main_~y~0_262} OutVars{main_~x~0=v_main_~x~0_407, main_~y~0=v_main_~y~0_261} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {5571#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:13:48,464 INFO L290 TraceCheckUtils]: 9: Hoare triple {5571#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} [121] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5572#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:13:48,465 INFO L272 TraceCheckUtils]: 10: Hoare triple {5572#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {5573#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:13:48,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {5573#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {5574#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:13:48,465 INFO L290 TraceCheckUtils]: 12: Hoare triple {5574#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5565#false} is VALID [2022-04-28 03:13:48,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {5565#false} assume !false; {5565#false} is VALID [2022-04-28 03:13:48,466 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:48,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:13:48,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265254673] [2022-04-28 03:13:48,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265254673] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:13:48,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174075659] [2022-04-28 03:13:48,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:48,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:13:48,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:13:48,467 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:48,468 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:48,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:48,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:13:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:48,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:13:48,790 INFO L272 TraceCheckUtils]: 0: Hoare triple {5564#true} call ULTIMATE.init(); {5564#true} is VALID [2022-04-28 03:13:48,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {5564#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); {5564#true} is VALID [2022-04-28 03:13:48,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {5564#true} assume true; {5564#true} is VALID [2022-04-28 03:13:48,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5564#true} {5564#true} #56#return; {5564#true} is VALID [2022-04-28 03:13:48,791 INFO L272 TraceCheckUtils]: 4: Hoare triple {5564#true} call #t~ret1 := main(); {5564#true} is VALID [2022-04-28 03:13:48,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {5564#true} ~x~0 := 0;~y~0 := 50; {5594#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:13:48,792 INFO L290 TraceCheckUtils]: 6: Hoare triple {5594#(and (<= main_~x~0 0) (= main_~y~0 50))} [122] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_406 v_main_~x~0_405))) (or (and (<= 50 v_main_~x~0_406) .cse0) (and (< v_main_~x~0_406 v_main_~x~0_405) (< v_main_~x~0_405 51)) .cse0)) InVars {main_~x~0=v_main_~x~0_406} OutVars{main_~x~0=v_main_~x~0_405} AuxVars[] AssignedVars[main_~x~0] {5598#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:13:48,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {5598#(and (= main_~y~0 50) (< main_~x~0 51))} [123] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5598#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:13:48,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {5598#(and (= main_~y~0 50) (< main_~x~0 51))} [124] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_262 v_main_~y~0_261)) (.cse1 (= v_main_~x~0_408 v_main_~x~0_407)) (.cse2 (<= 50 v_main_~x~0_408))) (or (and .cse0 .cse1) (and .cse0 .cse1 (or (not (< v_main_~x~0_408 100)) (not .cse2))) (let ((.cse3 (+ v_main_~x~0_408 v_main_~y~0_261))) (and (< .cse3 (+ 101 v_main_~y~0_262)) .cse2 (= .cse3 (+ v_main_~x~0_407 v_main_~y~0_262)) (< v_main_~y~0_262 v_main_~y~0_261))))) InVars {main_~x~0=v_main_~x~0_408, main_~y~0=v_main_~y~0_262} OutVars{main_~x~0=v_main_~x~0_407, main_~y~0=v_main_~y~0_261} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {5605#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:13:48,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {5605#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [121] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5572#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:13:48,795 INFO L272 TraceCheckUtils]: 10: Hoare triple {5572#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {5612#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:13:48,796 INFO L290 TraceCheckUtils]: 11: Hoare triple {5612#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5616#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:13:48,796 INFO L290 TraceCheckUtils]: 12: Hoare triple {5616#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5565#false} is VALID [2022-04-28 03:13:48,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {5565#false} assume !false; {5565#false} is VALID [2022-04-28 03:13:48,796 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:48,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:13:49,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {5565#false} assume !false; {5565#false} is VALID [2022-04-28 03:13:49,394 INFO L290 TraceCheckUtils]: 12: Hoare triple {5616#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5565#false} is VALID [2022-04-28 03:13:49,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {5612#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5616#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:13:49,395 INFO L272 TraceCheckUtils]: 10: Hoare triple {5572#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {5612#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:13:49,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {5635#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [121] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5572#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:13:49,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {5639#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [124] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_262 v_main_~y~0_261)) (.cse1 (= v_main_~x~0_408 v_main_~x~0_407)) (.cse2 (<= 50 v_main_~x~0_408))) (or (and .cse0 .cse1) (and .cse0 .cse1 (or (not (< v_main_~x~0_408 100)) (not .cse2))) (let ((.cse3 (+ v_main_~x~0_408 v_main_~y~0_261))) (and (< .cse3 (+ 101 v_main_~y~0_262)) .cse2 (= .cse3 (+ v_main_~x~0_407 v_main_~y~0_262)) (< v_main_~y~0_262 v_main_~y~0_261))))) InVars {main_~x~0=v_main_~x~0_408, main_~y~0=v_main_~y~0_262} OutVars{main_~x~0=v_main_~x~0_407, main_~y~0=v_main_~y~0_261} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {5635#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:13:49,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {5639#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [123] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5639#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:13:49,399 INFO L290 TraceCheckUtils]: 6: Hoare triple {5646#(and (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)) (or (and (< main_~x~0 (+ main_~y~0 1)) (<= 50 main_~y~0)) (<= 99 main_~y~0)))} [122] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_406 v_main_~x~0_405))) (or (and (<= 50 v_main_~x~0_406) .cse0) (and (< v_main_~x~0_406 v_main_~x~0_405) (< v_main_~x~0_405 51)) .cse0)) InVars {main_~x~0=v_main_~x~0_406} OutVars{main_~x~0=v_main_~x~0_405} AuxVars[] AssignedVars[main_~x~0] {5639#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:13:49,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {5564#true} ~x~0 := 0;~y~0 := 50; {5646#(and (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)) (or (and (< main_~x~0 (+ main_~y~0 1)) (<= 50 main_~y~0)) (<= 99 main_~y~0)))} is VALID [2022-04-28 03:13:49,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {5564#true} call #t~ret1 := main(); {5564#true} is VALID [2022-04-28 03:13:49,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5564#true} {5564#true} #56#return; {5564#true} is VALID [2022-04-28 03:13:49,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {5564#true} assume true; {5564#true} is VALID [2022-04-28 03:13:49,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {5564#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); {5564#true} is VALID [2022-04-28 03:13:49,400 INFO L272 TraceCheckUtils]: 0: Hoare triple {5564#true} call ULTIMATE.init(); {5564#true} is VALID [2022-04-28 03:13:49,400 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:49,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174075659] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:13:49,400 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:13:49,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:13:50,058 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:13:50,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1002177559] [2022-04-28 03:13:50,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1002177559] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:13:50,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:13:50,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 03:13:50,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37306918] [2022-04-28 03:13:50,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:13:50,059 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 22 states have internal predecessors, (41), 2 states have call successors, (3), 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 45 [2022-04-28 03:13:50,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:13:50,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 22 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call 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:50,098 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:50,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 03:13:50,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:50,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 03:13:50,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=989, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 03:13:50,100 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 22 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call 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,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:51,906 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-28 03:13:51,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 03:13:51,906 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 22 states have internal predecessors, (41), 2 states have call successors, (3), 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 45 [2022-04-28 03:13:51,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:13:51,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 22 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call 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,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 61 transitions. [2022-04-28 03:13:51,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 22 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call 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,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 61 transitions. [2022-04-28 03:13:51,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 61 transitions. [2022-04-28 03:13:51,959 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,959 INFO L225 Difference]: With dead ends: 56 [2022-04-28 03:13:51,959 INFO L226 Difference]: Without dead ends: 49 [2022-04-28 03:13:51,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=369, Invalid=2387, Unknown=0, NotChecked=0, Total=2756 [2022-04-28 03:13:51,961 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 26 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:13:51,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 118 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 03:13:51,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-28 03:13:52,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-28 03:13:52,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:13:52,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 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:52,028 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 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:52,028 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 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:52,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:52,029 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2022-04-28 03:13:52,029 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2022-04-28 03:13:52,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:52,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:52,029 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 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 49 states. [2022-04-28 03:13:52,030 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 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 49 states. [2022-04-28 03:13:52,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:52,030 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2022-04-28 03:13:52,030 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2022-04-28 03:13:52,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:52,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:52,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:13:52,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:13:52,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 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:52,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2022-04-28 03:13:52,032 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 45 [2022-04-28 03:13:52,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:13:52,032 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2022-04-28 03:13:52,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 22 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call 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,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 51 transitions. [2022-04-28 03:13:52,088 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:52,088 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2022-04-28 03:13:52,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 03:13:52,089 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:13:52,089 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:13:52,106 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:52,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:13:52,289 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:13:52,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:13:52,290 INFO L85 PathProgramCache]: Analyzing trace with hash 328472318, now seen corresponding path program 17 times [2022-04-28 03:13:52,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:52,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1439667334] [2022-04-28 03:13:52,392 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:52,740 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:52,741 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:13:52,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1688601292, now seen corresponding path program 1 times [2022-04-28 03:13:52,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:13:52,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967946363] [2022-04-28 03:13:52,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:52,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:13:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:52,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:13:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:52,861 INFO L290 TraceCheckUtils]: 0: Hoare triple {6040#(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); {6029#true} is VALID [2022-04-28 03:13:52,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {6029#true} assume true; {6029#true} is VALID [2022-04-28 03:13:52,861 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6029#true} {6029#true} #56#return; {6029#true} is VALID [2022-04-28 03:13:52,862 INFO L272 TraceCheckUtils]: 0: Hoare triple {6029#true} call ULTIMATE.init(); {6040#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:13:52,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {6040#(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); {6029#true} is VALID [2022-04-28 03:13:52,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {6029#true} assume true; {6029#true} is VALID [2022-04-28 03:13:52,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6029#true} {6029#true} #56#return; {6029#true} is VALID [2022-04-28 03:13:52,862 INFO L272 TraceCheckUtils]: 4: Hoare triple {6029#true} call #t~ret1 := main(); {6029#true} is VALID [2022-04-28 03:13:52,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {6029#true} ~x~0 := 0;~y~0 := 50; {6034#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:13:52,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {6034#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [126] L28-2-->L27-2_primed: Formula: (or (and (not (< v_main_~x~0_440 50)) (= v_main_~x~0_439 v_main_~x~0_440)) (and (< v_main_~x~0_439 51) (< v_main_~x~0_440 v_main_~x~0_439)) (= v_main_~x~0_440 v_main_~x~0_439)) InVars {main_~x~0=v_main_~x~0_440} OutVars{main_~x~0=v_main_~x~0_439} AuxVars[] AssignedVars[main_~x~0] {6035#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:13:52,864 INFO L290 TraceCheckUtils]: 7: Hoare triple {6035#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [127] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6035#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:13:52,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {6035#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [128] L28-2-->L27-2_primed: Formula: (let ((.cse1 (= v_main_~y~0_287 v_main_~y~0_286)) (.cse2 (= v_main_~x~0_442 v_main_~x~0_441)) (.cse0 (<= 50 v_main_~x~0_442))) (or (and (= (+ v_main_~x~0_441 v_main_~y~0_287) (+ v_main_~x~0_442 v_main_~y~0_286)) (< v_main_~x~0_442 v_main_~x~0_441) (< v_main_~x~0_441 101) .cse0) (and .cse1 .cse2) (and .cse1 .cse2 (or (not .cse0) (not (< v_main_~x~0_442 100)))))) InVars {main_~x~0=v_main_~x~0_442, main_~y~0=v_main_~y~0_287} OutVars{main_~x~0=v_main_~x~0_441, main_~y~0=v_main_~y~0_286} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {6036#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:13:52,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {6036#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} [125] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {6037#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:13:52,867 INFO L272 TraceCheckUtils]: 10: Hoare triple {6037#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {6038#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:13:52,867 INFO L290 TraceCheckUtils]: 11: Hoare triple {6038#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {6039#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:13:52,867 INFO L290 TraceCheckUtils]: 12: Hoare triple {6039#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6030#false} is VALID [2022-04-28 03:13:52,868 INFO L290 TraceCheckUtils]: 13: Hoare triple {6030#false} assume !false; {6030#false} is VALID [2022-04-28 03:13:52,868 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:52,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:13:52,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967946363] [2022-04-28 03:13:52,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967946363] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:13:52,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333041924] [2022-04-28 03:13:52,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:52,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:13:52,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:13:52,870 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:52,871 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:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:52,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:13:52,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:52,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:13:53,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {6029#true} call ULTIMATE.init(); {6029#true} is VALID [2022-04-28 03:13:53,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {6029#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); {6029#true} is VALID [2022-04-28 03:13:53,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {6029#true} assume true; {6029#true} is VALID [2022-04-28 03:13:53,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6029#true} {6029#true} #56#return; {6029#true} is VALID [2022-04-28 03:13:53,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {6029#true} call #t~ret1 := main(); {6029#true} is VALID [2022-04-28 03:13:53,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {6029#true} ~x~0 := 0;~y~0 := 50; {6059#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:13:53,230 INFO L290 TraceCheckUtils]: 6: Hoare triple {6059#(and (<= main_~x~0 0) (= main_~y~0 50))} [126] L28-2-->L27-2_primed: Formula: (or (and (not (< v_main_~x~0_440 50)) (= v_main_~x~0_439 v_main_~x~0_440)) (and (< v_main_~x~0_439 51) (< v_main_~x~0_440 v_main_~x~0_439)) (= v_main_~x~0_440 v_main_~x~0_439)) InVars {main_~x~0=v_main_~x~0_440} OutVars{main_~x~0=v_main_~x~0_439} AuxVars[] AssignedVars[main_~x~0] {6063#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:13:53,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {6063#(and (= main_~y~0 50) (< main_~x~0 51))} [127] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6063#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:13:53,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {6063#(and (= main_~y~0 50) (< main_~x~0 51))} [128] L28-2-->L27-2_primed: Formula: (let ((.cse1 (= v_main_~y~0_287 v_main_~y~0_286)) (.cse2 (= v_main_~x~0_442 v_main_~x~0_441)) (.cse0 (<= 50 v_main_~x~0_442))) (or (and (= (+ v_main_~x~0_441 v_main_~y~0_287) (+ v_main_~x~0_442 v_main_~y~0_286)) (< v_main_~x~0_442 v_main_~x~0_441) (< v_main_~x~0_441 101) .cse0) (and .cse1 .cse2) (and .cse1 .cse2 (or (not .cse0) (not (< v_main_~x~0_442 100)))))) InVars {main_~x~0=v_main_~x~0_442, main_~y~0=v_main_~y~0_287} OutVars{main_~x~0=v_main_~x~0_441, main_~y~0=v_main_~y~0_286} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {6070#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:13:53,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {6070#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [125] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {6037#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:13:53,232 INFO L272 TraceCheckUtils]: 10: Hoare triple {6037#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {6077#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:13:53,233 INFO L290 TraceCheckUtils]: 11: Hoare triple {6077#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6081#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:13:53,233 INFO L290 TraceCheckUtils]: 12: Hoare triple {6081#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6030#false} is VALID [2022-04-28 03:13:53,233 INFO L290 TraceCheckUtils]: 13: Hoare triple {6030#false} assume !false; {6030#false} is VALID [2022-04-28 03:13:53,233 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:53,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:13:53,727 INFO L290 TraceCheckUtils]: 13: Hoare triple {6030#false} assume !false; {6030#false} is VALID [2022-04-28 03:13:53,731 INFO L290 TraceCheckUtils]: 12: Hoare triple {6081#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6030#false} is VALID [2022-04-28 03:13:53,732 INFO L290 TraceCheckUtils]: 11: Hoare triple {6077#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6081#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:13:53,733 INFO L272 TraceCheckUtils]: 10: Hoare triple {6037#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {6077#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:13:53,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {6100#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [125] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {6037#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:13:53,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {6104#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [128] L28-2-->L27-2_primed: Formula: (let ((.cse1 (= v_main_~y~0_287 v_main_~y~0_286)) (.cse2 (= v_main_~x~0_442 v_main_~x~0_441)) (.cse0 (<= 50 v_main_~x~0_442))) (or (and (= (+ v_main_~x~0_441 v_main_~y~0_287) (+ v_main_~x~0_442 v_main_~y~0_286)) (< v_main_~x~0_442 v_main_~x~0_441) (< v_main_~x~0_441 101) .cse0) (and .cse1 .cse2) (and .cse1 .cse2 (or (not .cse0) (not (< v_main_~x~0_442 100)))))) InVars {main_~x~0=v_main_~x~0_442, main_~y~0=v_main_~y~0_287} OutVars{main_~x~0=v_main_~x~0_441, main_~y~0=v_main_~y~0_286} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {6100#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:13:53,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {6104#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [127] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6104#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:13:53,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {6111#(and (<= 50 main_~y~0) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [126] L28-2-->L27-2_primed: Formula: (or (and (not (< v_main_~x~0_440 50)) (= v_main_~x~0_439 v_main_~x~0_440)) (and (< v_main_~x~0_439 51) (< v_main_~x~0_440 v_main_~x~0_439)) (= v_main_~x~0_440 v_main_~x~0_439)) InVars {main_~x~0=v_main_~x~0_440} OutVars{main_~x~0=v_main_~x~0_439} AuxVars[] AssignedVars[main_~x~0] {6104#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:13:53,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {6029#true} ~x~0 := 0;~y~0 := 50; {6111#(and (<= 50 main_~y~0) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:13:53,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {6029#true} call #t~ret1 := main(); {6029#true} is VALID [2022-04-28 03:13:53,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6029#true} {6029#true} #56#return; {6029#true} is VALID [2022-04-28 03:13:53,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {6029#true} assume true; {6029#true} is VALID [2022-04-28 03:13:53,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {6029#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); {6029#true} is VALID [2022-04-28 03:13:53,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {6029#true} call ULTIMATE.init(); {6029#true} is VALID [2022-04-28 03:13:53,738 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:53,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333041924] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:13:53,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:13:53,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:13:54,435 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:13:54,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1439667334] [2022-04-28 03:13:54,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1439667334] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:13:54,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:13:54,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 03:13:54,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623941081] [2022-04-28 03:13:54,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:13:54,436 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 23 states have internal predecessors, (43), 2 states have call successors, (3), 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 47 [2022-04-28 03:13:54,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:13:54,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 23 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call 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:54,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:54,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 03:13:54,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:54,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 03:13:54,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1052, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 03:13:54,474 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand has 25 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 23 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call 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:56,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:56,394 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2022-04-28 03:13:56,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 03:13:56,394 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 23 states have internal predecessors, (43), 2 states have call successors, (3), 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 47 [2022-04-28 03:13:56,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:13:56,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 23 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call 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:56,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 63 transitions. [2022-04-28 03:13:56,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 23 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call 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:56,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 63 transitions. [2022-04-28 03:13:56,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 63 transitions. [2022-04-28 03:13:56,447 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:56,447 INFO L225 Difference]: With dead ends: 58 [2022-04-28 03:13:56,448 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 03:13:56,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=385, Invalid=2585, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 03:13:56,449 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 27 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 03:13:56,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 123 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 03:13:56,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 03:13:56,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-28 03:13:56,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:13:56,519 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call 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:56,521 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call 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:56,521 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call 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:56,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:56,522 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2022-04-28 03:13:56,522 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2022-04-28 03:13:56,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:56,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:56,522 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 3 states have call successors, (3), 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:56,523 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 3 states have call successors, (3), 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:56,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:56,523 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2022-04-28 03:13:56,523 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2022-04-28 03:13:56,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:56,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:56,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:13:56,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:13:56,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call 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:56,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2022-04-28 03:13:56,524 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 47 [2022-04-28 03:13:56,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:13:56,524 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2022-04-28 03:13:56,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 23 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call 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:56,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 53 transitions. [2022-04-28 03:13:56,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:56,568 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2022-04-28 03:13:56,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 03:13:56,568 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:13:56,568 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:13:56,589 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:56,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:13:56,769 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:13:56,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:13:56,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1096010023, now seen corresponding path program 18 times [2022-04-28 03:13:56,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:56,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [713310428] [2022-04-28 03:14:00,831 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:14:00,874 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:14:03,173 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:14:03,175 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:14:03,177 INFO L85 PathProgramCache]: Analyzing trace with hash -556833844, now seen corresponding path program 1 times [2022-04-28 03:14:03,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:14:03,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206276928] [2022-04-28 03:14:03,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:03,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:14:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:03,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:14:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:03,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {6520#(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); {6509#true} is VALID [2022-04-28 03:14:03,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {6509#true} assume true; {6509#true} is VALID [2022-04-28 03:14:03,290 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6509#true} {6509#true} #56#return; {6509#true} is VALID [2022-04-28 03:14:03,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {6509#true} call ULTIMATE.init(); {6520#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:14:03,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {6520#(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); {6509#true} is VALID [2022-04-28 03:14:03,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {6509#true} assume true; {6509#true} is VALID [2022-04-28 03:14:03,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6509#true} {6509#true} #56#return; {6509#true} is VALID [2022-04-28 03:14:03,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {6509#true} call #t~ret1 := main(); {6509#true} is VALID [2022-04-28 03:14:03,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {6509#true} ~x~0 := 0;~y~0 := 50; {6514#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:14:03,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {6514#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [130] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_475 v_main_~x~0_474))) (or (and (<= 50 v_main_~x~0_475) .cse0) (and (< v_main_~x~0_474 51) (< v_main_~x~0_475 v_main_~x~0_474)) .cse0)) InVars {main_~x~0=v_main_~x~0_475} OutVars{main_~x~0=v_main_~x~0_474} AuxVars[] AssignedVars[main_~x~0] {6515#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:14:03,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {6515#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [131] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6515#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:14:03,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {6515#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [132] L28-2-->L27-2_primed: Formula: (let ((.cse3 (<= 50 v_main_~x~0_477)) (.cse0 (= v_main_~y~0_313 v_main_~y~0_312)) (.cse1 (= v_main_~x~0_477 v_main_~x~0_476))) (or (and .cse0 .cse1) (let ((.cse2 (+ v_main_~x~0_477 v_main_~y~0_312))) (and (< .cse2 (+ 101 v_main_~y~0_313)) (= .cse2 (+ v_main_~x~0_476 v_main_~y~0_313)) .cse3 (< v_main_~y~0_313 v_main_~y~0_312))) (and (or (not (< v_main_~x~0_477 100)) (not .cse3)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_477, main_~y~0=v_main_~y~0_313} OutVars{main_~x~0=v_main_~x~0_476, main_~y~0=v_main_~y~0_312} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {6516#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:14:03,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {6516#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} [129] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {6517#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:14:03,296 INFO L272 TraceCheckUtils]: 10: Hoare triple {6517#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {6518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:14:03,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {6518#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {6519#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:14:03,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {6519#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6510#false} is VALID [2022-04-28 03:14:03,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {6510#false} assume !false; {6510#false} is VALID [2022-04-28 03:14:03,297 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,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:14:03,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206276928] [2022-04-28 03:14:03,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206276928] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:14:03,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226558752] [2022-04-28 03:14:03,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:03,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:14:03,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:14:03,300 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:03,324 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:03,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:03,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:14:03,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:03,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:14:03,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {6509#true} call ULTIMATE.init(); {6509#true} is VALID [2022-04-28 03:14:03,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {6509#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); {6509#true} is VALID [2022-04-28 03:14:03,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {6509#true} assume true; {6509#true} is VALID [2022-04-28 03:14:03,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6509#true} {6509#true} #56#return; {6509#true} is VALID [2022-04-28 03:14:03,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {6509#true} call #t~ret1 := main(); {6509#true} is VALID [2022-04-28 03:14:03,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {6509#true} ~x~0 := 0;~y~0 := 50; {6539#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:14:03,669 INFO L290 TraceCheckUtils]: 6: Hoare triple {6539#(and (<= main_~x~0 0) (= main_~y~0 50))} [130] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_475 v_main_~x~0_474))) (or (and (<= 50 v_main_~x~0_475) .cse0) (and (< v_main_~x~0_474 51) (< v_main_~x~0_475 v_main_~x~0_474)) .cse0)) InVars {main_~x~0=v_main_~x~0_475} OutVars{main_~x~0=v_main_~x~0_474} AuxVars[] AssignedVars[main_~x~0] {6543#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:14:03,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {6543#(and (= main_~y~0 50) (< main_~x~0 51))} [131] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6543#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:14:03,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {6543#(and (= main_~y~0 50) (< main_~x~0 51))} [132] L28-2-->L27-2_primed: Formula: (let ((.cse3 (<= 50 v_main_~x~0_477)) (.cse0 (= v_main_~y~0_313 v_main_~y~0_312)) (.cse1 (= v_main_~x~0_477 v_main_~x~0_476))) (or (and .cse0 .cse1) (let ((.cse2 (+ v_main_~x~0_477 v_main_~y~0_312))) (and (< .cse2 (+ 101 v_main_~y~0_313)) (= .cse2 (+ v_main_~x~0_476 v_main_~y~0_313)) .cse3 (< v_main_~y~0_313 v_main_~y~0_312))) (and (or (not (< v_main_~x~0_477 100)) (not .cse3)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_477, main_~y~0=v_main_~y~0_313} OutVars{main_~x~0=v_main_~x~0_476, main_~y~0=v_main_~y~0_312} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {6550#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:14:03,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {6550#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [129] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {6517#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:14:03,672 INFO L272 TraceCheckUtils]: 10: Hoare triple {6517#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {6557#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:14:03,673 INFO L290 TraceCheckUtils]: 11: Hoare triple {6557#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6561#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:14:03,673 INFO L290 TraceCheckUtils]: 12: Hoare triple {6561#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6510#false} is VALID [2022-04-28 03:14:03,673 INFO L290 TraceCheckUtils]: 13: Hoare triple {6510#false} assume !false; {6510#false} is VALID [2022-04-28 03:14:03,673 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,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:14:04,266 INFO L290 TraceCheckUtils]: 13: Hoare triple {6510#false} assume !false; {6510#false} is VALID [2022-04-28 03:14:04,267 INFO L290 TraceCheckUtils]: 12: Hoare triple {6561#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6510#false} is VALID [2022-04-28 03:14:04,267 INFO L290 TraceCheckUtils]: 11: Hoare triple {6557#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6561#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:14:04,268 INFO L272 TraceCheckUtils]: 10: Hoare triple {6517#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {6557#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:14:04,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {6580#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [129] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {6517#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:14:04,269 INFO L290 TraceCheckUtils]: 8: Hoare triple {6584#(and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [132] L28-2-->L27-2_primed: Formula: (let ((.cse3 (<= 50 v_main_~x~0_477)) (.cse0 (= v_main_~y~0_313 v_main_~y~0_312)) (.cse1 (= v_main_~x~0_477 v_main_~x~0_476))) (or (and .cse0 .cse1) (let ((.cse2 (+ v_main_~x~0_477 v_main_~y~0_312))) (and (< .cse2 (+ 101 v_main_~y~0_313)) (= .cse2 (+ v_main_~x~0_476 v_main_~y~0_313)) .cse3 (< v_main_~y~0_313 v_main_~y~0_312))) (and (or (not (< v_main_~x~0_477 100)) (not .cse3)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_477, main_~y~0=v_main_~y~0_313} OutVars{main_~x~0=v_main_~x~0_476, main_~y~0=v_main_~y~0_312} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {6580#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:14:04,270 INFO L290 TraceCheckUtils]: 7: Hoare triple {6584#(and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [131] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6584#(and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:14:04,271 INFO L290 TraceCheckUtils]: 6: Hoare triple {6591#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (<= 50 main_~y~0) (<= main_~y~0 100) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [130] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_475 v_main_~x~0_474))) (or (and (<= 50 v_main_~x~0_475) .cse0) (and (< v_main_~x~0_474 51) (< v_main_~x~0_475 v_main_~x~0_474)) .cse0)) InVars {main_~x~0=v_main_~x~0_475} OutVars{main_~x~0=v_main_~x~0_474} AuxVars[] AssignedVars[main_~x~0] {6584#(and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:14:04,271 INFO L290 TraceCheckUtils]: 5: Hoare triple {6509#true} ~x~0 := 0;~y~0 := 50; {6591#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (<= 50 main_~y~0) (<= main_~y~0 100) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:14:04,272 INFO L272 TraceCheckUtils]: 4: Hoare triple {6509#true} call #t~ret1 := main(); {6509#true} is VALID [2022-04-28 03:14:04,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6509#true} {6509#true} #56#return; {6509#true} is VALID [2022-04-28 03:14:04,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {6509#true} assume true; {6509#true} is VALID [2022-04-28 03:14:04,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {6509#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); {6509#true} is VALID [2022-04-28 03:14:04,272 INFO L272 TraceCheckUtils]: 0: Hoare triple {6509#true} call ULTIMATE.init(); {6509#true} is VALID [2022-04-28 03:14:04,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:04,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226558752] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:14:04,272 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:14:04,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:14:05,065 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:14:05,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [713310428] [2022-04-28 03:14:05,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [713310428] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:14:05,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:14:05,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 03:14:05,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010445638] [2022-04-28 03:14:05,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:14:05,066 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.8) internal successors, (45), 24 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:14:05,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:14:05,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 25 states have (on average 1.8) internal successors, (45), 24 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:14:05,104 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:14:05,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 03:14:05,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:05,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 03:14:05,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1117, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 03:14:05,105 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand has 26 states, 25 states have (on average 1.8) internal successors, (45), 24 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:14:07,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:07,247 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2022-04-28 03:14:07,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 03:14:07,248 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.8) internal successors, (45), 24 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:14:07,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:14:07,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.8) internal successors, (45), 24 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:14:07,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 65 transitions. [2022-04-28 03:14:07,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.8) internal successors, (45), 24 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:14:07,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 65 transitions. [2022-04-28 03:14:07,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 65 transitions. [2022-04-28 03:14:07,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:14:07,322 INFO L225 Difference]: With dead ends: 60 [2022-04-28 03:14:07,322 INFO L226 Difference]: Without dead ends: 53 [2022-04-28 03:14:07,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=401, Invalid=2791, Unknown=0, NotChecked=0, Total=3192 [2022-04-28 03:14:07,324 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 28 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 1106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:14:07,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 128 Invalid, 1106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 03:14:07,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-28 03:14:07,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-28 03:14:07,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:14:07,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call 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,395 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call 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,395 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call 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,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:07,396 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2022-04-28 03:14:07,396 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2022-04-28 03:14:07,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:07,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:07,397 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 3 states have call successors, (3), 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 53 states. [2022-04-28 03:14:07,397 INFO L87 Difference]: Start difference. First operand has 53 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 3 states have call successors, (3), 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 53 states. [2022-04-28 03:14:07,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:07,398 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2022-04-28 03:14:07,398 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2022-04-28 03:14:07,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:07,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:07,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:14:07,398 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:14:07,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call 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,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2022-04-28 03:14:07,399 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 49 [2022-04-28 03:14:07,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:14:07,399 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2022-04-28 03:14:07,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.8) internal successors, (45), 24 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:14:07,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 55 transitions. [2022-04-28 03:14:07,454 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:14:07,454 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2022-04-28 03:14:07,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 03:14:07,454 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:14:07,454 INFO L195 NwaCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:14:07,471 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,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:14:07,655 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:14:07,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:14:07,655 INFO L85 PathProgramCache]: Analyzing trace with hash 71027700, now seen corresponding path program 19 times [2022-04-28 03:14:07,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:07,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [70850556] [2022-04-28 03:14:11,713 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:14:11,762 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:14:11,990 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:14:11,991 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:14:11,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1492698316, now seen corresponding path program 1 times [2022-04-28 03:14:11,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:14:11,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729010418] [2022-04-28 03:14:11,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:11,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:14:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:12,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:14:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:12,100 INFO L290 TraceCheckUtils]: 0: Hoare triple {7015#(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); {7004#true} is VALID [2022-04-28 03:14:12,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {7004#true} assume true; {7004#true} is VALID [2022-04-28 03:14:12,101 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7004#true} {7004#true} #56#return; {7004#true} is VALID [2022-04-28 03:14:12,101 INFO L272 TraceCheckUtils]: 0: Hoare triple {7004#true} call ULTIMATE.init(); {7015#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:14:12,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {7015#(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); {7004#true} is VALID [2022-04-28 03:14:12,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {7004#true} assume true; {7004#true} is VALID [2022-04-28 03:14:12,101 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7004#true} {7004#true} #56#return; {7004#true} is VALID [2022-04-28 03:14:12,101 INFO L272 TraceCheckUtils]: 4: Hoare triple {7004#true} call #t~ret1 := main(); {7004#true} is VALID [2022-04-28 03:14:12,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {7004#true} ~x~0 := 0;~y~0 := 50; {7009#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:14:12,102 INFO L290 TraceCheckUtils]: 6: Hoare triple {7009#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [134] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_511 v_main_~x~0_510))) (or (and (< v_main_~x~0_510 51) (< v_main_~x~0_511 v_main_~x~0_510)) .cse0 (and .cse0 (<= 50 v_main_~x~0_511)))) InVars {main_~x~0=v_main_~x~0_511} OutVars{main_~x~0=v_main_~x~0_510} AuxVars[] AssignedVars[main_~x~0] {7010#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:14:12,103 INFO L290 TraceCheckUtils]: 7: Hoare triple {7010#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [135] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7010#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:14:12,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {7010#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [136] L28-2-->L27-2_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_513)) (.cse1 (= v_main_~x~0_513 v_main_~x~0_512))) (or (and (or (not (< v_main_~x~0_513 100)) (not .cse0)) .cse1 (= v_main_~y~0_339 v_main_~y~0_340)) (and .cse0 (< v_main_~x~0_513 v_main_~x~0_512) (= (+ v_main_~x~0_513 v_main_~y~0_339) (+ v_main_~x~0_512 v_main_~y~0_340)) (< v_main_~x~0_512 101)) (and .cse1 (= v_main_~y~0_340 v_main_~y~0_339)))) InVars {main_~x~0=v_main_~x~0_513, main_~y~0=v_main_~y~0_340} OutVars{main_~x~0=v_main_~x~0_512, main_~y~0=v_main_~y~0_339} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {7011#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:14:12,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {7011#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} [133] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {7012#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:14:12,105 INFO L272 TraceCheckUtils]: 10: Hoare triple {7012#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {7013#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:14:12,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {7013#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {7014#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:14:12,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {7014#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {7005#false} is VALID [2022-04-28 03:14:12,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {7005#false} assume !false; {7005#false} is VALID [2022-04-28 03:14:12,106 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:12,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:14:12,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729010418] [2022-04-28 03:14:12,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729010418] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:14:12,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110603507] [2022-04-28 03:14:12,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:12,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:14:12,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:14:12,107 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:12,110 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:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:12,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:14:12,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:12,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:14:12,424 INFO L272 TraceCheckUtils]: 0: Hoare triple {7004#true} call ULTIMATE.init(); {7004#true} is VALID [2022-04-28 03:14:12,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {7004#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); {7004#true} is VALID [2022-04-28 03:14:12,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {7004#true} assume true; {7004#true} is VALID [2022-04-28 03:14:12,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7004#true} {7004#true} #56#return; {7004#true} is VALID [2022-04-28 03:14:12,424 INFO L272 TraceCheckUtils]: 4: Hoare triple {7004#true} call #t~ret1 := main(); {7004#true} is VALID [2022-04-28 03:14:12,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {7004#true} ~x~0 := 0;~y~0 := 50; {7034#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:14:12,430 INFO L290 TraceCheckUtils]: 6: Hoare triple {7034#(and (<= main_~x~0 0) (= main_~y~0 50))} [134] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_511 v_main_~x~0_510))) (or (and (< v_main_~x~0_510 51) (< v_main_~x~0_511 v_main_~x~0_510)) .cse0 (and .cse0 (<= 50 v_main_~x~0_511)))) InVars {main_~x~0=v_main_~x~0_511} OutVars{main_~x~0=v_main_~x~0_510} AuxVars[] AssignedVars[main_~x~0] {7038#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:14:12,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {7038#(and (= main_~y~0 50) (< main_~x~0 51))} [135] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7038#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:14:12,431 INFO L290 TraceCheckUtils]: 8: Hoare triple {7038#(and (= main_~y~0 50) (< main_~x~0 51))} [136] L28-2-->L27-2_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_513)) (.cse1 (= v_main_~x~0_513 v_main_~x~0_512))) (or (and (or (not (< v_main_~x~0_513 100)) (not .cse0)) .cse1 (= v_main_~y~0_339 v_main_~y~0_340)) (and .cse0 (< v_main_~x~0_513 v_main_~x~0_512) (= (+ v_main_~x~0_513 v_main_~y~0_339) (+ v_main_~x~0_512 v_main_~y~0_340)) (< v_main_~x~0_512 101)) (and .cse1 (= v_main_~y~0_340 v_main_~y~0_339)))) InVars {main_~x~0=v_main_~x~0_513, main_~y~0=v_main_~y~0_340} OutVars{main_~x~0=v_main_~x~0_512, main_~y~0=v_main_~y~0_339} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {7045#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:14:12,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {7045#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [133] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {7012#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:14:12,433 INFO L272 TraceCheckUtils]: 10: Hoare triple {7012#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {7052#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:14:12,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {7052#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7056#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:14:12,433 INFO L290 TraceCheckUtils]: 12: Hoare triple {7056#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7005#false} is VALID [2022-04-28 03:14:12,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {7005#false} assume !false; {7005#false} is VALID [2022-04-28 03:14:12,434 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:12,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:14:12,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {7005#false} assume !false; {7005#false} is VALID [2022-04-28 03:14:12,909 INFO L290 TraceCheckUtils]: 12: Hoare triple {7056#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7005#false} is VALID [2022-04-28 03:14:12,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {7052#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7056#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:14:12,910 INFO L272 TraceCheckUtils]: 10: Hoare triple {7012#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {7052#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:14:12,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {7075#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [133] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {7012#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:14:12,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {7079#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (< main_~x~0 (+ main_~y~0 1)) (not (<= 50 main_~x~0)) (<= 99 main_~y~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [136] L28-2-->L27-2_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_513)) (.cse1 (= v_main_~x~0_513 v_main_~x~0_512))) (or (and (or (not (< v_main_~x~0_513 100)) (not .cse0)) .cse1 (= v_main_~y~0_339 v_main_~y~0_340)) (and .cse0 (< v_main_~x~0_513 v_main_~x~0_512) (= (+ v_main_~x~0_513 v_main_~y~0_339) (+ v_main_~x~0_512 v_main_~y~0_340)) (< v_main_~x~0_512 101)) (and .cse1 (= v_main_~y~0_340 v_main_~y~0_339)))) InVars {main_~x~0=v_main_~x~0_513, main_~y~0=v_main_~y~0_340} OutVars{main_~x~0=v_main_~x~0_512, main_~y~0=v_main_~y~0_339} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {7075#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:14:12,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {7079#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (< main_~x~0 (+ main_~y~0 1)) (not (<= 50 main_~x~0)) (<= 99 main_~y~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [135] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7079#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (< main_~x~0 (+ main_~y~0 1)) (not (<= 50 main_~x~0)) (<= 99 main_~y~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:14:12,913 INFO L290 TraceCheckUtils]: 6: Hoare triple {7086#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (<= main_~y~0 100) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)) (or (and (< main_~x~0 (+ main_~y~0 1)) (<= 50 main_~y~0)) (<= 99 main_~y~0)))} [134] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_511 v_main_~x~0_510))) (or (and (< v_main_~x~0_510 51) (< v_main_~x~0_511 v_main_~x~0_510)) .cse0 (and .cse0 (<= 50 v_main_~x~0_511)))) InVars {main_~x~0=v_main_~x~0_511} OutVars{main_~x~0=v_main_~x~0_510} AuxVars[] AssignedVars[main_~x~0] {7079#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (< main_~x~0 (+ main_~y~0 1)) (not (<= 50 main_~x~0)) (<= 99 main_~y~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:14:12,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {7004#true} ~x~0 := 0;~y~0 := 50; {7086#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (<= main_~y~0 100) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)) (or (and (< main_~x~0 (+ main_~y~0 1)) (<= 50 main_~y~0)) (<= 99 main_~y~0)))} is VALID [2022-04-28 03:14:12,913 INFO L272 TraceCheckUtils]: 4: Hoare triple {7004#true} call #t~ret1 := main(); {7004#true} is VALID [2022-04-28 03:14:12,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7004#true} {7004#true} #56#return; {7004#true} is VALID [2022-04-28 03:14:12,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {7004#true} assume true; {7004#true} is VALID [2022-04-28 03:14:12,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {7004#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); {7004#true} is VALID [2022-04-28 03:14:12,914 INFO L272 TraceCheckUtils]: 0: Hoare triple {7004#true} call ULTIMATE.init(); {7004#true} is VALID [2022-04-28 03:14:12,914 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:12,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110603507] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:14:12,914 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:14:12,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:14:13,707 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:14:13,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [70850556] [2022-04-28 03:14:13,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [70850556] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:14:13,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:14:13,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-28 03:14:13,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526603692] [2022-04-28 03:14:13,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:14:13,707 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 25 states have internal predecessors, (47), 2 states have call successors, (3), 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 51 [2022-04-28 03:14:13,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:14:13,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 25 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call 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:13,747 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:14:13,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-28 03:14:13,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:13,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-28 03:14:13,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1184, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 03:14:13,748 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand has 27 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 25 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call 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:16,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:16,038 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2022-04-28 03:14:16,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 03:14:16,038 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 25 states have internal predecessors, (47), 2 states have call successors, (3), 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 51 [2022-04-28 03:14:16,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:14:16,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 25 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call 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:16,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 67 transitions. [2022-04-28 03:14:16,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 25 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call 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:16,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 67 transitions. [2022-04-28 03:14:16,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 67 transitions. [2022-04-28 03:14:16,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:14:16,096 INFO L225 Difference]: With dead ends: 62 [2022-04-28 03:14:16,096 INFO L226 Difference]: Without dead ends: 55 [2022-04-28 03:14:16,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=417, Invalid=3005, Unknown=0, NotChecked=0, Total=3422 [2022-04-28 03:14:16,098 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 29 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:14:16,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 133 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1176 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 03:14:16,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-28 03:14:16,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-28 03:14:16,173 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:14:16,173 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.06) internal successors, (53), 50 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:14:16,173 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.06) internal successors, (53), 50 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:14:16,173 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.06) internal successors, (53), 50 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:14:16,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:16,174 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2022-04-28 03:14:16,174 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-28 03:14:16,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:16,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:16,175 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.06) internal successors, (53), 50 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 55 states. [2022-04-28 03:14:16,175 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.06) internal successors, (53), 50 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 55 states. [2022-04-28 03:14:16,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:16,175 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2022-04-28 03:14:16,175 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-28 03:14:16,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:16,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:16,176 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:14:16,176 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:14:16,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.06) internal successors, (53), 50 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:14:16,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2022-04-28 03:14:16,176 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 51 [2022-04-28 03:14:16,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:14:16,177 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-04-28 03:14:16,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 25 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call 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:16,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 57 transitions. [2022-04-28 03:14:16,226 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:14:16,226 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-28 03:14:16,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-28 03:14:16,227 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:14:16,227 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:14:16,244 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:16,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:14:16,428 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:14:16,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:14:16,428 INFO L85 PathProgramCache]: Analyzing trace with hash 607815247, now seen corresponding path program 20 times [2022-04-28 03:14:16,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:16,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [330121864] [2022-04-28 03:14:16,532 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:14:18,836 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:14:18,837 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:14:18,839 INFO L85 PathProgramCache]: Analyzing trace with hash -752736820, now seen corresponding path program 1 times [2022-04-28 03:14:18,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:14:18,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150979711] [2022-04-28 03:14:18,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:18,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:14:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:18,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:14:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:18,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {7525#(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); {7514#true} is VALID [2022-04-28 03:14:18,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {7514#true} assume true; {7514#true} is VALID [2022-04-28 03:14:18,940 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7514#true} {7514#true} #56#return; {7514#true} is VALID [2022-04-28 03:14:18,941 INFO L272 TraceCheckUtils]: 0: Hoare triple {7514#true} call ULTIMATE.init(); {7525#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:14:18,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {7525#(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); {7514#true} is VALID [2022-04-28 03:14:18,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {7514#true} assume true; {7514#true} is VALID [2022-04-28 03:14:18,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7514#true} {7514#true} #56#return; {7514#true} is VALID [2022-04-28 03:14:18,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {7514#true} call #t~ret1 := main(); {7514#true} is VALID [2022-04-28 03:14:18,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {7514#true} ~x~0 := 0;~y~0 := 50; {7519#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:14:18,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {7519#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [138] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_548 v_main_~x~0_547))) (or .cse0 (and (not (< v_main_~x~0_548 50)) .cse0) (and (< v_main_~x~0_548 v_main_~x~0_547) (< v_main_~x~0_547 51)))) InVars {main_~x~0=v_main_~x~0_548} OutVars{main_~x~0=v_main_~x~0_547} AuxVars[] AssignedVars[main_~x~0] {7520#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:14:18,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {7520#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [139] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7520#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:14:18,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {7520#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [140] L28-2-->L27-2_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_550))) (or (and (or (not (< v_main_~x~0_550 100)) (not .cse0)) (= v_main_~x~0_549 v_main_~x~0_550) (= v_main_~y~0_367 v_main_~y~0_368)) (and (= v_main_~y~0_368 v_main_~y~0_367) (= v_main_~x~0_550 v_main_~x~0_549)) (and (< v_main_~x~0_549 101) (< v_main_~x~0_550 v_main_~x~0_549) .cse0 (= (+ v_main_~x~0_549 v_main_~y~0_368) (+ v_main_~x~0_550 v_main_~y~0_367))))) InVars {main_~x~0=v_main_~x~0_550, main_~y~0=v_main_~y~0_368} OutVars{main_~x~0=v_main_~x~0_549, main_~y~0=v_main_~y~0_367} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {7521#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:14:18,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {7521#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} [137] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {7522#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:14:18,945 INFO L272 TraceCheckUtils]: 10: Hoare triple {7522#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {7523#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:14:18,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {7523#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {7524#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:14:18,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {7524#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {7515#false} is VALID [2022-04-28 03:14:18,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {7515#false} assume !false; {7515#false} is VALID [2022-04-28 03:14:18,945 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:18,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:14:18,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150979711] [2022-04-28 03:14:18,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150979711] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:14:18,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480769860] [2022-04-28 03:14:18,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:18,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:14:18,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:14:18,947 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:18,948 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:18,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:18,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:14:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:18,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:14:19,250 INFO L272 TraceCheckUtils]: 0: Hoare triple {7514#true} call ULTIMATE.init(); {7514#true} is VALID [2022-04-28 03:14:19,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {7514#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); {7514#true} is VALID [2022-04-28 03:14:19,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {7514#true} assume true; {7514#true} is VALID [2022-04-28 03:14:19,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7514#true} {7514#true} #56#return; {7514#true} is VALID [2022-04-28 03:14:19,251 INFO L272 TraceCheckUtils]: 4: Hoare triple {7514#true} call #t~ret1 := main(); {7514#true} is VALID [2022-04-28 03:14:19,251 INFO L290 TraceCheckUtils]: 5: Hoare triple {7514#true} ~x~0 := 0;~y~0 := 50; {7544#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:14:19,252 INFO L290 TraceCheckUtils]: 6: Hoare triple {7544#(and (<= main_~x~0 0) (= main_~y~0 50))} [138] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_548 v_main_~x~0_547))) (or .cse0 (and (not (< v_main_~x~0_548 50)) .cse0) (and (< v_main_~x~0_548 v_main_~x~0_547) (< v_main_~x~0_547 51)))) InVars {main_~x~0=v_main_~x~0_548} OutVars{main_~x~0=v_main_~x~0_547} AuxVars[] AssignedVars[main_~x~0] {7548#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:14:19,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {7548#(and (= main_~y~0 50) (< main_~x~0 51))} [139] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7548#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:14:19,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {7548#(and (= main_~y~0 50) (< main_~x~0 51))} [140] L28-2-->L27-2_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_550))) (or (and (or (not (< v_main_~x~0_550 100)) (not .cse0)) (= v_main_~x~0_549 v_main_~x~0_550) (= v_main_~y~0_367 v_main_~y~0_368)) (and (= v_main_~y~0_368 v_main_~y~0_367) (= v_main_~x~0_550 v_main_~x~0_549)) (and (< v_main_~x~0_549 101) (< v_main_~x~0_550 v_main_~x~0_549) .cse0 (= (+ v_main_~x~0_549 v_main_~y~0_368) (+ v_main_~x~0_550 v_main_~y~0_367))))) InVars {main_~x~0=v_main_~x~0_550, main_~y~0=v_main_~y~0_368} OutVars{main_~x~0=v_main_~x~0_549, main_~y~0=v_main_~y~0_367} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {7555#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:14:19,253 INFO L290 TraceCheckUtils]: 9: Hoare triple {7555#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [137] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {7522#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:14:19,254 INFO L272 TraceCheckUtils]: 10: Hoare triple {7522#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {7562#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:14:19,254 INFO L290 TraceCheckUtils]: 11: Hoare triple {7562#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7566#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:14:19,255 INFO L290 TraceCheckUtils]: 12: Hoare triple {7566#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7515#false} is VALID [2022-04-28 03:14:19,255 INFO L290 TraceCheckUtils]: 13: Hoare triple {7515#false} assume !false; {7515#false} is VALID [2022-04-28 03:14:19,255 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:19,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:14:19,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {7515#false} assume !false; {7515#false} is VALID [2022-04-28 03:14:19,731 INFO L290 TraceCheckUtils]: 12: Hoare triple {7566#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7515#false} is VALID [2022-04-28 03:14:19,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {7562#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7566#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:14:19,732 INFO L272 TraceCheckUtils]: 10: Hoare triple {7522#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {7562#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:14:19,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {7585#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [137] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {7522#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:14:19,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {7589#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [140] L28-2-->L27-2_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_550))) (or (and (or (not (< v_main_~x~0_550 100)) (not .cse0)) (= v_main_~x~0_549 v_main_~x~0_550) (= v_main_~y~0_367 v_main_~y~0_368)) (and (= v_main_~y~0_368 v_main_~y~0_367) (= v_main_~x~0_550 v_main_~x~0_549)) (and (< v_main_~x~0_549 101) (< v_main_~x~0_550 v_main_~x~0_549) .cse0 (= (+ v_main_~x~0_549 v_main_~y~0_368) (+ v_main_~x~0_550 v_main_~y~0_367))))) InVars {main_~x~0=v_main_~x~0_550, main_~y~0=v_main_~y~0_368} OutVars{main_~x~0=v_main_~x~0_549, main_~y~0=v_main_~y~0_367} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {7585#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:14:19,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {7589#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [139] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7589#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:14:19,735 INFO L290 TraceCheckUtils]: 6: Hoare triple {7596#(and (<= 50 main_~y~0) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))) (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [138] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_548 v_main_~x~0_547))) (or .cse0 (and (not (< v_main_~x~0_548 50)) .cse0) (and (< v_main_~x~0_548 v_main_~x~0_547) (< v_main_~x~0_547 51)))) InVars {main_~x~0=v_main_~x~0_548} OutVars{main_~x~0=v_main_~x~0_547} AuxVars[] AssignedVars[main_~x~0] {7589#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:14:19,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {7514#true} ~x~0 := 0;~y~0 := 50; {7596#(and (<= 50 main_~y~0) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))) (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:14:19,735 INFO L272 TraceCheckUtils]: 4: Hoare triple {7514#true} call #t~ret1 := main(); {7514#true} is VALID [2022-04-28 03:14:19,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7514#true} {7514#true} #56#return; {7514#true} is VALID [2022-04-28 03:14:19,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {7514#true} assume true; {7514#true} is VALID [2022-04-28 03:14:19,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {7514#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); {7514#true} is VALID [2022-04-28 03:14:19,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {7514#true} call ULTIMATE.init(); {7514#true} is VALID [2022-04-28 03:14:19,736 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:19,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480769860] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:14:19,736 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:14:19,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:14:20,554 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:14:20,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [330121864] [2022-04-28 03:14:20,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [330121864] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:14:20,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:14:20,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-28 03:14:20,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424022822] [2022-04-28 03:14:20,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:14:20,555 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 26 states have internal predecessors, (49), 2 states have call successors, (3), 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 53 [2022-04-28 03:14:20,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:14:20,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 26 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call 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:20,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:14:20,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-28 03:14:20,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:20,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-28 03:14:20,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1253, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 03:14:20,596 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 28 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 26 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call 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:23,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:23,099 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2022-04-28 03:14:23,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 03:14:23,100 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 26 states have internal predecessors, (49), 2 states have call successors, (3), 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 53 [2022-04-28 03:14:23,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:14:23,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 26 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call 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:23,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 69 transitions. [2022-04-28 03:14:23,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 26 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call 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:23,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 69 transitions. [2022-04-28 03:14:23,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 69 transitions. [2022-04-28 03:14:23,176 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:14:23,177 INFO L225 Difference]: With dead ends: 64 [2022-04-28 03:14:23,177 INFO L226 Difference]: Without dead ends: 57 [2022-04-28 03:14:23,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 843 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=433, Invalid=3227, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 03:14:23,179 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 30 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:14:23,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 138 Invalid, 1302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1275 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 03:14:23,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-28 03:14:23,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-28 03:14:23,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:14:23,255 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call 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:23,255 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call 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:23,255 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call 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:23,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:23,256 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2022-04-28 03:14:23,257 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-04-28 03:14:23,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:23,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:23,257 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 states have internal predecessors, (55), 3 states have call successors, (3), 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:14:23,257 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 states have internal predecessors, (55), 3 states have call successors, (3), 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:14:23,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:23,258 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2022-04-28 03:14:23,258 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-04-28 03:14:23,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:23,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:23,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:14:23,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:14:23,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call 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:23,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2022-04-28 03:14:23,260 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 53 [2022-04-28 03:14:23,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:14:23,260 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2022-04-28 03:14:23,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 26 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call 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:23,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 59 transitions. [2022-04-28 03:14:23,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:14:23,320 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-04-28 03:14:23,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 03:14:23,321 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:14:23,321 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:14:23,337 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:23,527 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,SelfDestructingSolverStorable22 [2022-04-28 03:14:23,527 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:14:23,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:14:23,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1064572394, now seen corresponding path program 21 times [2022-04-28 03:14:23,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:23,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1383243240] [2022-04-28 03:14:27,585 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:14:27,629 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:14:27,839 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:14:27,840 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:14:27,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1296795340, now seen corresponding path program 1 times [2022-04-28 03:14:27,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:14:27,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658225765] [2022-04-28 03:14:27,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:27,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:14:27,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:27,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:14:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:27,966 INFO L290 TraceCheckUtils]: 0: Hoare triple {8050#(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); {8039#true} is VALID [2022-04-28 03:14:27,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {8039#true} assume true; {8039#true} is VALID [2022-04-28 03:14:27,966 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8039#true} {8039#true} #56#return; {8039#true} is VALID [2022-04-28 03:14:27,967 INFO L272 TraceCheckUtils]: 0: Hoare triple {8039#true} call ULTIMATE.init(); {8050#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:14:27,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {8050#(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); {8039#true} is VALID [2022-04-28 03:14:27,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {8039#true} assume true; {8039#true} is VALID [2022-04-28 03:14:27,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8039#true} {8039#true} #56#return; {8039#true} is VALID [2022-04-28 03:14:27,967 INFO L272 TraceCheckUtils]: 4: Hoare triple {8039#true} call #t~ret1 := main(); {8039#true} is VALID [2022-04-28 03:14:27,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {8039#true} ~x~0 := 0;~y~0 := 50; {8044#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:14:27,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {8044#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [142] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_586 v_main_~x~0_585))) (or (and (<= 50 v_main_~x~0_586) .cse0) .cse0 (and (< v_main_~x~0_586 v_main_~x~0_585) (< v_main_~x~0_585 51)))) InVars {main_~x~0=v_main_~x~0_586} OutVars{main_~x~0=v_main_~x~0_585} AuxVars[] AssignedVars[main_~x~0] {8045#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:14:27,969 INFO L290 TraceCheckUtils]: 7: Hoare triple {8045#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [143] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8045#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:14:27,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {8045#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [144] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_397 v_main_~y~0_396)) (.cse2 (= v_main_~x~0_588 v_main_~x~0_587)) (.cse1 (<= 50 v_main_~x~0_588))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_588 100))) .cse2) (and .cse0 .cse2) (let ((.cse3 (+ v_main_~x~0_588 v_main_~y~0_396))) (and (< v_main_~y~0_397 v_main_~y~0_396) (= .cse3 (+ v_main_~x~0_587 v_main_~y~0_397)) (< .cse3 (+ 101 v_main_~y~0_397)) .cse1)))) InVars {main_~x~0=v_main_~x~0_588, main_~y~0=v_main_~y~0_397} OutVars{main_~x~0=v_main_~x~0_587, main_~y~0=v_main_~y~0_396} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {8046#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:14:27,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {8046#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} [141] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {8047#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:14:27,972 INFO L272 TraceCheckUtils]: 10: Hoare triple {8047#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {8048#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:14:27,972 INFO L290 TraceCheckUtils]: 11: Hoare triple {8048#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {8049#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:14:27,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {8049#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {8040#false} is VALID [2022-04-28 03:14:27,973 INFO L290 TraceCheckUtils]: 13: Hoare triple {8040#false} assume !false; {8040#false} is VALID [2022-04-28 03:14:27,973 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:27,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:14:27,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658225765] [2022-04-28 03:14:27,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658225765] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:14:27,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037149328] [2022-04-28 03:14:27,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:27,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:14:27,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:14:27,975 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:28,003 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:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:28,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:14:28,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:28,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:14:28,300 INFO L272 TraceCheckUtils]: 0: Hoare triple {8039#true} call ULTIMATE.init(); {8039#true} is VALID [2022-04-28 03:14:28,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {8039#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); {8039#true} is VALID [2022-04-28 03:14:28,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {8039#true} assume true; {8039#true} is VALID [2022-04-28 03:14:28,300 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8039#true} {8039#true} #56#return; {8039#true} is VALID [2022-04-28 03:14:28,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {8039#true} call #t~ret1 := main(); {8039#true} is VALID [2022-04-28 03:14:28,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {8039#true} ~x~0 := 0;~y~0 := 50; {8069#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:14:28,302 INFO L290 TraceCheckUtils]: 6: Hoare triple {8069#(and (<= main_~x~0 0) (= main_~y~0 50))} [142] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_586 v_main_~x~0_585))) (or (and (<= 50 v_main_~x~0_586) .cse0) .cse0 (and (< v_main_~x~0_586 v_main_~x~0_585) (< v_main_~x~0_585 51)))) InVars {main_~x~0=v_main_~x~0_586} OutVars{main_~x~0=v_main_~x~0_585} AuxVars[] AssignedVars[main_~x~0] {8073#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:14:28,302 INFO L290 TraceCheckUtils]: 7: Hoare triple {8073#(and (= main_~y~0 50) (< main_~x~0 51))} [143] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8073#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:14:28,303 INFO L290 TraceCheckUtils]: 8: Hoare triple {8073#(and (= main_~y~0 50) (< main_~x~0 51))} [144] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_397 v_main_~y~0_396)) (.cse2 (= v_main_~x~0_588 v_main_~x~0_587)) (.cse1 (<= 50 v_main_~x~0_588))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_588 100))) .cse2) (and .cse0 .cse2) (let ((.cse3 (+ v_main_~x~0_588 v_main_~y~0_396))) (and (< v_main_~y~0_397 v_main_~y~0_396) (= .cse3 (+ v_main_~x~0_587 v_main_~y~0_397)) (< .cse3 (+ 101 v_main_~y~0_397)) .cse1)))) InVars {main_~x~0=v_main_~x~0_588, main_~y~0=v_main_~y~0_397} OutVars{main_~x~0=v_main_~x~0_587, main_~y~0=v_main_~y~0_396} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {8080#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:14:28,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {8080#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [141] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {8047#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:14:28,304 INFO L272 TraceCheckUtils]: 10: Hoare triple {8047#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {8087#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:14:28,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {8087#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8091#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:14:28,305 INFO L290 TraceCheckUtils]: 12: Hoare triple {8091#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8040#false} is VALID [2022-04-28 03:14:28,305 INFO L290 TraceCheckUtils]: 13: Hoare triple {8040#false} assume !false; {8040#false} is VALID [2022-04-28 03:14:28,305 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:28,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:14:28,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {8040#false} assume !false; {8040#false} is VALID [2022-04-28 03:14:28,778 INFO L290 TraceCheckUtils]: 12: Hoare triple {8091#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8040#false} is VALID [2022-04-28 03:14:28,778 INFO L290 TraceCheckUtils]: 11: Hoare triple {8087#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8091#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:14:28,779 INFO L272 TraceCheckUtils]: 10: Hoare triple {8047#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {8087#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:14:28,779 INFO L290 TraceCheckUtils]: 9: Hoare triple {8110#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [141] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {8047#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:14:28,780 INFO L290 TraceCheckUtils]: 8: Hoare triple {8114#(and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [144] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_397 v_main_~y~0_396)) (.cse2 (= v_main_~x~0_588 v_main_~x~0_587)) (.cse1 (<= 50 v_main_~x~0_588))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_588 100))) .cse2) (and .cse0 .cse2) (let ((.cse3 (+ v_main_~x~0_588 v_main_~y~0_396))) (and (< v_main_~y~0_397 v_main_~y~0_396) (= .cse3 (+ v_main_~x~0_587 v_main_~y~0_397)) (< .cse3 (+ 101 v_main_~y~0_397)) .cse1)))) InVars {main_~x~0=v_main_~x~0_588, main_~y~0=v_main_~y~0_397} OutVars{main_~x~0=v_main_~x~0_587, main_~y~0=v_main_~y~0_396} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {8110#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:14:28,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {8114#(and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [143] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8114#(and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:14:28,782 INFO L290 TraceCheckUtils]: 6: Hoare triple {8121#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (<= 50 main_~y~0) (<= main_~y~0 100) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [142] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_586 v_main_~x~0_585))) (or (and (<= 50 v_main_~x~0_586) .cse0) .cse0 (and (< v_main_~x~0_586 v_main_~x~0_585) (< v_main_~x~0_585 51)))) InVars {main_~x~0=v_main_~x~0_586} OutVars{main_~x~0=v_main_~x~0_585} AuxVars[] AssignedVars[main_~x~0] {8114#(and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:14:28,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {8039#true} ~x~0 := 0;~y~0 := 50; {8121#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (<= 50 main_~y~0) (<= main_~y~0 100) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:14:28,783 INFO L272 TraceCheckUtils]: 4: Hoare triple {8039#true} call #t~ret1 := main(); {8039#true} is VALID [2022-04-28 03:14:28,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8039#true} {8039#true} #56#return; {8039#true} is VALID [2022-04-28 03:14:28,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {8039#true} assume true; {8039#true} is VALID [2022-04-28 03:14:28,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {8039#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); {8039#true} is VALID [2022-04-28 03:14:28,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {8039#true} call ULTIMATE.init(); {8039#true} is VALID [2022-04-28 03:14:28,784 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:28,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037149328] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:14:28,784 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:14:28,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:14:29,643 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:14:29,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1383243240] [2022-04-28 03:14:29,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1383243240] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:14:29,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:14:29,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-28 03:14:29,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361278103] [2022-04-28 03:14:29,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:14:29,644 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 27 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:14:29,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:14:29,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 27 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:14:29,687 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:14:29,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-28 03:14:29,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:29,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-28 03:14:29,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1324, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 03:14:29,689 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 27 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:14:32,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:32,195 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2022-04-28 03:14:32,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 03:14:32,196 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 27 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:14:32,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:14:32,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 27 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:14:32,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 71 transitions. [2022-04-28 03:14:32,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 27 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:14:32,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 71 transitions. [2022-04-28 03:14:32,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 71 transitions. [2022-04-28 03:14:32,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:14:32,273 INFO L225 Difference]: With dead ends: 66 [2022-04-28 03:14:32,273 INFO L226 Difference]: Without dead ends: 59 [2022-04-28 03:14:32,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=449, Invalid=3457, Unknown=0, NotChecked=0, Total=3906 [2022-04-28 03:14:32,275 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 31 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 1329 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:14:32,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 138 Invalid, 1357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1329 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 03:14:32,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-28 03:14:32,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-28 03:14:32,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:14:32,380 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 54 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call 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,380 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 54 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call 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,380 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 54 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call 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,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:32,381 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2022-04-28 03:14:32,381 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-04-28 03:14:32,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:32,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:32,381 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 54 states have internal predecessors, (57), 3 states have call successors, (3), 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 59 states. [2022-04-28 03:14:32,381 INFO L87 Difference]: Start difference. First operand has 59 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 54 states have internal predecessors, (57), 3 states have call successors, (3), 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 59 states. [2022-04-28 03:14:32,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:32,382 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2022-04-28 03:14:32,382 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-04-28 03:14:32,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:32,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:32,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:14:32,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:14:32,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 54 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call 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,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2022-04-28 03:14:32,384 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 55 [2022-04-28 03:14:32,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:14:32,384 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2022-04-28 03:14:32,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 27 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:14:32,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 61 transitions. [2022-04-28 03:14:32,444 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:14:32,444 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-04-28 03:14:32,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-28 03:14:32,445 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:14:32,445 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:14:32,472 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:32,645 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,SelfDestructingSolverStorable23 [2022-04-28 03:14:32,646 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:14:32,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:14:32,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1921526469, now seen corresponding path program 22 times [2022-04-28 03:14:32,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:32,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1897290945] [2022-04-28 03:14:36,707 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:14:36,757 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:14:36,969 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:14:36,970 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:14:36,972 INFO L85 PathProgramCache]: Analyzing trace with hash -948639796, now seen corresponding path program 1 times [2022-04-28 03:14:36,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:14:36,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498928619] [2022-04-28 03:14:36,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:36,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:14:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:37,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:14:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:37,078 INFO L290 TraceCheckUtils]: 0: Hoare triple {8590#(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); {8579#true} is VALID [2022-04-28 03:14:37,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-04-28 03:14:37,078 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8579#true} {8579#true} #56#return; {8579#true} is VALID [2022-04-28 03:14:37,079 INFO L272 TraceCheckUtils]: 0: Hoare triple {8579#true} call ULTIMATE.init(); {8590#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:14:37,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {8590#(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); {8579#true} is VALID [2022-04-28 03:14:37,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-04-28 03:14:37,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8579#true} {8579#true} #56#return; {8579#true} is VALID [2022-04-28 03:14:37,079 INFO L272 TraceCheckUtils]: 4: Hoare triple {8579#true} call #t~ret1 := main(); {8579#true} is VALID [2022-04-28 03:14:37,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {8579#true} ~x~0 := 0;~y~0 := 50; {8584#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:14:37,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {8584#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [146] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_625 v_main_~x~0_624))) (or (and (< v_main_~x~0_625 v_main_~x~0_624) (< v_main_~x~0_624 51)) (and (<= 50 v_main_~x~0_625) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_625} OutVars{main_~x~0=v_main_~x~0_624} AuxVars[] AssignedVars[main_~x~0] {8585#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:14:37,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {8585#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [147] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8585#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:14:37,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {8585#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [148] L28-2-->L27-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_627 v_main_~x~0_626)) (.cse2 (= v_main_~y~0_427 v_main_~y~0_426)) (.cse0 (<= 50 v_main_~x~0_627))) (or (and (or (not (< v_main_~x~0_627 100)) (not .cse0)) .cse1 .cse2) (and .cse1 .cse2) (and (< v_main_~x~0_626 101) (= (+ v_main_~x~0_626 v_main_~y~0_427) (+ v_main_~x~0_627 v_main_~y~0_426)) .cse0 (< v_main_~x~0_627 v_main_~x~0_626)))) InVars {main_~x~0=v_main_~x~0_627, main_~y~0=v_main_~y~0_427} OutVars{main_~x~0=v_main_~x~0_626, main_~y~0=v_main_~y~0_426} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {8586#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:14:37,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {8586#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} [145] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {8587#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:14:37,084 INFO L272 TraceCheckUtils]: 10: Hoare triple {8587#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {8588#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:14:37,085 INFO L290 TraceCheckUtils]: 11: Hoare triple {8588#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {8589#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:14:37,085 INFO L290 TraceCheckUtils]: 12: Hoare triple {8589#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {8580#false} is VALID [2022-04-28 03:14:37,085 INFO L290 TraceCheckUtils]: 13: Hoare triple {8580#false} assume !false; {8580#false} is VALID [2022-04-28 03:14:37,085 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:37,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:14:37,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498928619] [2022-04-28 03:14:37,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498928619] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:14:37,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100731696] [2022-04-28 03:14:37,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:37,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:14:37,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:14:37,087 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:37,088 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:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:37,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:14:37,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:37,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:14:37,405 INFO L272 TraceCheckUtils]: 0: Hoare triple {8579#true} call ULTIMATE.init(); {8579#true} is VALID [2022-04-28 03:14:37,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {8579#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); {8579#true} is VALID [2022-04-28 03:14:37,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-04-28 03:14:37,405 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8579#true} {8579#true} #56#return; {8579#true} is VALID [2022-04-28 03:14:37,406 INFO L272 TraceCheckUtils]: 4: Hoare triple {8579#true} call #t~ret1 := main(); {8579#true} is VALID [2022-04-28 03:14:37,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {8579#true} ~x~0 := 0;~y~0 := 50; {8609#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:14:37,406 INFO L290 TraceCheckUtils]: 6: Hoare triple {8609#(and (<= main_~x~0 0) (= main_~y~0 50))} [146] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_625 v_main_~x~0_624))) (or (and (< v_main_~x~0_625 v_main_~x~0_624) (< v_main_~x~0_624 51)) (and (<= 50 v_main_~x~0_625) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_625} OutVars{main_~x~0=v_main_~x~0_624} AuxVars[] AssignedVars[main_~x~0] {8613#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:14:37,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {8613#(and (= main_~y~0 50) (< main_~x~0 51))} [147] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8613#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:14:37,408 INFO L290 TraceCheckUtils]: 8: Hoare triple {8613#(and (= main_~y~0 50) (< main_~x~0 51))} [148] L28-2-->L27-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_627 v_main_~x~0_626)) (.cse2 (= v_main_~y~0_427 v_main_~y~0_426)) (.cse0 (<= 50 v_main_~x~0_627))) (or (and (or (not (< v_main_~x~0_627 100)) (not .cse0)) .cse1 .cse2) (and .cse1 .cse2) (and (< v_main_~x~0_626 101) (= (+ v_main_~x~0_626 v_main_~y~0_427) (+ v_main_~x~0_627 v_main_~y~0_426)) .cse0 (< v_main_~x~0_627 v_main_~x~0_626)))) InVars {main_~x~0=v_main_~x~0_627, main_~y~0=v_main_~y~0_427} OutVars{main_~x~0=v_main_~x~0_626, main_~y~0=v_main_~y~0_426} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {8620#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:14:37,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {8620#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [145] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {8587#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:14:37,413 INFO L272 TraceCheckUtils]: 10: Hoare triple {8587#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {8627#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:14:37,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {8627#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8631#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:14:37,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {8631#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8580#false} is VALID [2022-04-28 03:14:37,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {8580#false} assume !false; {8580#false} is VALID [2022-04-28 03:14:37,414 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:37,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:14:37,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {8580#false} assume !false; {8580#false} is VALID [2022-04-28 03:14:37,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {8631#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8580#false} is VALID [2022-04-28 03:14:37,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {8627#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8631#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:14:37,862 INFO L272 TraceCheckUtils]: 10: Hoare triple {8587#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {8627#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:14:37,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {8650#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [145] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {8587#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:14:37,863 INFO L290 TraceCheckUtils]: 8: Hoare triple {8654#(and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [148] L28-2-->L27-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_627 v_main_~x~0_626)) (.cse2 (= v_main_~y~0_427 v_main_~y~0_426)) (.cse0 (<= 50 v_main_~x~0_627))) (or (and (or (not (< v_main_~x~0_627 100)) (not .cse0)) .cse1 .cse2) (and .cse1 .cse2) (and (< v_main_~x~0_626 101) (= (+ v_main_~x~0_626 v_main_~y~0_427) (+ v_main_~x~0_627 v_main_~y~0_426)) .cse0 (< v_main_~x~0_627 v_main_~x~0_626)))) InVars {main_~x~0=v_main_~x~0_627, main_~y~0=v_main_~y~0_427} OutVars{main_~x~0=v_main_~x~0_626, main_~y~0=v_main_~y~0_426} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {8650#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:14:37,864 INFO L290 TraceCheckUtils]: 7: Hoare triple {8654#(and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [147] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8654#(and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:14:37,865 INFO L290 TraceCheckUtils]: 6: Hoare triple {8661#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (<= 50 main_~y~0) (<= main_~y~0 100) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [146] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_625 v_main_~x~0_624))) (or (and (< v_main_~x~0_625 v_main_~x~0_624) (< v_main_~x~0_624 51)) (and (<= 50 v_main_~x~0_625) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_625} OutVars{main_~x~0=v_main_~x~0_624} AuxVars[] AssignedVars[main_~x~0] {8654#(and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:14:37,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {8579#true} ~x~0 := 0;~y~0 := 50; {8661#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (<= 50 main_~y~0) (<= main_~y~0 100) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:14:37,865 INFO L272 TraceCheckUtils]: 4: Hoare triple {8579#true} call #t~ret1 := main(); {8579#true} is VALID [2022-04-28 03:14:37,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8579#true} {8579#true} #56#return; {8579#true} is VALID [2022-04-28 03:14:37,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-04-28 03:14:37,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {8579#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); {8579#true} is VALID [2022-04-28 03:14:37,866 INFO L272 TraceCheckUtils]: 0: Hoare triple {8579#true} call ULTIMATE.init(); {8579#true} is VALID [2022-04-28 03:14:37,866 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:37,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100731696] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:14:37,866 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:14:37,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:14:38,762 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:14:38,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1897290945] [2022-04-28 03:14:38,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1897290945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:14:38,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:14:38,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-28 03:14:38,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292093278] [2022-04-28 03:14:38,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:14:38,763 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 28 states have internal predecessors, (53), 2 states have call successors, (3), 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 57 [2022-04-28 03:14:38,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:14:38,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 28 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call 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:38,806 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:14:38,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-28 03:14:38,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:38,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-28 03:14:38,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1397, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 03:14:38,807 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 28 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call 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:41,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:41,586 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2022-04-28 03:14:41,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 03:14:41,587 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 28 states have internal predecessors, (53), 2 states have call successors, (3), 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 57 [2022-04-28 03:14:41,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:14:41,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 28 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call 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:41,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 73 transitions. [2022-04-28 03:14:41,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 28 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call 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:41,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 73 transitions. [2022-04-28 03:14:41,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 73 transitions. [2022-04-28 03:14:41,649 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:41,650 INFO L225 Difference]: With dead ends: 68 [2022-04-28 03:14:41,650 INFO L226 Difference]: Without dead ends: 61 [2022-04-28 03:14:41,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=465, Invalid=3695, Unknown=0, NotChecked=0, Total=4160 [2022-04-28 03:14:41,651 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 32 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 1485 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 1514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:14:41,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 148 Invalid, 1514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1485 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 03:14:41,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-28 03:14:41,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-28 03:14:41,733 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:14:41,733 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 56 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:14:41,733 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 56 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:14:41,733 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 56 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:14:41,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:41,734 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-04-28 03:14:41,735 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-04-28 03:14:41,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:41,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:41,735 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 56 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 61 states. [2022-04-28 03:14:41,735 INFO L87 Difference]: Start difference. First operand has 61 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 56 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 61 states. [2022-04-28 03:14:41,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:41,736 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-04-28 03:14:41,736 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-04-28 03:14:41,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:41,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:41,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:14:41,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:14:41,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 56 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:14:41,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2022-04-28 03:14:41,738 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 57 [2022-04-28 03:14:41,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:14:41,738 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2022-04-28 03:14:41,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 28 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call 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:41,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 63 transitions. [2022-04-28 03:14:41,811 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:14:41,811 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-04-28 03:14:41,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 03:14:41,811 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:14:41,811 INFO L195 NwaCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:14:41,835 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:42,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:14:42,026 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:14:42,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:14:42,027 INFO L85 PathProgramCache]: Analyzing trace with hash 820671712, now seen corresponding path program 23 times [2022-04-28 03:14:42,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:42,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1196111136] [2022-04-28 03:14:42,127 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:14:42,321 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:14:42,322 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:14:42,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1100892364, now seen corresponding path program 1 times [2022-04-28 03:14:42,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:14:42,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240810300] [2022-04-28 03:14:42,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:42,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:14:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:42,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:14:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:42,440 INFO L290 TraceCheckUtils]: 0: Hoare triple {9145#(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); {9134#true} is VALID [2022-04-28 03:14:42,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {9134#true} assume true; {9134#true} is VALID [2022-04-28 03:14:42,440 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9134#true} {9134#true} #56#return; {9134#true} is VALID [2022-04-28 03:14:42,441 INFO L272 TraceCheckUtils]: 0: Hoare triple {9134#true} call ULTIMATE.init(); {9145#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:14:42,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {9145#(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); {9134#true} is VALID [2022-04-28 03:14:42,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {9134#true} assume true; {9134#true} is VALID [2022-04-28 03:14:42,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9134#true} {9134#true} #56#return; {9134#true} is VALID [2022-04-28 03:14:42,441 INFO L272 TraceCheckUtils]: 4: Hoare triple {9134#true} call #t~ret1 := main(); {9134#true} is VALID [2022-04-28 03:14:42,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {9134#true} ~x~0 := 0;~y~0 := 50; {9139#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:14:42,442 INFO L290 TraceCheckUtils]: 6: Hoare triple {9139#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [150] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_665 v_main_~x~0_664))) (or .cse0 (and .cse0 (not (< v_main_~x~0_665 50))) (and (< v_main_~x~0_664 51) (< v_main_~x~0_665 v_main_~x~0_664)))) InVars {main_~x~0=v_main_~x~0_665} OutVars{main_~x~0=v_main_~x~0_664} AuxVars[] AssignedVars[main_~x~0] {9140#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:14:42,442 INFO L290 TraceCheckUtils]: 7: Hoare triple {9140#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [151] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9140#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:14:42,443 INFO L290 TraceCheckUtils]: 8: Hoare triple {9140#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [152] L28-2-->L27-2_primed: Formula: (let ((.cse1 (<= 50 v_main_~x~0_667)) (.cse0 (= v_main_~y~0_458 v_main_~y~0_457)) (.cse2 (= v_main_~x~0_667 v_main_~x~0_666))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_667 100))) .cse2) (and (< v_main_~x~0_666 101) (< v_main_~x~0_667 v_main_~x~0_666) (= (+ v_main_~x~0_666 v_main_~y~0_458) (+ v_main_~x~0_667 v_main_~y~0_457)) .cse1) (and .cse0 .cse2))) InVars {main_~x~0=v_main_~x~0_667, main_~y~0=v_main_~y~0_458} OutVars{main_~x~0=v_main_~x~0_666, main_~y~0=v_main_~y~0_457} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {9141#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:14:42,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {9141#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} [149] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {9142#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:14:42,444 INFO L272 TraceCheckUtils]: 10: Hoare triple {9142#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {9143#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:14:42,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {9143#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {9144#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:14:42,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {9144#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {9135#false} is VALID [2022-04-28 03:14:42,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {9135#false} assume !false; {9135#false} is VALID [2022-04-28 03:14:42,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:42,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:14:42,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240810300] [2022-04-28 03:14:42,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240810300] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:14:42,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930199132] [2022-04-28 03:14:42,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:42,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:14:42,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:14:42,447 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:42,447 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:42,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:42,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:14:42,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:42,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:14:42,752 INFO L272 TraceCheckUtils]: 0: Hoare triple {9134#true} call ULTIMATE.init(); {9134#true} is VALID [2022-04-28 03:14:42,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {9134#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); {9134#true} is VALID [2022-04-28 03:14:42,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {9134#true} assume true; {9134#true} is VALID [2022-04-28 03:14:42,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9134#true} {9134#true} #56#return; {9134#true} is VALID [2022-04-28 03:14:42,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {9134#true} call #t~ret1 := main(); {9134#true} is VALID [2022-04-28 03:14:42,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {9134#true} ~x~0 := 0;~y~0 := 50; {9164#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:14:42,753 INFO L290 TraceCheckUtils]: 6: Hoare triple {9164#(and (<= main_~x~0 0) (= main_~y~0 50))} [150] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_665 v_main_~x~0_664))) (or .cse0 (and .cse0 (not (< v_main_~x~0_665 50))) (and (< v_main_~x~0_664 51) (< v_main_~x~0_665 v_main_~x~0_664)))) InVars {main_~x~0=v_main_~x~0_665} OutVars{main_~x~0=v_main_~x~0_664} AuxVars[] AssignedVars[main_~x~0] {9168#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:14:42,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {9168#(and (= main_~y~0 50) (< main_~x~0 51))} [151] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9168#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:14:42,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {9168#(and (= main_~y~0 50) (< main_~x~0 51))} [152] L28-2-->L27-2_primed: Formula: (let ((.cse1 (<= 50 v_main_~x~0_667)) (.cse0 (= v_main_~y~0_458 v_main_~y~0_457)) (.cse2 (= v_main_~x~0_667 v_main_~x~0_666))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_667 100))) .cse2) (and (< v_main_~x~0_666 101) (< v_main_~x~0_667 v_main_~x~0_666) (= (+ v_main_~x~0_666 v_main_~y~0_458) (+ v_main_~x~0_667 v_main_~y~0_457)) .cse1) (and .cse0 .cse2))) InVars {main_~x~0=v_main_~x~0_667, main_~y~0=v_main_~y~0_458} OutVars{main_~x~0=v_main_~x~0_666, main_~y~0=v_main_~y~0_457} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {9175#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:14:42,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {9175#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [149] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {9142#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:14:42,756 INFO L272 TraceCheckUtils]: 10: Hoare triple {9142#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {9182#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:14:42,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {9182#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9186#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:14:42,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {9186#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9135#false} is VALID [2022-04-28 03:14:42,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {9135#false} assume !false; {9135#false} is VALID [2022-04-28 03:14:42,757 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,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:14:43,179 INFO L290 TraceCheckUtils]: 13: Hoare triple {9135#false} assume !false; {9135#false} is VALID [2022-04-28 03:14:43,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {9186#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9135#false} is VALID [2022-04-28 03:14:43,180 INFO L290 TraceCheckUtils]: 11: Hoare triple {9182#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9186#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:14:43,180 INFO L272 TraceCheckUtils]: 10: Hoare triple {9142#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {9182#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:14:43,181 INFO L290 TraceCheckUtils]: 9: Hoare triple {9205#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [149] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {9142#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:14:43,182 INFO L290 TraceCheckUtils]: 8: Hoare triple {9209#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [152] L28-2-->L27-2_primed: Formula: (let ((.cse1 (<= 50 v_main_~x~0_667)) (.cse0 (= v_main_~y~0_458 v_main_~y~0_457)) (.cse2 (= v_main_~x~0_667 v_main_~x~0_666))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_667 100))) .cse2) (and (< v_main_~x~0_666 101) (< v_main_~x~0_667 v_main_~x~0_666) (= (+ v_main_~x~0_666 v_main_~y~0_458) (+ v_main_~x~0_667 v_main_~y~0_457)) .cse1) (and .cse0 .cse2))) InVars {main_~x~0=v_main_~x~0_667, main_~y~0=v_main_~y~0_458} OutVars{main_~x~0=v_main_~x~0_666, main_~y~0=v_main_~y~0_457} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {9205#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:14:43,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {9209#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [151] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9209#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:14:43,183 INFO L290 TraceCheckUtils]: 6: Hoare triple {9216#(and (<= 50 main_~y~0) (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [150] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_665 v_main_~x~0_664))) (or .cse0 (and .cse0 (not (< v_main_~x~0_665 50))) (and (< v_main_~x~0_664 51) (< v_main_~x~0_665 v_main_~x~0_664)))) InVars {main_~x~0=v_main_~x~0_665} OutVars{main_~x~0=v_main_~x~0_664} AuxVars[] AssignedVars[main_~x~0] {9209#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:14:43,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {9134#true} ~x~0 := 0;~y~0 := 50; {9216#(and (<= 50 main_~y~0) (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:14:43,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {9134#true} call #t~ret1 := main(); {9134#true} is VALID [2022-04-28 03:14:43,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9134#true} {9134#true} #56#return; {9134#true} is VALID [2022-04-28 03:14:43,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {9134#true} assume true; {9134#true} is VALID [2022-04-28 03:14:43,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {9134#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); {9134#true} is VALID [2022-04-28 03:14:43,184 INFO L272 TraceCheckUtils]: 0: Hoare triple {9134#true} call ULTIMATE.init(); {9134#true} is VALID [2022-04-28 03:14:43,184 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:43,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930199132] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:14:43,184 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:14:43,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:14:44,188 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:14:44,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1196111136] [2022-04-28 03:14:44,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1196111136] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:14:44,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:14:44,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-28 03:14:44,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678661975] [2022-04-28 03:14:44,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:14:44,189 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 29 states have internal predecessors, (55), 2 states have call successors, (3), 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 59 [2022-04-28 03:14:44,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:14:44,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 29 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call 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:44,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:14:44,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-28 03:14:44,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:44,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-28 03:14:44,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1472, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 03:14:44,237 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand has 31 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 29 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call 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:47,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:47,220 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2022-04-28 03:14:47,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 03:14:47,221 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 29 states have internal predecessors, (55), 2 states have call successors, (3), 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 59 [2022-04-28 03:14:47,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:14:47,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 29 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call 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:47,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 75 transitions. [2022-04-28 03:14:47,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 29 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call 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:47,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 75 transitions. [2022-04-28 03:14:47,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 75 transitions. [2022-04-28 03:14:47,303 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:14:47,304 INFO L225 Difference]: With dead ends: 70 [2022-04-28 03:14:47,304 INFO L226 Difference]: Without dead ends: 63 [2022-04-28 03:14:47,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 984 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=481, Invalid=3941, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 03:14:47,305 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 33 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 1596 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 1626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:14:47,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 153 Invalid, 1626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1596 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-28 03:14:47,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-28 03:14:47,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-04-28 03:14:47,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:14:47,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 63 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call 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:47,416 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 63 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call 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:47,416 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 63 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call 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:47,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:47,417 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-04-28 03:14:47,417 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2022-04-28 03:14:47,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:47,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:47,417 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 3 states have call successors, (3), 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:14:47,418 INFO L87 Difference]: Start difference. First operand has 63 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 3 states have call successors, (3), 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:14:47,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:47,418 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-04-28 03:14:47,419 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2022-04-28 03:14:47,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:47,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:47,419 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:14:47,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:14:47,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call 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:47,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2022-04-28 03:14:47,420 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 59 [2022-04-28 03:14:47,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:14:47,420 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2022-04-28 03:14:47,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 29 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call 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:47,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 65 transitions. [2022-04-28 03:14:47,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:14:47,483 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2022-04-28 03:14:47,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-28 03:14:47,484 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:14:47,484 INFO L195 NwaCegarLoop]: trace histogram [25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:14:47,510 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:47,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:14:47,684 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:14:47,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:14:47,685 INFO L85 PathProgramCache]: Analyzing trace with hash -538794949, now seen corresponding path program 24 times [2022-04-28 03:14:47,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:47,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [69385427] [2022-04-28 03:14:51,748 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:14:51,802 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:14:52,209 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:14:52,210 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:14:52,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1144542772, now seen corresponding path program 1 times [2022-04-28 03:14:52,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:14:52,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397933248] [2022-04-28 03:14:52,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:52,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:14:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:52,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:14:52,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:52,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {9715#(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); {9704#true} is VALID [2022-04-28 03:14:52,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {9704#true} assume true; {9704#true} is VALID [2022-04-28 03:14:52,311 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9704#true} {9704#true} #56#return; {9704#true} is VALID [2022-04-28 03:14:52,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {9704#true} call ULTIMATE.init(); {9715#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:14:52,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {9715#(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); {9704#true} is VALID [2022-04-28 03:14:52,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {9704#true} assume true; {9704#true} is VALID [2022-04-28 03:14:52,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9704#true} {9704#true} #56#return; {9704#true} is VALID [2022-04-28 03:14:52,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {9704#true} call #t~ret1 := main(); {9704#true} is VALID [2022-04-28 03:14:52,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {9704#true} ~x~0 := 0;~y~0 := 50; {9709#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:14:52,312 INFO L290 TraceCheckUtils]: 6: Hoare triple {9709#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [154] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_706 v_main_~x~0_705))) (or (and (< v_main_~x~0_706 v_main_~x~0_705) (< v_main_~x~0_705 51)) .cse0 (and .cse0 (<= 50 v_main_~x~0_706)))) InVars {main_~x~0=v_main_~x~0_706} OutVars{main_~x~0=v_main_~x~0_705} AuxVars[] AssignedVars[main_~x~0] {9710#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:14:52,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {9710#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [155] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9710#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:14:52,314 INFO L290 TraceCheckUtils]: 8: Hoare triple {9710#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [156] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_708 v_main_~x~0_707)) (.cse1 (<= 50 v_main_~x~0_708))) (or (and .cse0 (= v_main_~y~0_489 v_main_~y~0_490) (or (not .cse1) (not (< v_main_~x~0_708 100)))) (and .cse0 (= v_main_~y~0_490 v_main_~y~0_489)) (let ((.cse2 (+ v_main_~x~0_708 v_main_~y~0_489))) (and (< v_main_~y~0_490 v_main_~y~0_489) (= .cse2 (+ v_main_~x~0_707 v_main_~y~0_490)) (< .cse2 (+ 101 v_main_~y~0_490)) .cse1)))) InVars {main_~x~0=v_main_~x~0_708, main_~y~0=v_main_~y~0_490} OutVars{main_~x~0=v_main_~x~0_707, main_~y~0=v_main_~y~0_489} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {9711#(or (and (or (< 99 main_~y~0) (<= main_~x~0 main_~y~0)) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:14:52,314 INFO L290 TraceCheckUtils]: 9: Hoare triple {9711#(or (and (or (< 99 main_~y~0) (<= main_~x~0 main_~y~0)) (<= main_~y~0 100)) (<= main_~x~0 50))} [153] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {9712#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:14:52,315 INFO L272 TraceCheckUtils]: 10: Hoare triple {9712#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {9713#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:14:52,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {9713#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {9714#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:14:52,315 INFO L290 TraceCheckUtils]: 12: Hoare triple {9714#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {9705#false} is VALID [2022-04-28 03:14:52,315 INFO L290 TraceCheckUtils]: 13: Hoare triple {9705#false} assume !false; {9705#false} is VALID [2022-04-28 03:14:52,316 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:52,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:14:52,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397933248] [2022-04-28 03:14:52,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397933248] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:14:52,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244494664] [2022-04-28 03:14:52,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:52,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:14:52,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:14:52,317 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:52,321 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:52,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:52,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:14:52,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:52,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:14:52,613 INFO L272 TraceCheckUtils]: 0: Hoare triple {9704#true} call ULTIMATE.init(); {9704#true} is VALID [2022-04-28 03:14:52,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {9704#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); {9704#true} is VALID [2022-04-28 03:14:52,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {9704#true} assume true; {9704#true} is VALID [2022-04-28 03:14:52,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9704#true} {9704#true} #56#return; {9704#true} is VALID [2022-04-28 03:14:52,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {9704#true} call #t~ret1 := main(); {9704#true} is VALID [2022-04-28 03:14:52,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {9704#true} ~x~0 := 0;~y~0 := 50; {9734#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:14:52,614 INFO L290 TraceCheckUtils]: 6: Hoare triple {9734#(and (<= main_~x~0 0) (= main_~y~0 50))} [154] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_706 v_main_~x~0_705))) (or (and (< v_main_~x~0_706 v_main_~x~0_705) (< v_main_~x~0_705 51)) .cse0 (and .cse0 (<= 50 v_main_~x~0_706)))) InVars {main_~x~0=v_main_~x~0_706} OutVars{main_~x~0=v_main_~x~0_705} AuxVars[] AssignedVars[main_~x~0] {9738#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:14:52,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {9738#(and (= main_~y~0 50) (< main_~x~0 51))} [155] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9738#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:14:52,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {9738#(and (= main_~y~0 50) (< main_~x~0 51))} [156] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_708 v_main_~x~0_707)) (.cse1 (<= 50 v_main_~x~0_708))) (or (and .cse0 (= v_main_~y~0_489 v_main_~y~0_490) (or (not .cse1) (not (< v_main_~x~0_708 100)))) (and .cse0 (= v_main_~y~0_490 v_main_~y~0_489)) (let ((.cse2 (+ v_main_~x~0_708 v_main_~y~0_489))) (and (< v_main_~y~0_490 v_main_~y~0_489) (= .cse2 (+ v_main_~x~0_707 v_main_~y~0_490)) (< .cse2 (+ 101 v_main_~y~0_490)) .cse1)))) InVars {main_~x~0=v_main_~x~0_708, main_~y~0=v_main_~y~0_490} OutVars{main_~x~0=v_main_~x~0_707, main_~y~0=v_main_~y~0_489} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {9745#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:14:52,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {9745#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [153] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {9712#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:14:52,617 INFO L272 TraceCheckUtils]: 10: Hoare triple {9712#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {9752#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:14:52,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {9752#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9756#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:14:52,618 INFO L290 TraceCheckUtils]: 12: Hoare triple {9756#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9705#false} is VALID [2022-04-28 03:14:52,618 INFO L290 TraceCheckUtils]: 13: Hoare triple {9705#false} assume !false; {9705#false} is VALID [2022-04-28 03:14:52,618 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:52,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:14:53,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {9705#false} assume !false; {9705#false} is VALID [2022-04-28 03:14:53,085 INFO L290 TraceCheckUtils]: 12: Hoare triple {9756#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9705#false} is VALID [2022-04-28 03:14:53,085 INFO L290 TraceCheckUtils]: 11: Hoare triple {9752#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9756#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:14:53,086 INFO L272 TraceCheckUtils]: 10: Hoare triple {9712#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {9752#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:14:53,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {9775#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [153] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {9712#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:14:53,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {9779#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [156] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_708 v_main_~x~0_707)) (.cse1 (<= 50 v_main_~x~0_708))) (or (and .cse0 (= v_main_~y~0_489 v_main_~y~0_490) (or (not .cse1) (not (< v_main_~x~0_708 100)))) (and .cse0 (= v_main_~y~0_490 v_main_~y~0_489)) (let ((.cse2 (+ v_main_~x~0_708 v_main_~y~0_489))) (and (< v_main_~y~0_490 v_main_~y~0_489) (= .cse2 (+ v_main_~x~0_707 v_main_~y~0_490)) (< .cse2 (+ 101 v_main_~y~0_490)) .cse1)))) InVars {main_~x~0=v_main_~x~0_708, main_~y~0=v_main_~y~0_490} OutVars{main_~x~0=v_main_~x~0_707, main_~y~0=v_main_~y~0_489} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {9775#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:14:53,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {9779#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [155] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9779#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:14:53,089 INFO L290 TraceCheckUtils]: 6: Hoare triple {9786#(and (<= 50 main_~y~0) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))) (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [154] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_706 v_main_~x~0_705))) (or (and (< v_main_~x~0_706 v_main_~x~0_705) (< v_main_~x~0_705 51)) .cse0 (and .cse0 (<= 50 v_main_~x~0_706)))) InVars {main_~x~0=v_main_~x~0_706} OutVars{main_~x~0=v_main_~x~0_705} AuxVars[] AssignedVars[main_~x~0] {9779#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:14:53,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {9704#true} ~x~0 := 0;~y~0 := 50; {9786#(and (<= 50 main_~y~0) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))) (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:14:53,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {9704#true} call #t~ret1 := main(); {9704#true} is VALID [2022-04-28 03:14:53,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9704#true} {9704#true} #56#return; {9704#true} is VALID [2022-04-28 03:14:53,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {9704#true} assume true; {9704#true} is VALID [2022-04-28 03:14:53,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {9704#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); {9704#true} is VALID [2022-04-28 03:14:53,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {9704#true} call ULTIMATE.init(); {9704#true} is VALID [2022-04-28 03:14:53,090 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:53,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244494664] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:14:53,090 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:14:53,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:14:54,117 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:14:54,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [69385427] [2022-04-28 03:14:54,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [69385427] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:14:54,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:14:54,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-28 03:14:54,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199686530] [2022-04-28 03:14:54,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:14:54,118 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 30 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:14:54,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:14:54,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 30 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:14:54,164 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:14:54,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-28 03:14:54,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:54,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-28 03:14:54,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=1549, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 03:14:54,165 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand has 32 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 30 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:14:57,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:57,333 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2022-04-28 03:14:57,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 03:14:57,333 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 30 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:14:57,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:14:57,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 30 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:14:57,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 77 transitions. [2022-04-28 03:14:57,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 30 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:14:57,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 77 transitions. [2022-04-28 03:14:57,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 77 transitions. [2022-04-28 03:14:57,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:14:57,408 INFO L225 Difference]: With dead ends: 72 [2022-04-28 03:14:57,408 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 03:14:57,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=497, Invalid=4195, Unknown=0, NotChecked=0, Total=4692 [2022-04-28 03:14:57,411 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 34 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 1711 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 1742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:14:57,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 158 Invalid, 1742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1711 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-28 03:14:57,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 03:14:57,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-28 03:14:57,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:14:57,506 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.05) internal successors, (63), 60 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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,506 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.05) internal successors, (63), 60 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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,506 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.05) internal successors, (63), 60 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:57,507 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2022-04-28 03:14:57,507 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2022-04-28 03:14:57,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:57,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:57,507 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 60 states have (on average 1.05) internal successors, (63), 60 states have internal predecessors, (63), 3 states have call successors, (3), 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:14:57,507 INFO L87 Difference]: Start difference. First operand has 65 states, 60 states have (on average 1.05) internal successors, (63), 60 states have internal predecessors, (63), 3 states have call successors, (3), 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:14:57,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:57,508 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2022-04-28 03:14:57,508 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2022-04-28 03:14:57,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:57,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:57,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:14:57,515 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:14:57,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.05) internal successors, (63), 60 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2022-04-28 03:14:57,517 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 61 [2022-04-28 03:14:57,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:14:57,517 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2022-04-28 03:14:57,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 30 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:14:57,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 67 transitions. [2022-04-28 03:14:57,586 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:57,586 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2022-04-28 03:14:57,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 03:14:57,587 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:14:57,587 INFO L195 NwaCegarLoop]: trace histogram [26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:14:57,614 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,787 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,SelfDestructingSolverStorable26 [2022-04-28 03:14:57,787 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:14:57,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:14:57,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1316198186, now seen corresponding path program 25 times [2022-04-28 03:14:57,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:57,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1744661097] [2022-04-28 03:15:01,310 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:15:01,352 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:15:04,084 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:15:04,192 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:15:04,193 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:15:04,195 INFO L85 PathProgramCache]: Analyzing trace with hash 904989388, now seen corresponding path program 1 times [2022-04-28 03:15:04,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:15:04,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503339672] [2022-04-28 03:15:04,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:15:04,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:15:04,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:04,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:15:04,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:04,307 INFO L290 TraceCheckUtils]: 0: Hoare triple {10300#(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); {10289#true} is VALID [2022-04-28 03:15:04,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {10289#true} assume true; {10289#true} is VALID [2022-04-28 03:15:04,307 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10289#true} {10289#true} #56#return; {10289#true} is VALID [2022-04-28 03:15:04,307 INFO L272 TraceCheckUtils]: 0: Hoare triple {10289#true} call ULTIMATE.init(); {10300#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:15:04,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {10300#(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); {10289#true} is VALID [2022-04-28 03:15:04,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {10289#true} assume true; {10289#true} is VALID [2022-04-28 03:15:04,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10289#true} {10289#true} #56#return; {10289#true} is VALID [2022-04-28 03:15:04,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {10289#true} call #t~ret1 := main(); {10289#true} is VALID [2022-04-28 03:15:04,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {10289#true} ~x~0 := 0;~y~0 := 50; {10294#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:15:04,309 INFO L290 TraceCheckUtils]: 6: Hoare triple {10294#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [158] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_748 v_main_~x~0_747))) (or (and (not (< v_main_~x~0_748 50)) .cse0) (and (< v_main_~x~0_748 v_main_~x~0_747) (< v_main_~x~0_747 51)) .cse0)) InVars {main_~x~0=v_main_~x~0_748} OutVars{main_~x~0=v_main_~x~0_747} AuxVars[] AssignedVars[main_~x~0] {10295#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:15:04,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {10295#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [159] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10295#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:15:04,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {10295#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [160] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_523 v_main_~y~0_522)) (.cse1 (<= 50 v_main_~x~0_750))) (or (and .cse0 (= v_main_~x~0_750 v_main_~x~0_749)) (and (< v_main_~x~0_749 101) (< v_main_~x~0_750 v_main_~x~0_749) (= (+ v_main_~x~0_749 v_main_~y~0_523) (+ v_main_~x~0_750 v_main_~y~0_522)) .cse1) (and .cse0 (or (not (< v_main_~x~0_750 100)) (not .cse1)) (= v_main_~x~0_749 v_main_~x~0_750)))) InVars {main_~x~0=v_main_~x~0_750, main_~y~0=v_main_~y~0_523} OutVars{main_~x~0=v_main_~x~0_749, main_~y~0=v_main_~y~0_522} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {10296#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:15:04,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {10296#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} [157] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {10297#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:15:04,312 INFO L272 TraceCheckUtils]: 10: Hoare triple {10297#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {10298#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:15:04,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {10298#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {10299#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:15:04,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {10299#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {10290#false} is VALID [2022-04-28 03:15:04,313 INFO L290 TraceCheckUtils]: 13: Hoare triple {10290#false} assume !false; {10290#false} is VALID [2022-04-28 03:15:04,313 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,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:15:04,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503339672] [2022-04-28 03:15:04,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503339672] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:15:04,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848954608] [2022-04-28 03:15:04,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:15:04,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:15:04,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:15:04,315 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:15:04,316 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:15:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:04,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:15:04,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:04,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:15:04,645 INFO L272 TraceCheckUtils]: 0: Hoare triple {10289#true} call ULTIMATE.init(); {10289#true} is VALID [2022-04-28 03:15:04,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {10289#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); {10289#true} is VALID [2022-04-28 03:15:04,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {10289#true} assume true; {10289#true} is VALID [2022-04-28 03:15:04,646 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10289#true} {10289#true} #56#return; {10289#true} is VALID [2022-04-28 03:15:04,646 INFO L272 TraceCheckUtils]: 4: Hoare triple {10289#true} call #t~ret1 := main(); {10289#true} is VALID [2022-04-28 03:15:04,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {10289#true} ~x~0 := 0;~y~0 := 50; {10319#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:15:04,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {10319#(and (<= main_~x~0 0) (= main_~y~0 50))} [158] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_748 v_main_~x~0_747))) (or (and (not (< v_main_~x~0_748 50)) .cse0) (and (< v_main_~x~0_748 v_main_~x~0_747) (< v_main_~x~0_747 51)) .cse0)) InVars {main_~x~0=v_main_~x~0_748} OutVars{main_~x~0=v_main_~x~0_747} AuxVars[] AssignedVars[main_~x~0] {10323#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:15:04,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {10323#(and (= main_~y~0 50) (< main_~x~0 51))} [159] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10323#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:15:04,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {10323#(and (= main_~y~0 50) (< main_~x~0 51))} [160] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_523 v_main_~y~0_522)) (.cse1 (<= 50 v_main_~x~0_750))) (or (and .cse0 (= v_main_~x~0_750 v_main_~x~0_749)) (and (< v_main_~x~0_749 101) (< v_main_~x~0_750 v_main_~x~0_749) (= (+ v_main_~x~0_749 v_main_~y~0_523) (+ v_main_~x~0_750 v_main_~y~0_522)) .cse1) (and .cse0 (or (not (< v_main_~x~0_750 100)) (not .cse1)) (= v_main_~x~0_749 v_main_~x~0_750)))) InVars {main_~x~0=v_main_~x~0_750, main_~y~0=v_main_~y~0_523} OutVars{main_~x~0=v_main_~x~0_749, main_~y~0=v_main_~y~0_522} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {10330#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:15:04,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {10330#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [157] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {10297#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:15:04,663 INFO L272 TraceCheckUtils]: 10: Hoare triple {10297#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {10337#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:15:04,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {10337#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10341#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:15:04,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {10341#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10290#false} is VALID [2022-04-28 03:15:04,664 INFO L290 TraceCheckUtils]: 13: Hoare triple {10290#false} assume !false; {10290#false} is VALID [2022-04-28 03:15:04,664 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,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:15:05,204 INFO L290 TraceCheckUtils]: 13: Hoare triple {10290#false} assume !false; {10290#false} is VALID [2022-04-28 03:15:05,205 INFO L290 TraceCheckUtils]: 12: Hoare triple {10341#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10290#false} is VALID [2022-04-28 03:15:05,205 INFO L290 TraceCheckUtils]: 11: Hoare triple {10337#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10341#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:15:05,206 INFO L272 TraceCheckUtils]: 10: Hoare triple {10297#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {10337#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:15:05,206 INFO L290 TraceCheckUtils]: 9: Hoare triple {10360#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [157] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {10297#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:15:05,208 INFO L290 TraceCheckUtils]: 8: Hoare triple {10364#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [160] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_523 v_main_~y~0_522)) (.cse1 (<= 50 v_main_~x~0_750))) (or (and .cse0 (= v_main_~x~0_750 v_main_~x~0_749)) (and (< v_main_~x~0_749 101) (< v_main_~x~0_750 v_main_~x~0_749) (= (+ v_main_~x~0_749 v_main_~y~0_523) (+ v_main_~x~0_750 v_main_~y~0_522)) .cse1) (and .cse0 (or (not (< v_main_~x~0_750 100)) (not .cse1)) (= v_main_~x~0_749 v_main_~x~0_750)))) InVars {main_~x~0=v_main_~x~0_750, main_~y~0=v_main_~y~0_523} OutVars{main_~x~0=v_main_~x~0_749, main_~y~0=v_main_~y~0_522} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {10360#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:15:05,208 INFO L290 TraceCheckUtils]: 7: Hoare triple {10364#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [159] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10364#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:15:05,209 INFO L290 TraceCheckUtils]: 6: Hoare triple {10371#(and (<= 50 main_~y~0) (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [158] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_748 v_main_~x~0_747))) (or (and (not (< v_main_~x~0_748 50)) .cse0) (and (< v_main_~x~0_748 v_main_~x~0_747) (< v_main_~x~0_747 51)) .cse0)) InVars {main_~x~0=v_main_~x~0_748} OutVars{main_~x~0=v_main_~x~0_747} AuxVars[] AssignedVars[main_~x~0] {10364#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:15:05,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {10289#true} ~x~0 := 0;~y~0 := 50; {10371#(and (<= 50 main_~y~0) (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:15:05,210 INFO L272 TraceCheckUtils]: 4: Hoare triple {10289#true} call #t~ret1 := main(); {10289#true} is VALID [2022-04-28 03:15:05,210 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10289#true} {10289#true} #56#return; {10289#true} is VALID [2022-04-28 03:15:05,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {10289#true} assume true; {10289#true} is VALID [2022-04-28 03:15:05,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {10289#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); {10289#true} is VALID [2022-04-28 03:15:05,210 INFO L272 TraceCheckUtils]: 0: Hoare triple {10289#true} call ULTIMATE.init(); {10289#true} is VALID [2022-04-28 03:15:05,211 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:05,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848954608] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:15:05,211 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:15:05,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:15:06,305 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:15:06,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1744661097] [2022-04-28 03:15:06,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1744661097] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:15:06,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:15:06,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-28 03:15:06,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146059101] [2022-04-28 03:15:06,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:15:06,306 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.84375) internal successors, (59), 31 states have internal predecessors, (59), 2 states have call successors, (3), 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 63 [2022-04-28 03:15:06,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:15:06,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 32 states have (on average 1.84375) internal successors, (59), 31 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call 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:06,361 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:15:06,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-28 03:15:06,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:15:06,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-28 03:15:06,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1628, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 03:15:06,362 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 31 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call 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,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:09,837 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2022-04-28 03:15:09,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 03:15:09,837 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.84375) internal successors, (59), 31 states have internal predecessors, (59), 2 states have call successors, (3), 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 63 [2022-04-28 03:15:09,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:15:09,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 31 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call 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,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 79 transitions. [2022-04-28 03:15:09,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 31 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call 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,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 79 transitions. [2022-04-28 03:15:09,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 79 transitions. [2022-04-28 03:15:09,933 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:15:09,934 INFO L225 Difference]: With dead ends: 74 [2022-04-28 03:15:09,934 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 03:15:09,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1083 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=513, Invalid=4457, Unknown=0, NotChecked=0, Total=4970 [2022-04-28 03:15:09,935 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 35 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 1830 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 1862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:15:09,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 163 Invalid, 1862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1830 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-28 03:15:09,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 03:15:10,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-28 03:15:10,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:15:10,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 67 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 62 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:15:10,053 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 67 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 62 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:15:10,053 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 67 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 62 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:15:10,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:10,054 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2022-04-28 03:15:10,054 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2022-04-28 03:15:10,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:15:10,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:15:10,055 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 62 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 67 states. [2022-04-28 03:15:10,055 INFO L87 Difference]: Start difference. First operand has 67 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 62 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 67 states. [2022-04-28 03:15:10,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:10,056 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2022-04-28 03:15:10,056 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2022-04-28 03:15:10,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:15:10,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:15:10,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:15:10,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:15:10,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 62 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:15:10,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2022-04-28 03:15:10,057 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 63 [2022-04-28 03:15:10,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:15:10,058 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2022-04-28 03:15:10,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.84375) internal successors, (59), 31 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call 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:10,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 69 transitions. [2022-04-28 03:15:10,127 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:15:10,128 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2022-04-28 03:15:10,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 03:15:10,128 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:15:10,128 INFO L195 NwaCegarLoop]: trace histogram [27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:15:10,156 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:10,329 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,SelfDestructingSolverStorable27 [2022-04-28 03:15:10,329 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:15:10,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:15:10,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1076399439, now seen corresponding path program 26 times [2022-04-28 03:15:10,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:15:10,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1946374597] [2022-04-28 03:15:14,408 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:15:14,451 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:15:14,665 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:15:14,666 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:15:14,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1340445748, now seen corresponding path program 1 times [2022-04-28 03:15:14,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:15:14,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867630891] [2022-04-28 03:15:14,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:15:14,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:15:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:14,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:15:14,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:14,769 INFO L290 TraceCheckUtils]: 0: Hoare triple {10900#(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); {10889#true} is VALID [2022-04-28 03:15:14,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {10889#true} assume true; {10889#true} is VALID [2022-04-28 03:15:14,770 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10889#true} {10889#true} #56#return; {10889#true} is VALID [2022-04-28 03:15:14,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {10889#true} call ULTIMATE.init(); {10900#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:15:14,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {10900#(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); {10889#true} is VALID [2022-04-28 03:15:14,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {10889#true} assume true; {10889#true} is VALID [2022-04-28 03:15:14,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10889#true} {10889#true} #56#return; {10889#true} is VALID [2022-04-28 03:15:14,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {10889#true} call #t~ret1 := main(); {10889#true} is VALID [2022-04-28 03:15:14,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {10889#true} ~x~0 := 0;~y~0 := 50; {10894#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:15:14,771 INFO L290 TraceCheckUtils]: 6: Hoare triple {10894#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [162] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_791 v_main_~x~0_790))) (or (and (not (< v_main_~x~0_791 50)) .cse0) (and (< v_main_~x~0_791 v_main_~x~0_790) (< v_main_~x~0_790 51)) .cse0)) InVars {main_~x~0=v_main_~x~0_791} OutVars{main_~x~0=v_main_~x~0_790} AuxVars[] AssignedVars[main_~x~0] {10895#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:15:14,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {10895#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [163] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10895#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:15:14,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {10895#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [164] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_793 v_main_~x~0_792)) (.cse1 (= v_main_~y~0_557 v_main_~y~0_556)) (.cse2 (<= 50 v_main_~x~0_793))) (or (and .cse0 .cse1) (and (< v_main_~x~0_793 v_main_~x~0_792) .cse2 (< v_main_~x~0_792 101) (= (+ v_main_~x~0_792 v_main_~y~0_557) (+ v_main_~x~0_793 v_main_~y~0_556))) (and .cse0 .cse1 (or (not (< v_main_~x~0_793 100)) (not .cse2))))) InVars {main_~x~0=v_main_~x~0_793, main_~y~0=v_main_~y~0_557} OutVars{main_~x~0=v_main_~x~0_792, main_~y~0=v_main_~y~0_556} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {10896#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:15:14,773 INFO L290 TraceCheckUtils]: 9: Hoare triple {10896#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} [161] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {10897#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:15:14,774 INFO L272 TraceCheckUtils]: 10: Hoare triple {10897#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {10898#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:15:14,774 INFO L290 TraceCheckUtils]: 11: Hoare triple {10898#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {10899#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:15:14,775 INFO L290 TraceCheckUtils]: 12: Hoare triple {10899#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {10890#false} is VALID [2022-04-28 03:15:14,775 INFO L290 TraceCheckUtils]: 13: Hoare triple {10890#false} assume !false; {10890#false} is VALID [2022-04-28 03:15:14,775 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:14,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:15:14,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867630891] [2022-04-28 03:15:14,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867630891] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:15:14,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825165873] [2022-04-28 03:15:14,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:15:14,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:15:14,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:15:14,776 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:14,777 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:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:14,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:15:14,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:14,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:15:15,067 INFO L272 TraceCheckUtils]: 0: Hoare triple {10889#true} call ULTIMATE.init(); {10889#true} is VALID [2022-04-28 03:15:15,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {10889#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); {10889#true} is VALID [2022-04-28 03:15:15,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {10889#true} assume true; {10889#true} is VALID [2022-04-28 03:15:15,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10889#true} {10889#true} #56#return; {10889#true} is VALID [2022-04-28 03:15:15,067 INFO L272 TraceCheckUtils]: 4: Hoare triple {10889#true} call #t~ret1 := main(); {10889#true} is VALID [2022-04-28 03:15:15,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {10889#true} ~x~0 := 0;~y~0 := 50; {10919#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:15:15,068 INFO L290 TraceCheckUtils]: 6: Hoare triple {10919#(and (<= main_~x~0 0) (= main_~y~0 50))} [162] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_791 v_main_~x~0_790))) (or (and (not (< v_main_~x~0_791 50)) .cse0) (and (< v_main_~x~0_791 v_main_~x~0_790) (< v_main_~x~0_790 51)) .cse0)) InVars {main_~x~0=v_main_~x~0_791} OutVars{main_~x~0=v_main_~x~0_790} AuxVars[] AssignedVars[main_~x~0] {10923#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:15:15,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {10923#(and (= main_~y~0 50) (< main_~x~0 51))} [163] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10923#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:15:15,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {10923#(and (= main_~y~0 50) (< main_~x~0 51))} [164] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_793 v_main_~x~0_792)) (.cse1 (= v_main_~y~0_557 v_main_~y~0_556)) (.cse2 (<= 50 v_main_~x~0_793))) (or (and .cse0 .cse1) (and (< v_main_~x~0_793 v_main_~x~0_792) .cse2 (< v_main_~x~0_792 101) (= (+ v_main_~x~0_792 v_main_~y~0_557) (+ v_main_~x~0_793 v_main_~y~0_556))) (and .cse0 .cse1 (or (not (< v_main_~x~0_793 100)) (not .cse2))))) InVars {main_~x~0=v_main_~x~0_793, main_~y~0=v_main_~y~0_557} OutVars{main_~x~0=v_main_~x~0_792, main_~y~0=v_main_~y~0_556} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {10930#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:15:15,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {10930#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [161] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {10897#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:15:15,070 INFO L272 TraceCheckUtils]: 10: Hoare triple {10897#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {10937#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:15:15,071 INFO L290 TraceCheckUtils]: 11: Hoare triple {10937#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10941#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:15:15,071 INFO L290 TraceCheckUtils]: 12: Hoare triple {10941#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10890#false} is VALID [2022-04-28 03:15:15,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {10890#false} assume !false; {10890#false} is VALID [2022-04-28 03:15:15,071 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:15,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:15:15,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {10890#false} assume !false; {10890#false} is VALID [2022-04-28 03:15:15,496 INFO L290 TraceCheckUtils]: 12: Hoare triple {10941#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10890#false} is VALID [2022-04-28 03:15:15,496 INFO L290 TraceCheckUtils]: 11: Hoare triple {10937#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10941#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:15:15,497 INFO L272 TraceCheckUtils]: 10: Hoare triple {10897#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {10937#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:15:15,497 INFO L290 TraceCheckUtils]: 9: Hoare triple {10960#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [161] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {10897#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:15:15,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {10964#(and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [164] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_793 v_main_~x~0_792)) (.cse1 (= v_main_~y~0_557 v_main_~y~0_556)) (.cse2 (<= 50 v_main_~x~0_793))) (or (and .cse0 .cse1) (and (< v_main_~x~0_793 v_main_~x~0_792) .cse2 (< v_main_~x~0_792 101) (= (+ v_main_~x~0_792 v_main_~y~0_557) (+ v_main_~x~0_793 v_main_~y~0_556))) (and .cse0 .cse1 (or (not (< v_main_~x~0_793 100)) (not .cse2))))) InVars {main_~x~0=v_main_~x~0_793, main_~y~0=v_main_~y~0_557} OutVars{main_~x~0=v_main_~x~0_792, main_~y~0=v_main_~y~0_556} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {10960#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:15:15,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {10964#(and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [163] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10964#(and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:15:15,500 INFO L290 TraceCheckUtils]: 6: Hoare triple {10971#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (<= 50 main_~y~0) (<= main_~y~0 100) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [162] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_791 v_main_~x~0_790))) (or (and (not (< v_main_~x~0_791 50)) .cse0) (and (< v_main_~x~0_791 v_main_~x~0_790) (< v_main_~x~0_790 51)) .cse0)) InVars {main_~x~0=v_main_~x~0_791} OutVars{main_~x~0=v_main_~x~0_790} AuxVars[] AssignedVars[main_~x~0] {10964#(and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:15:15,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {10889#true} ~x~0 := 0;~y~0 := 50; {10971#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (<= 50 main_~y~0) (<= main_~y~0 100) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:15:15,500 INFO L272 TraceCheckUtils]: 4: Hoare triple {10889#true} call #t~ret1 := main(); {10889#true} is VALID [2022-04-28 03:15:15,500 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10889#true} {10889#true} #56#return; {10889#true} is VALID [2022-04-28 03:15:15,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {10889#true} assume true; {10889#true} is VALID [2022-04-28 03:15:15,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {10889#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); {10889#true} is VALID [2022-04-28 03:15:15,500 INFO L272 TraceCheckUtils]: 0: Hoare triple {10889#true} call ULTIMATE.init(); {10889#true} is VALID [2022-04-28 03:15:15,501 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:15,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825165873] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:15:15,501 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:15:15,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:15:16,598 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:15:16,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1946374597] [2022-04-28 03:15:16,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1946374597] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:15:16,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:15:16,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-28 03:15:16,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567775831] [2022-04-28 03:15:16,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:15:16,599 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 32 states have internal predecessors, (61), 2 states have call successors, (3), 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 65 [2022-04-28 03:15:16,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:15:16,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 32 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call 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,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:15:16,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-28 03:15:16,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:15:16,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-28 03:15:16,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=1709, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 03:15:16,656 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand has 34 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 32 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call 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:20,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:20,256 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2022-04-28 03:15:20,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 03:15:20,257 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 32 states have internal predecessors, (61), 2 states have call successors, (3), 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 65 [2022-04-28 03:15:20,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:15:20,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 32 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call 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:20,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 81 transitions. [2022-04-28 03:15:20,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 32 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call 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:20,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 81 transitions. [2022-04-28 03:15:20,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 81 transitions. [2022-04-28 03:15:20,343 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:15:20,344 INFO L225 Difference]: With dead ends: 76 [2022-04-28 03:15:20,345 INFO L226 Difference]: Without dead ends: 69 [2022-04-28 03:15:20,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1134 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=529, Invalid=4727, Unknown=0, NotChecked=0, Total=5256 [2022-04-28 03:15:20,346 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 36 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 1953 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 1986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:15:20,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 168 Invalid, 1986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1953 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-28 03:15:20,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-28 03:15:20,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-04-28 03:15:20,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:15:20,475 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 69 states, 64 states have (on average 1.046875) internal successors, (67), 64 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call 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:20,475 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 69 states, 64 states have (on average 1.046875) internal successors, (67), 64 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call 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:20,475 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 69 states, 64 states have (on average 1.046875) internal successors, (67), 64 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call 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:20,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:20,476 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2022-04-28 03:15:20,476 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2022-04-28 03:15:20,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:15:20,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:15:20,477 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 64 states have (on average 1.046875) internal successors, (67), 64 states have internal predecessors, (67), 3 states have call successors, (3), 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:15:20,477 INFO L87 Difference]: Start difference. First operand has 69 states, 64 states have (on average 1.046875) internal successors, (67), 64 states have internal predecessors, (67), 3 states have call successors, (3), 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:15:20,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:20,478 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2022-04-28 03:15:20,478 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2022-04-28 03:15:20,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:15:20,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:15:20,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:15:20,479 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:15:20,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.046875) internal successors, (67), 64 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call 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:20,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2022-04-28 03:15:20,480 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 65 [2022-04-28 03:15:20,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:15:20,481 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2022-04-28 03:15:20,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 32 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call 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:20,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 71 transitions. [2022-04-28 03:15:20,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:15:20,549 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2022-04-28 03:15:20,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-28 03:15:20,550 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:15:20,550 INFO L195 NwaCegarLoop]: trace histogram [28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:15:20,577 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:20,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-28 03:15:20,751 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:15:20,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:15:20,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1736929740, now seen corresponding path program 27 times [2022-04-28 03:15:20,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:15:20,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [141489740] [2022-04-28 03:15:20,851 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:15:21,066 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:15:21,068 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:15:21,070 INFO L85 PathProgramCache]: Analyzing trace with hash 709086412, now seen corresponding path program 1 times [2022-04-28 03:15:21,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:15:21,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814327970] [2022-04-28 03:15:21,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:15:21,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:15:21,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:21,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:15:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:21,166 INFO L290 TraceCheckUtils]: 0: Hoare triple {11515#(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); {11504#true} is VALID [2022-04-28 03:15:21,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {11504#true} assume true; {11504#true} is VALID [2022-04-28 03:15:21,166 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11504#true} {11504#true} #56#return; {11504#true} is VALID [2022-04-28 03:15:21,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {11504#true} call ULTIMATE.init(); {11515#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:15:21,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {11515#(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); {11504#true} is VALID [2022-04-28 03:15:21,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {11504#true} assume true; {11504#true} is VALID [2022-04-28 03:15:21,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11504#true} {11504#true} #56#return; {11504#true} is VALID [2022-04-28 03:15:21,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {11504#true} call #t~ret1 := main(); {11504#true} is VALID [2022-04-28 03:15:21,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {11504#true} ~x~0 := 0;~y~0 := 50; {11509#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:15:21,168 INFO L290 TraceCheckUtils]: 6: Hoare triple {11509#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [166] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_835 v_main_~x~0_834))) (or .cse0 (and (< v_main_~x~0_835 v_main_~x~0_834) (< v_main_~x~0_834 51)) (and .cse0 (<= 50 v_main_~x~0_835)))) InVars {main_~x~0=v_main_~x~0_835} OutVars{main_~x~0=v_main_~x~0_834} AuxVars[] AssignedVars[main_~x~0] {11510#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:15:21,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {11510#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [167] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11510#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:15:21,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {11510#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [168] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_592 v_main_~y~0_591)) (.cse1 (= v_main_~x~0_837 v_main_~x~0_836)) (.cse2 (<= 50 v_main_~x~0_837))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_837 100)) (not .cse2))) (and .cse0 .cse1) (and (< v_main_~x~0_837 v_main_~x~0_836) (< v_main_~x~0_836 101) (= (+ v_main_~x~0_837 v_main_~y~0_591) (+ v_main_~x~0_836 v_main_~y~0_592)) .cse2))) InVars {main_~x~0=v_main_~x~0_837, main_~y~0=v_main_~y~0_592} OutVars{main_~x~0=v_main_~x~0_836, main_~y~0=v_main_~y~0_591} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {11511#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:15:21,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {11511#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} [165] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {11512#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:15:21,170 INFO L272 TraceCheckUtils]: 10: Hoare triple {11512#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {11513#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:15:21,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {11513#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {11514#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:15:21,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {11514#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {11505#false} is VALID [2022-04-28 03:15:21,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {11505#false} assume !false; {11505#false} is VALID [2022-04-28 03:15:21,171 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:21,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:15:21,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814327970] [2022-04-28 03:15:21,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814327970] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:15:21,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346193448] [2022-04-28 03:15:21,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:15:21,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:15:21,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:15:21,173 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:21,174 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:21,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:21,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:15:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:21,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:15:21,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {11504#true} call ULTIMATE.init(); {11504#true} is VALID [2022-04-28 03:15:21,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {11504#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); {11504#true} is VALID [2022-04-28 03:15:21,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {11504#true} assume true; {11504#true} is VALID [2022-04-28 03:15:21,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11504#true} {11504#true} #56#return; {11504#true} is VALID [2022-04-28 03:15:21,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {11504#true} call #t~ret1 := main(); {11504#true} is VALID [2022-04-28 03:15:21,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {11504#true} ~x~0 := 0;~y~0 := 50; {11534#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:15:21,470 INFO L290 TraceCheckUtils]: 6: Hoare triple {11534#(and (<= main_~x~0 0) (= main_~y~0 50))} [166] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_835 v_main_~x~0_834))) (or .cse0 (and (< v_main_~x~0_835 v_main_~x~0_834) (< v_main_~x~0_834 51)) (and .cse0 (<= 50 v_main_~x~0_835)))) InVars {main_~x~0=v_main_~x~0_835} OutVars{main_~x~0=v_main_~x~0_834} AuxVars[] AssignedVars[main_~x~0] {11538#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:15:21,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {11538#(and (= main_~y~0 50) (< main_~x~0 51))} [167] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11538#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:15:21,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {11538#(and (= main_~y~0 50) (< main_~x~0 51))} [168] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_592 v_main_~y~0_591)) (.cse1 (= v_main_~x~0_837 v_main_~x~0_836)) (.cse2 (<= 50 v_main_~x~0_837))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_837 100)) (not .cse2))) (and .cse0 .cse1) (and (< v_main_~x~0_837 v_main_~x~0_836) (< v_main_~x~0_836 101) (= (+ v_main_~x~0_837 v_main_~y~0_591) (+ v_main_~x~0_836 v_main_~y~0_592)) .cse2))) InVars {main_~x~0=v_main_~x~0_837, main_~y~0=v_main_~y~0_592} OutVars{main_~x~0=v_main_~x~0_836, main_~y~0=v_main_~y~0_591} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {11545#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:15:21,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {11545#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [165] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {11512#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:15:21,473 INFO L272 TraceCheckUtils]: 10: Hoare triple {11512#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {11552#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:15:21,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {11552#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11556#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:15:21,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {11556#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11505#false} is VALID [2022-04-28 03:15:21,473 INFO L290 TraceCheckUtils]: 13: Hoare triple {11505#false} assume !false; {11505#false} is VALID [2022-04-28 03:15:21,474 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:21,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:15:21,900 INFO L290 TraceCheckUtils]: 13: Hoare triple {11505#false} assume !false; {11505#false} is VALID [2022-04-28 03:15:21,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {11556#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11505#false} is VALID [2022-04-28 03:15:21,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {11552#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11556#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:15:21,901 INFO L272 TraceCheckUtils]: 10: Hoare triple {11512#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {11552#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:15:21,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {11575#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [165] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {11512#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:15:21,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {11579#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (< main_~x~0 (+ main_~y~0 1)) (not (<= 50 main_~x~0)) (<= 99 main_~y~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [168] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_592 v_main_~y~0_591)) (.cse1 (= v_main_~x~0_837 v_main_~x~0_836)) (.cse2 (<= 50 v_main_~x~0_837))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_837 100)) (not .cse2))) (and .cse0 .cse1) (and (< v_main_~x~0_837 v_main_~x~0_836) (< v_main_~x~0_836 101) (= (+ v_main_~x~0_837 v_main_~y~0_591) (+ v_main_~x~0_836 v_main_~y~0_592)) .cse2))) InVars {main_~x~0=v_main_~x~0_837, main_~y~0=v_main_~y~0_592} OutVars{main_~x~0=v_main_~x~0_836, main_~y~0=v_main_~y~0_591} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {11575#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:15:21,903 INFO L290 TraceCheckUtils]: 7: Hoare triple {11579#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (< main_~x~0 (+ main_~y~0 1)) (not (<= 50 main_~x~0)) (<= 99 main_~y~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [167] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11579#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (< main_~x~0 (+ main_~y~0 1)) (not (<= 50 main_~x~0)) (<= 99 main_~y~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:15:21,904 INFO L290 TraceCheckUtils]: 6: Hoare triple {11586#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (<= 50 main_~y~0) (<= main_~y~0 100) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [166] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_835 v_main_~x~0_834))) (or .cse0 (and (< v_main_~x~0_835 v_main_~x~0_834) (< v_main_~x~0_834 51)) (and .cse0 (<= 50 v_main_~x~0_835)))) InVars {main_~x~0=v_main_~x~0_835} OutVars{main_~x~0=v_main_~x~0_834} AuxVars[] AssignedVars[main_~x~0] {11579#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (< main_~x~0 (+ main_~y~0 1)) (not (<= 50 main_~x~0)) (<= 99 main_~y~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:15:21,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {11504#true} ~x~0 := 0;~y~0 := 50; {11586#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (<= 50 main_~y~0) (<= main_~y~0 100) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:15:21,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {11504#true} call #t~ret1 := main(); {11504#true} is VALID [2022-04-28 03:15:21,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11504#true} {11504#true} #56#return; {11504#true} is VALID [2022-04-28 03:15:21,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {11504#true} assume true; {11504#true} is VALID [2022-04-28 03:15:21,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {11504#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); {11504#true} is VALID [2022-04-28 03:15:21,905 INFO L272 TraceCheckUtils]: 0: Hoare triple {11504#true} call ULTIMATE.init(); {11504#true} is VALID [2022-04-28 03:15:21,905 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:21,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346193448] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:15:21,905 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:15:21,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:15:23,063 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:15:23,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [141489740] [2022-04-28 03:15:23,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [141489740] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:15:23,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:15:23,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-28 03:15:23,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352439079] [2022-04-28 03:15:23,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:15:23,064 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 33 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:15:23,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:15:23,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 33 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:15:23,117 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:15:23,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-28 03:15:23,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:15:23,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-28 03:15:23,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=1792, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 03:15:23,118 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 33 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:15:26,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:26,959 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2022-04-28 03:15:26,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 03:15:26,959 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 33 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:15:26,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:15:26,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 33 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:15:26,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 83 transitions. [2022-04-28 03:15:26,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 33 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:15:26,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 83 transitions. [2022-04-28 03:15:26,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 83 transitions. [2022-04-28 03:15:27,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:15:27,056 INFO L225 Difference]: With dead ends: 78 [2022-04-28 03:15:27,056 INFO L226 Difference]: Without dead ends: 71 [2022-04-28 03:15:27,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1186 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=545, Invalid=5005, Unknown=0, NotChecked=0, Total=5550 [2022-04-28 03:15:27,057 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 37 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 2080 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 2114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 2080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:15:27,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 173 Invalid, 2114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 2080 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-28 03:15:27,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-28 03:15:27,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-28 03:15:27,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:15:27,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 66 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call 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:27,184 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 66 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call 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:27,184 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 66 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call 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:27,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:27,186 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2022-04-28 03:15:27,186 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2022-04-28 03:15:27,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:15:27,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:15:27,186 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 66 states have internal predecessors, (69), 3 states have call successors, (3), 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 71 states. [2022-04-28 03:15:27,186 INFO L87 Difference]: Start difference. First operand has 71 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 66 states have internal predecessors, (69), 3 states have call successors, (3), 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 71 states. [2022-04-28 03:15:27,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:27,187 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2022-04-28 03:15:27,188 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2022-04-28 03:15:27,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:15:27,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:15:27,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:15:27,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:15:27,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 66 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call 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:27,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2022-04-28 03:15:27,189 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 67 [2022-04-28 03:15:27,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:15:27,190 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2022-04-28 03:15:27,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 33 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:15:27,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 73 transitions. [2022-04-28 03:15:27,265 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:15:27,265 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2022-04-28 03:15:27,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 03:15:27,265 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:15:27,265 INFO L195 NwaCegarLoop]: trace histogram [29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:15:27,292 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:27,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:15:27,466 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:15:27,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:15:27,466 INFO L85 PathProgramCache]: Analyzing trace with hash -483125721, now seen corresponding path program 28 times [2022-04-28 03:15:27,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:15:27,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1488109989] [2022-04-28 03:15:27,553 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:15:27,762 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:15:27,763 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:15:27,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1536348724, now seen corresponding path program 1 times [2022-04-28 03:15:27,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:15:27,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696746873] [2022-04-28 03:15:27,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:15:27,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:15:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:27,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:15:27,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:27,855 INFO L290 TraceCheckUtils]: 0: Hoare triple {12145#(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); {12134#true} is VALID [2022-04-28 03:15:27,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {12134#true} assume true; {12134#true} is VALID [2022-04-28 03:15:27,855 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12134#true} {12134#true} #56#return; {12134#true} is VALID [2022-04-28 03:15:27,856 INFO L272 TraceCheckUtils]: 0: Hoare triple {12134#true} call ULTIMATE.init(); {12145#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:15:27,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {12145#(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); {12134#true} is VALID [2022-04-28 03:15:27,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {12134#true} assume true; {12134#true} is VALID [2022-04-28 03:15:27,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12134#true} {12134#true} #56#return; {12134#true} is VALID [2022-04-28 03:15:27,856 INFO L272 TraceCheckUtils]: 4: Hoare triple {12134#true} call #t~ret1 := main(); {12134#true} is VALID [2022-04-28 03:15:27,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {12134#true} ~x~0 := 0;~y~0 := 50; {12139#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:15:27,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {12139#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [170] L28-2-->L27-2_primed: Formula: (or (and (< v_main_~x~0_879 51) (< v_main_~x~0_880 v_main_~x~0_879)) (and (= v_main_~x~0_879 v_main_~x~0_880) (<= 50 v_main_~x~0_880)) (= v_main_~x~0_880 v_main_~x~0_879)) InVars {main_~x~0=v_main_~x~0_880} OutVars{main_~x~0=v_main_~x~0_879} AuxVars[] AssignedVars[main_~x~0] {12140#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:15:27,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {12140#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [171] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12140#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:15:27,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {12140#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [172] L28-2-->L27-2_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_882)) (.cse1 (= v_main_~x~0_882 v_main_~x~0_881)) (.cse2 (= v_main_~y~0_628 v_main_~y~0_627))) (or (and (< v_main_~x~0_881 101) (< v_main_~x~0_882 v_main_~x~0_881) (= (+ v_main_~x~0_881 v_main_~y~0_628) (+ v_main_~x~0_882 v_main_~y~0_627)) .cse0) (and .cse1 (or (not (< v_main_~x~0_882 100)) (not .cse0)) .cse2) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_882, main_~y~0=v_main_~y~0_628} OutVars{main_~x~0=v_main_~x~0_881, main_~y~0=v_main_~y~0_627} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {12141#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:15:27,859 INFO L290 TraceCheckUtils]: 9: Hoare triple {12141#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} [169] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {12142#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:15:27,860 INFO L272 TraceCheckUtils]: 10: Hoare triple {12142#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {12143#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:15:27,860 INFO L290 TraceCheckUtils]: 11: Hoare triple {12143#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {12144#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:15:27,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {12144#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {12135#false} is VALID [2022-04-28 03:15:27,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {12135#false} assume !false; {12135#false} is VALID [2022-04-28 03:15:27,860 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:27,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:15:27,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696746873] [2022-04-28 03:15:27,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696746873] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:15:27,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848633555] [2022-04-28 03:15:27,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:15:27,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:15:27,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:15:27,864 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:27,864 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:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:27,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:15:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:27,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:15:28,180 INFO L272 TraceCheckUtils]: 0: Hoare triple {12134#true} call ULTIMATE.init(); {12134#true} is VALID [2022-04-28 03:15:28,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {12134#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); {12134#true} is VALID [2022-04-28 03:15:28,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {12134#true} assume true; {12134#true} is VALID [2022-04-28 03:15:28,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12134#true} {12134#true} #56#return; {12134#true} is VALID [2022-04-28 03:15:28,183 INFO L272 TraceCheckUtils]: 4: Hoare triple {12134#true} call #t~ret1 := main(); {12134#true} is VALID [2022-04-28 03:15:28,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {12134#true} ~x~0 := 0;~y~0 := 50; {12164#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:15:28,185 INFO L290 TraceCheckUtils]: 6: Hoare triple {12164#(and (<= main_~x~0 0) (= main_~y~0 50))} [170] L28-2-->L27-2_primed: Formula: (or (and (< v_main_~x~0_879 51) (< v_main_~x~0_880 v_main_~x~0_879)) (and (= v_main_~x~0_879 v_main_~x~0_880) (<= 50 v_main_~x~0_880)) (= v_main_~x~0_880 v_main_~x~0_879)) InVars {main_~x~0=v_main_~x~0_880} OutVars{main_~x~0=v_main_~x~0_879} AuxVars[] AssignedVars[main_~x~0] {12168#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:15:28,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {12168#(and (= main_~y~0 50) (< main_~x~0 51))} [171] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12168#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:15:28,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {12168#(and (= main_~y~0 50) (< main_~x~0 51))} [172] L28-2-->L27-2_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_882)) (.cse1 (= v_main_~x~0_882 v_main_~x~0_881)) (.cse2 (= v_main_~y~0_628 v_main_~y~0_627))) (or (and (< v_main_~x~0_881 101) (< v_main_~x~0_882 v_main_~x~0_881) (= (+ v_main_~x~0_881 v_main_~y~0_628) (+ v_main_~x~0_882 v_main_~y~0_627)) .cse0) (and .cse1 (or (not (< v_main_~x~0_882 100)) (not .cse0)) .cse2) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_882, main_~y~0=v_main_~y~0_628} OutVars{main_~x~0=v_main_~x~0_881, main_~y~0=v_main_~y~0_627} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {12175#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:15:28,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {12175#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [169] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {12142#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:15:28,187 INFO L272 TraceCheckUtils]: 10: Hoare triple {12142#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {12182#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:15:28,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {12182#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12186#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:15:28,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {12186#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12135#false} is VALID [2022-04-28 03:15:28,188 INFO L290 TraceCheckUtils]: 13: Hoare triple {12135#false} assume !false; {12135#false} is VALID [2022-04-28 03:15:28,188 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:28,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:15:28,629 INFO L290 TraceCheckUtils]: 13: Hoare triple {12135#false} assume !false; {12135#false} is VALID [2022-04-28 03:15:28,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {12186#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12135#false} is VALID [2022-04-28 03:15:28,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {12182#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12186#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:15:28,631 INFO L272 TraceCheckUtils]: 10: Hoare triple {12142#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {12182#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:15:28,631 INFO L290 TraceCheckUtils]: 9: Hoare triple {12205#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [169] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {12142#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:15:28,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {12209#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [172] L28-2-->L27-2_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_882)) (.cse1 (= v_main_~x~0_882 v_main_~x~0_881)) (.cse2 (= v_main_~y~0_628 v_main_~y~0_627))) (or (and (< v_main_~x~0_881 101) (< v_main_~x~0_882 v_main_~x~0_881) (= (+ v_main_~x~0_881 v_main_~y~0_628) (+ v_main_~x~0_882 v_main_~y~0_627)) .cse0) (and .cse1 (or (not (< v_main_~x~0_882 100)) (not .cse0)) .cse2) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_882, main_~y~0=v_main_~y~0_628} OutVars{main_~x~0=v_main_~x~0_881, main_~y~0=v_main_~y~0_627} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {12205#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:15:28,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {12209#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [171] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12209#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:15:28,634 INFO L290 TraceCheckUtils]: 6: Hoare triple {12216#(and (<= 50 main_~y~0) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [170] L28-2-->L27-2_primed: Formula: (or (and (< v_main_~x~0_879 51) (< v_main_~x~0_880 v_main_~x~0_879)) (and (= v_main_~x~0_879 v_main_~x~0_880) (<= 50 v_main_~x~0_880)) (= v_main_~x~0_880 v_main_~x~0_879)) InVars {main_~x~0=v_main_~x~0_880} OutVars{main_~x~0=v_main_~x~0_879} AuxVars[] AssignedVars[main_~x~0] {12209#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:15:28,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {12134#true} ~x~0 := 0;~y~0 := 50; {12216#(and (<= 50 main_~y~0) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:15:28,634 INFO L272 TraceCheckUtils]: 4: Hoare triple {12134#true} call #t~ret1 := main(); {12134#true} is VALID [2022-04-28 03:15:28,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12134#true} {12134#true} #56#return; {12134#true} is VALID [2022-04-28 03:15:28,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {12134#true} assume true; {12134#true} is VALID [2022-04-28 03:15:28,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {12134#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); {12134#true} is VALID [2022-04-28 03:15:28,635 INFO L272 TraceCheckUtils]: 0: Hoare triple {12134#true} call ULTIMATE.init(); {12134#true} is VALID [2022-04-28 03:15:28,635 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:28,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848633555] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:15:28,635 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:15:28,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:15:29,917 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:15:29,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1488109989] [2022-04-28 03:15:29,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1488109989] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:15:29,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:15:29,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-28 03:15:29,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513160422] [2022-04-28 03:15:29,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:15:29,918 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 34 states have internal predecessors, (65), 2 states have call successors, (3), 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 69 [2022-04-28 03:15:29,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:15:29,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 34 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call 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:29,984 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:15:29,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-28 03:15:29,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:15:29,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-28 03:15:29,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=1877, Unknown=0, NotChecked=0, Total=2162 [2022-04-28 03:15:29,985 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand has 36 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 34 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call 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:34,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:34,018 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2022-04-28 03:15:34,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-28 03:15:34,018 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 34 states have internal predecessors, (65), 2 states have call successors, (3), 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 69 [2022-04-28 03:15:34,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:15:34,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 34 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call 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:34,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 85 transitions. [2022-04-28 03:15:34,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 34 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call 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:34,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 85 transitions. [2022-04-28 03:15:34,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 85 transitions. [2022-04-28 03:15:34,091 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:15:34,092 INFO L225 Difference]: With dead ends: 80 [2022-04-28 03:15:34,092 INFO L226 Difference]: Without dead ends: 73 [2022-04-28 03:15:34,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1239 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=561, Invalid=5291, Unknown=0, NotChecked=0, Total=5852 [2022-04-28 03:15:34,094 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 38 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 2148 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 2183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:15:34,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 173 Invalid, 2183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2148 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-28 03:15:34,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-28 03:15:34,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-04-28 03:15:34,199 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:15:34,199 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 73 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 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:15:34,199 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 73 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 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:15:34,199 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 73 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 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:15:34,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:34,200 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2022-04-28 03:15:34,200 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2022-04-28 03:15:34,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:15:34,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:15:34,200 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 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 73 states. [2022-04-28 03:15:34,200 INFO L87 Difference]: Start difference. First operand has 73 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 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 73 states. [2022-04-28 03:15:34,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:34,201 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2022-04-28 03:15:34,201 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2022-04-28 03:15:34,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:15:34,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:15:34,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:15:34,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:15:34,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 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:15:34,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2022-04-28 03:15:34,202 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 69 [2022-04-28 03:15:34,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:15:34,203 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2022-04-28 03:15:34,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 34 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call 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:34,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 75 transitions. [2022-04-28 03:15:34,272 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:15:34,272 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2022-04-28 03:15:34,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-28 03:15:34,272 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:15:34,272 INFO L195 NwaCegarLoop]: trace histogram [30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:15:34,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-28 03:15:34,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:15:34,496 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:15:34,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:15:34,496 INFO L85 PathProgramCache]: Analyzing trace with hash 642322370, now seen corresponding path program 29 times [2022-04-28 03:15:34,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:15:34,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [499657546] [2022-04-28 03:15:34,581 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:15:34,816 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:15:34,817 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:15:34,819 INFO L85 PathProgramCache]: Analyzing trace with hash 513183436, now seen corresponding path program 1 times [2022-04-28 03:15:34,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:15:34,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864474610] [2022-04-28 03:15:34,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:15:34,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:15:34,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:34,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:15:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:34,920 INFO L290 TraceCheckUtils]: 0: Hoare triple {12790#(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); {12779#true} is VALID [2022-04-28 03:15:34,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {12779#true} assume true; {12779#true} is VALID [2022-04-28 03:15:34,920 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12779#true} {12779#true} #56#return; {12779#true} is VALID [2022-04-28 03:15:34,921 INFO L272 TraceCheckUtils]: 0: Hoare triple {12779#true} call ULTIMATE.init(); {12790#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:15:34,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {12790#(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); {12779#true} is VALID [2022-04-28 03:15:34,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {12779#true} assume true; {12779#true} is VALID [2022-04-28 03:15:34,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12779#true} {12779#true} #56#return; {12779#true} is VALID [2022-04-28 03:15:34,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {12779#true} call #t~ret1 := main(); {12779#true} is VALID [2022-04-28 03:15:34,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {12779#true} ~x~0 := 0;~y~0 := 50; {12784#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:15:34,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {12784#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [174] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_926 v_main_~x~0_925))) (or (and (< v_main_~x~0_926 v_main_~x~0_925) (< v_main_~x~0_925 51)) .cse0 (and (<= 50 v_main_~x~0_926) .cse0))) InVars {main_~x~0=v_main_~x~0_926} OutVars{main_~x~0=v_main_~x~0_925} AuxVars[] AssignedVars[main_~x~0] {12785#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:15:34,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {12785#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [175] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12785#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:15:34,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {12785#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [176] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_928 v_main_~x~0_927)) (.cse1 (<= 50 v_main_~x~0_928))) (or (and .cse0 (= v_main_~y~0_664 v_main_~y~0_665) (or (not .cse1) (not (< v_main_~x~0_928 100)))) (and (= v_main_~y~0_665 v_main_~y~0_664) .cse0) (let ((.cse2 (+ v_main_~x~0_928 v_main_~y~0_664))) (and .cse1 (= .cse2 (+ v_main_~x~0_927 v_main_~y~0_665)) (< .cse2 (+ 101 v_main_~y~0_665)) (< v_main_~y~0_665 v_main_~y~0_664))))) InVars {main_~x~0=v_main_~x~0_928, main_~y~0=v_main_~y~0_665} OutVars{main_~x~0=v_main_~x~0_927, main_~y~0=v_main_~y~0_664} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {12786#(or (and (or (< 99 main_~y~0) (<= main_~x~0 main_~y~0)) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:15:34,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {12786#(or (and (or (< 99 main_~y~0) (<= main_~x~0 main_~y~0)) (<= main_~y~0 100)) (<= main_~x~0 50))} [173] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {12787#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:15:34,924 INFO L272 TraceCheckUtils]: 10: Hoare triple {12787#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {12788#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:15:34,925 INFO L290 TraceCheckUtils]: 11: Hoare triple {12788#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {12789#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:15:34,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {12789#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {12780#false} is VALID [2022-04-28 03:15:34,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {12780#false} assume !false; {12780#false} is VALID [2022-04-28 03:15:34,925 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,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:15:34,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864474610] [2022-04-28 03:15:34,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864474610] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:15:34,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869731594] [2022-04-28 03:15:34,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:15:34,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:15:34,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:15:34,927 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:34,927 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:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:34,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:15:34,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:34,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:15:35,226 INFO L272 TraceCheckUtils]: 0: Hoare triple {12779#true} call ULTIMATE.init(); {12779#true} is VALID [2022-04-28 03:15:35,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {12779#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); {12779#true} is VALID [2022-04-28 03:15:35,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {12779#true} assume true; {12779#true} is VALID [2022-04-28 03:15:35,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12779#true} {12779#true} #56#return; {12779#true} is VALID [2022-04-28 03:15:35,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {12779#true} call #t~ret1 := main(); {12779#true} is VALID [2022-04-28 03:15:35,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {12779#true} ~x~0 := 0;~y~0 := 50; {12809#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:15:35,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {12809#(and (<= main_~x~0 0) (= main_~y~0 50))} [174] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_926 v_main_~x~0_925))) (or (and (< v_main_~x~0_926 v_main_~x~0_925) (< v_main_~x~0_925 51)) .cse0 (and (<= 50 v_main_~x~0_926) .cse0))) InVars {main_~x~0=v_main_~x~0_926} OutVars{main_~x~0=v_main_~x~0_925} AuxVars[] AssignedVars[main_~x~0] {12813#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:15:35,228 INFO L290 TraceCheckUtils]: 7: Hoare triple {12813#(and (= main_~y~0 50) (< main_~x~0 51))} [175] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12813#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:15:35,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {12813#(and (= main_~y~0 50) (< main_~x~0 51))} [176] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_928 v_main_~x~0_927)) (.cse1 (<= 50 v_main_~x~0_928))) (or (and .cse0 (= v_main_~y~0_664 v_main_~y~0_665) (or (not .cse1) (not (< v_main_~x~0_928 100)))) (and (= v_main_~y~0_665 v_main_~y~0_664) .cse0) (let ((.cse2 (+ v_main_~x~0_928 v_main_~y~0_664))) (and .cse1 (= .cse2 (+ v_main_~x~0_927 v_main_~y~0_665)) (< .cse2 (+ 101 v_main_~y~0_665)) (< v_main_~y~0_665 v_main_~y~0_664))))) InVars {main_~x~0=v_main_~x~0_928, main_~y~0=v_main_~y~0_665} OutVars{main_~x~0=v_main_~x~0_927, main_~y~0=v_main_~y~0_664} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {12820#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:15:35,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {12820#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [173] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {12787#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:15:35,230 INFO L272 TraceCheckUtils]: 10: Hoare triple {12787#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {12827#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:15:35,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {12827#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12831#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:15:35,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {12831#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12780#false} is VALID [2022-04-28 03:15:35,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {12780#false} assume !false; {12780#false} is VALID [2022-04-28 03:15:35,231 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:35,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:15:35,711 INFO L290 TraceCheckUtils]: 13: Hoare triple {12780#false} assume !false; {12780#false} is VALID [2022-04-28 03:15:35,711 INFO L290 TraceCheckUtils]: 12: Hoare triple {12831#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12780#false} is VALID [2022-04-28 03:15:35,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {12827#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12831#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:15:35,712 INFO L272 TraceCheckUtils]: 10: Hoare triple {12787#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {12827#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:15:35,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {12850#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [173] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {12787#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:15:35,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {12854#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [176] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_928 v_main_~x~0_927)) (.cse1 (<= 50 v_main_~x~0_928))) (or (and .cse0 (= v_main_~y~0_664 v_main_~y~0_665) (or (not .cse1) (not (< v_main_~x~0_928 100)))) (and (= v_main_~y~0_665 v_main_~y~0_664) .cse0) (let ((.cse2 (+ v_main_~x~0_928 v_main_~y~0_664))) (and .cse1 (= .cse2 (+ v_main_~x~0_927 v_main_~y~0_665)) (< .cse2 (+ 101 v_main_~y~0_665)) (< v_main_~y~0_665 v_main_~y~0_664))))) InVars {main_~x~0=v_main_~x~0_928, main_~y~0=v_main_~y~0_665} OutVars{main_~x~0=v_main_~x~0_927, main_~y~0=v_main_~y~0_664} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {12850#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:15:35,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {12854#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [175] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12854#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:15:35,715 INFO L290 TraceCheckUtils]: 6: Hoare triple {12861#(and (<= 50 main_~y~0) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))) (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [174] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_926 v_main_~x~0_925))) (or (and (< v_main_~x~0_926 v_main_~x~0_925) (< v_main_~x~0_925 51)) .cse0 (and (<= 50 v_main_~x~0_926) .cse0))) InVars {main_~x~0=v_main_~x~0_926} OutVars{main_~x~0=v_main_~x~0_925} AuxVars[] AssignedVars[main_~x~0] {12854#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:15:35,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {12779#true} ~x~0 := 0;~y~0 := 50; {12861#(and (<= 50 main_~y~0) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))) (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:15:35,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {12779#true} call #t~ret1 := main(); {12779#true} is VALID [2022-04-28 03:15:35,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12779#true} {12779#true} #56#return; {12779#true} is VALID [2022-04-28 03:15:35,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {12779#true} assume true; {12779#true} is VALID [2022-04-28 03:15:35,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {12779#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); {12779#true} is VALID [2022-04-28 03:15:35,716 INFO L272 TraceCheckUtils]: 0: Hoare triple {12779#true} call ULTIMATE.init(); {12779#true} is VALID [2022-04-28 03:15:35,716 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:35,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869731594] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:15:35,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:15:35,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:15:36,997 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:15:36,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [499657546] [2022-04-28 03:15:36,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [499657546] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:15:36,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:15:36,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-28 03:15:36,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598705193] [2022-04-28 03:15:36,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:15:36,998 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 35 states have internal predecessors, (67), 2 states have call successors, (3), 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 71 [2022-04-28 03:15:36,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:15:36,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 35 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call 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:37,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:15:37,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-28 03:15:37,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:15:37,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-28 03:15:37,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=1964, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 03:15:37,058 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand has 37 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 35 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call 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:41,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:41,469 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2022-04-28 03:15:41,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-28 03:15:41,470 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 35 states have internal predecessors, (67), 2 states have call successors, (3), 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 71 [2022-04-28 03:15:41,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:15:41,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 35 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call 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:41,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 87 transitions. [2022-04-28 03:15:41,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 35 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call 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:41,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 87 transitions. [2022-04-28 03:15:41,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 87 transitions. [2022-04-28 03:15:41,559 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:15:41,560 INFO L225 Difference]: With dead ends: 82 [2022-04-28 03:15:41,560 INFO L226 Difference]: Without dead ends: 75 [2022-04-28 03:15:41,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1293 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=577, Invalid=5585, Unknown=0, NotChecked=0, Total=6162 [2022-04-28 03:15:41,561 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 39 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 2346 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 2382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:15:41,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 183 Invalid, 2382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2346 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-28 03:15:41,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-28 03:15:41,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-04-28 03:15:41,672 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:15:41,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 75 states, 70 states have (on average 1.042857142857143) internal successors, (73), 70 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call 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:41,673 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 75 states, 70 states have (on average 1.042857142857143) internal successors, (73), 70 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call 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:41,673 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 75 states, 70 states have (on average 1.042857142857143) internal successors, (73), 70 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call 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:41,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:41,674 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2022-04-28 03:15:41,674 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2022-04-28 03:15:41,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:15:41,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:15:41,674 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 70 states have (on average 1.042857142857143) internal successors, (73), 70 states have internal predecessors, (73), 3 states have call successors, (3), 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:15:41,674 INFO L87 Difference]: Start difference. First operand has 75 states, 70 states have (on average 1.042857142857143) internal successors, (73), 70 states have internal predecessors, (73), 3 states have call successors, (3), 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:15:41,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:41,675 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2022-04-28 03:15:41,675 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2022-04-28 03:15:41,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:15:41,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:15:41,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:15:41,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:15:41,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.042857142857143) internal successors, (73), 70 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call 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:41,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2022-04-28 03:15:41,676 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 71 [2022-04-28 03:15:41,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:15:41,676 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2022-04-28 03:15:41,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 35 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call 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:41,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 77 transitions. [2022-04-28 03:15:41,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:15:41,737 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2022-04-28 03:15:41,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 03:15:41,738 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:15:41,738 INFO L195 NwaCegarLoop]: trace histogram [31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:15:41,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-28 03:15:41,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:15:41,951 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:15:41,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:15:41,952 INFO L85 PathProgramCache]: Analyzing trace with hash -133820771, now seen corresponding path program 30 times [2022-04-28 03:15:41,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:15:41,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [146743448] [2022-04-28 03:15:42,040 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:15:42,257 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:15:42,258 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:15:42,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1732251700, now seen corresponding path program 1 times [2022-04-28 03:15:42,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:15:42,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486146718] [2022-04-28 03:15:42,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:15:42,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:15:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:42,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:15:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:42,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {13450#(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); {13439#true} is VALID [2022-04-28 03:15:42,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {13439#true} assume true; {13439#true} is VALID [2022-04-28 03:15:42,356 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13439#true} {13439#true} #56#return; {13439#true} is VALID [2022-04-28 03:15:42,357 INFO L272 TraceCheckUtils]: 0: Hoare triple {13439#true} call ULTIMATE.init(); {13450#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:15:42,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {13450#(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); {13439#true} is VALID [2022-04-28 03:15:42,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {13439#true} assume true; {13439#true} is VALID [2022-04-28 03:15:42,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13439#true} {13439#true} #56#return; {13439#true} is VALID [2022-04-28 03:15:42,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {13439#true} call #t~ret1 := main(); {13439#true} is VALID [2022-04-28 03:15:42,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {13439#true} ~x~0 := 0;~y~0 := 50; {13444#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:15:42,359 INFO L290 TraceCheckUtils]: 6: Hoare triple {13444#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [178] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_973 v_main_~x~0_972))) (or .cse0 (and (< v_main_~x~0_973 v_main_~x~0_972) (< v_main_~x~0_972 51)) (and .cse0 (not (< v_main_~x~0_973 50))))) InVars {main_~x~0=v_main_~x~0_973} OutVars{main_~x~0=v_main_~x~0_972} AuxVars[] AssignedVars[main_~x~0] {13445#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:15:42,359 INFO L290 TraceCheckUtils]: 7: Hoare triple {13445#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [179] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13445#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:15:42,360 INFO L290 TraceCheckUtils]: 8: Hoare triple {13445#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [180] L28-2-->L27-2_primed: Formula: (let ((.cse2 (<= 50 v_main_~x~0_975)) (.cse0 (= v_main_~x~0_975 v_main_~x~0_974)) (.cse1 (= v_main_~y~0_703 v_main_~y~0_702))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_975 100)) (not .cse2))) (let ((.cse3 (+ v_main_~x~0_975 v_main_~y~0_702))) (and (< .cse3 (+ 101 v_main_~y~0_703)) .cse2 (< v_main_~y~0_703 v_main_~y~0_702) (= (+ v_main_~x~0_974 v_main_~y~0_703) .cse3))) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_975, main_~y~0=v_main_~y~0_703} OutVars{main_~x~0=v_main_~x~0_974, main_~y~0=v_main_~y~0_702} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {13446#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:15:42,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {13446#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} [177] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {13447#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:15:42,361 INFO L272 TraceCheckUtils]: 10: Hoare triple {13447#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {13448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:15:42,362 INFO L290 TraceCheckUtils]: 11: Hoare triple {13448#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {13449#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:15:42,362 INFO L290 TraceCheckUtils]: 12: Hoare triple {13449#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {13440#false} is VALID [2022-04-28 03:15:42,362 INFO L290 TraceCheckUtils]: 13: Hoare triple {13440#false} assume !false; {13440#false} is VALID [2022-04-28 03:15:42,362 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:42,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:15:42,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486146718] [2022-04-28 03:15:42,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486146718] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:15:42,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031720646] [2022-04-28 03:15:42,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:15:42,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:15:42,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:15:42,364 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:42,364 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:42,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:42,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:15:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:42,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:15:42,688 INFO L272 TraceCheckUtils]: 0: Hoare triple {13439#true} call ULTIMATE.init(); {13439#true} is VALID [2022-04-28 03:15:42,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {13439#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); {13439#true} is VALID [2022-04-28 03:15:42,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {13439#true} assume true; {13439#true} is VALID [2022-04-28 03:15:42,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13439#true} {13439#true} #56#return; {13439#true} is VALID [2022-04-28 03:15:42,688 INFO L272 TraceCheckUtils]: 4: Hoare triple {13439#true} call #t~ret1 := main(); {13439#true} is VALID [2022-04-28 03:15:42,689 INFO L290 TraceCheckUtils]: 5: Hoare triple {13439#true} ~x~0 := 0;~y~0 := 50; {13469#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:15:42,689 INFO L290 TraceCheckUtils]: 6: Hoare triple {13469#(and (<= main_~x~0 0) (= main_~y~0 50))} [178] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_973 v_main_~x~0_972))) (or .cse0 (and (< v_main_~x~0_973 v_main_~x~0_972) (< v_main_~x~0_972 51)) (and .cse0 (not (< v_main_~x~0_973 50))))) InVars {main_~x~0=v_main_~x~0_973} OutVars{main_~x~0=v_main_~x~0_972} AuxVars[] AssignedVars[main_~x~0] {13473#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:15:42,690 INFO L290 TraceCheckUtils]: 7: Hoare triple {13473#(and (= main_~y~0 50) (< main_~x~0 51))} [179] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13473#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:15:42,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {13473#(and (= main_~y~0 50) (< main_~x~0 51))} [180] L28-2-->L27-2_primed: Formula: (let ((.cse2 (<= 50 v_main_~x~0_975)) (.cse0 (= v_main_~x~0_975 v_main_~x~0_974)) (.cse1 (= v_main_~y~0_703 v_main_~y~0_702))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_975 100)) (not .cse2))) (let ((.cse3 (+ v_main_~x~0_975 v_main_~y~0_702))) (and (< .cse3 (+ 101 v_main_~y~0_703)) .cse2 (< v_main_~y~0_703 v_main_~y~0_702) (= (+ v_main_~x~0_974 v_main_~y~0_703) .cse3))) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_975, main_~y~0=v_main_~y~0_703} OutVars{main_~x~0=v_main_~x~0_974, main_~y~0=v_main_~y~0_702} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {13480#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:15:42,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {13480#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [177] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {13447#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:15:42,698 INFO L272 TraceCheckUtils]: 10: Hoare triple {13447#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {13487#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:15:42,698 INFO L290 TraceCheckUtils]: 11: Hoare triple {13487#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13491#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:15:42,698 INFO L290 TraceCheckUtils]: 12: Hoare triple {13491#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13440#false} is VALID [2022-04-28 03:15:42,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {13440#false} assume !false; {13440#false} is VALID [2022-04-28 03:15:42,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:15:42,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:15:43,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {13440#false} assume !false; {13440#false} is VALID [2022-04-28 03:15:43,139 INFO L290 TraceCheckUtils]: 12: Hoare triple {13491#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13440#false} is VALID [2022-04-28 03:15:43,139 INFO L290 TraceCheckUtils]: 11: Hoare triple {13487#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13491#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:15:43,140 INFO L272 TraceCheckUtils]: 10: Hoare triple {13447#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {13487#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:15:43,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {13510#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [177] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {13447#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:15:43,141 INFO L290 TraceCheckUtils]: 8: Hoare triple {13514#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (< main_~x~0 (+ main_~y~0 1)) (not (<= 50 main_~x~0)) (<= 99 main_~y~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [180] L28-2-->L27-2_primed: Formula: (let ((.cse2 (<= 50 v_main_~x~0_975)) (.cse0 (= v_main_~x~0_975 v_main_~x~0_974)) (.cse1 (= v_main_~y~0_703 v_main_~y~0_702))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_975 100)) (not .cse2))) (let ((.cse3 (+ v_main_~x~0_975 v_main_~y~0_702))) (and (< .cse3 (+ 101 v_main_~y~0_703)) .cse2 (< v_main_~y~0_703 v_main_~y~0_702) (= (+ v_main_~x~0_974 v_main_~y~0_703) .cse3))) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_975, main_~y~0=v_main_~y~0_703} OutVars{main_~x~0=v_main_~x~0_974, main_~y~0=v_main_~y~0_702} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {13510#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:15:43,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {13514#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (< main_~x~0 (+ main_~y~0 1)) (not (<= 50 main_~x~0)) (<= 99 main_~y~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [179] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13514#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (< main_~x~0 (+ main_~y~0 1)) (not (<= 50 main_~x~0)) (<= 99 main_~y~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:15:43,143 INFO L290 TraceCheckUtils]: 6: Hoare triple {13521#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (<= 50 main_~y~0) (<= main_~y~0 100) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [178] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_973 v_main_~x~0_972))) (or .cse0 (and (< v_main_~x~0_973 v_main_~x~0_972) (< v_main_~x~0_972 51)) (and .cse0 (not (< v_main_~x~0_973 50))))) InVars {main_~x~0=v_main_~x~0_973} OutVars{main_~x~0=v_main_~x~0_972} AuxVars[] AssignedVars[main_~x~0] {13514#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (< main_~x~0 (+ main_~y~0 1)) (not (<= 50 main_~x~0)) (<= 99 main_~y~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:15:43,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {13439#true} ~x~0 := 0;~y~0 := 50; {13521#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (<= 50 main_~y~0) (<= main_~y~0 100) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:15:43,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {13439#true} call #t~ret1 := main(); {13439#true} is VALID [2022-04-28 03:15:43,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13439#true} {13439#true} #56#return; {13439#true} is VALID [2022-04-28 03:15:43,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {13439#true} assume true; {13439#true} is VALID [2022-04-28 03:15:43,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {13439#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); {13439#true} is VALID [2022-04-28 03:15:43,144 INFO L272 TraceCheckUtils]: 0: Hoare triple {13439#true} call ULTIMATE.init(); {13439#true} is VALID [2022-04-28 03:15:43,144 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:43,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031720646] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:15:43,144 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:15:43,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:15:44,461 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:15:44,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [146743448] [2022-04-28 03:15:44,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [146743448] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:15:44,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:15:44,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-28 03:15:44,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401533820] [2022-04-28 03:15:44,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:15:44,462 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.864864864864865) internal successors, (69), 36 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:15:44,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:15:44,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 37 states have (on average 1.864864864864865) internal successors, (69), 36 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:15:44,524 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:15:44,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-28 03:15:44,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:15:44,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-28 03:15:44,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=2053, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 03:15:44,525 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand has 38 states, 37 states have (on average 1.864864864864865) internal successors, (69), 36 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:15:49,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:49,103 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2022-04-28 03:15:49,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-28 03:15:49,104 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.864864864864865) internal successors, (69), 36 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:15:49,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:15:49,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.864864864864865) internal successors, (69), 36 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:15:49,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 89 transitions. [2022-04-28 03:15:49,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.864864864864865) internal successors, (69), 36 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:15:49,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 89 transitions. [2022-04-28 03:15:49,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 89 transitions. [2022-04-28 03:15:49,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:15:49,180 INFO L225 Difference]: With dead ends: 84 [2022-04-28 03:15:49,180 INFO L226 Difference]: Without dead ends: 77 [2022-04-28 03:15:49,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1348 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=593, Invalid=5887, Unknown=0, NotChecked=0, Total=6480 [2022-04-28 03:15:49,183 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 40 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 2485 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 2522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:15:49,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 188 Invalid, 2522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2485 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-28 03:15:49,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-28 03:15:49,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-04-28 03:15:49,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:15:49,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 77 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 72 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call 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,301 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 77 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 72 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call 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,301 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 77 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 72 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call 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,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:49,302 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2022-04-28 03:15:49,302 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2022-04-28 03:15:49,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:15:49,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:15:49,302 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 72 states have internal predecessors, (75), 3 states have call successors, (3), 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 77 states. [2022-04-28 03:15:49,302 INFO L87 Difference]: Start difference. First operand has 77 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 72 states have internal predecessors, (75), 3 states have call successors, (3), 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 77 states. [2022-04-28 03:15:49,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:49,303 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2022-04-28 03:15:49,303 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2022-04-28 03:15:49,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:15:49,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:15:49,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:15:49,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:15:49,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 72 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call 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,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2022-04-28 03:15:49,305 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 73 [2022-04-28 03:15:49,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:15:49,305 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2022-04-28 03:15:49,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.864864864864865) internal successors, (69), 36 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:15:49,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 79 transitions. [2022-04-28 03:15:49,391 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:15:49,392 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2022-04-28 03:15:49,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-28 03:15:49,392 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:15:49,392 INFO L195 NwaCegarLoop]: trace histogram [32, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:15:49,419 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:49,592 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,SelfDestructingSolverStorable32 [2022-04-28 03:15:49,593 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:15:49,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:15:49,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1316930232, now seen corresponding path program 31 times [2022-04-28 03:15:49,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:15:49,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [89681581] [2022-04-28 03:15:53,656 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:15:53,707 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:15:53,917 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:15:53,918 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:15:53,920 INFO L85 PathProgramCache]: Analyzing trace with hash 317280460, now seen corresponding path program 1 times [2022-04-28 03:15:53,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:15:53,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67592084] [2022-04-28 03:15:53,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:15:53,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:15:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:54,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:15:54,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:54,029 INFO L290 TraceCheckUtils]: 0: Hoare triple {14125#(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); {14114#true} is VALID [2022-04-28 03:15:54,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {14114#true} assume true; {14114#true} is VALID [2022-04-28 03:15:54,029 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14114#true} {14114#true} #56#return; {14114#true} is VALID [2022-04-28 03:15:54,030 INFO L272 TraceCheckUtils]: 0: Hoare triple {14114#true} call ULTIMATE.init(); {14125#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:15:54,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {14125#(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); {14114#true} is VALID [2022-04-28 03:15:54,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {14114#true} assume true; {14114#true} is VALID [2022-04-28 03:15:54,030 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14114#true} {14114#true} #56#return; {14114#true} is VALID [2022-04-28 03:15:54,030 INFO L272 TraceCheckUtils]: 4: Hoare triple {14114#true} call #t~ret1 := main(); {14114#true} is VALID [2022-04-28 03:15:54,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {14114#true} ~x~0 := 0;~y~0 := 50; {14119#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:15:54,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {14119#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [182] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1021 v_main_~x~0_1020))) (or .cse0 (and (< v_main_~x~0_1020 51) (< v_main_~x~0_1021 v_main_~x~0_1020)) (and .cse0 (<= 50 v_main_~x~0_1021)))) InVars {main_~x~0=v_main_~x~0_1021} OutVars{main_~x~0=v_main_~x~0_1020} AuxVars[] AssignedVars[main_~x~0] {14120#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:15:54,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {14120#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [183] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14120#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:15:54,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {14120#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [184] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1023 v_main_~x~0_1022)) (.cse1 (<= 50 v_main_~x~0_1023))) (or (and (= v_main_~y~0_742 v_main_~y~0_741) .cse0) (and (or (not (< v_main_~x~0_1023 100)) (not .cse1)) (= v_main_~y~0_741 v_main_~y~0_742) .cse0) (and (= (+ v_main_~x~0_1023 v_main_~y~0_741) (+ v_main_~x~0_1022 v_main_~y~0_742)) (< v_main_~x~0_1023 v_main_~x~0_1022) .cse1 (< v_main_~x~0_1022 101)))) InVars {main_~x~0=v_main_~x~0_1023, main_~y~0=v_main_~y~0_742} OutVars{main_~x~0=v_main_~x~0_1022, main_~y~0=v_main_~y~0_741} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {14121#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:15:54,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {14121#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} [181] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {14122#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:15:54,033 INFO L272 TraceCheckUtils]: 10: Hoare triple {14122#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {14123#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:15:54,034 INFO L290 TraceCheckUtils]: 11: Hoare triple {14123#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {14124#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:15:54,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {14124#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {14115#false} is VALID [2022-04-28 03:15:54,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {14115#false} assume !false; {14115#false} is VALID [2022-04-28 03:15:54,034 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:54,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:15:54,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67592084] [2022-04-28 03:15:54,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67592084] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:15:54,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007994572] [2022-04-28 03:15:54,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:15:54,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:15:54,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:15:54,036 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:54,036 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:54,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:54,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:15:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:54,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:15:54,367 INFO L272 TraceCheckUtils]: 0: Hoare triple {14114#true} call ULTIMATE.init(); {14114#true} is VALID [2022-04-28 03:15:54,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {14114#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); {14114#true} is VALID [2022-04-28 03:15:54,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {14114#true} assume true; {14114#true} is VALID [2022-04-28 03:15:54,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14114#true} {14114#true} #56#return; {14114#true} is VALID [2022-04-28 03:15:54,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {14114#true} call #t~ret1 := main(); {14114#true} is VALID [2022-04-28 03:15:54,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {14114#true} ~x~0 := 0;~y~0 := 50; {14144#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:15:54,369 INFO L290 TraceCheckUtils]: 6: Hoare triple {14144#(and (<= main_~x~0 0) (= main_~y~0 50))} [182] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1021 v_main_~x~0_1020))) (or .cse0 (and (< v_main_~x~0_1020 51) (< v_main_~x~0_1021 v_main_~x~0_1020)) (and .cse0 (<= 50 v_main_~x~0_1021)))) InVars {main_~x~0=v_main_~x~0_1021} OutVars{main_~x~0=v_main_~x~0_1020} AuxVars[] AssignedVars[main_~x~0] {14148#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:15:54,370 INFO L290 TraceCheckUtils]: 7: Hoare triple {14148#(and (= main_~y~0 50) (< main_~x~0 51))} [183] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14148#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:15:54,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {14148#(and (= main_~y~0 50) (< main_~x~0 51))} [184] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1023 v_main_~x~0_1022)) (.cse1 (<= 50 v_main_~x~0_1023))) (or (and (= v_main_~y~0_742 v_main_~y~0_741) .cse0) (and (or (not (< v_main_~x~0_1023 100)) (not .cse1)) (= v_main_~y~0_741 v_main_~y~0_742) .cse0) (and (= (+ v_main_~x~0_1023 v_main_~y~0_741) (+ v_main_~x~0_1022 v_main_~y~0_742)) (< v_main_~x~0_1023 v_main_~x~0_1022) .cse1 (< v_main_~x~0_1022 101)))) InVars {main_~x~0=v_main_~x~0_1023, main_~y~0=v_main_~y~0_742} OutVars{main_~x~0=v_main_~x~0_1022, main_~y~0=v_main_~y~0_741} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {14155#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:15:54,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {14155#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [181] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {14122#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:15:54,372 INFO L272 TraceCheckUtils]: 10: Hoare triple {14122#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {14162#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:15:54,373 INFO L290 TraceCheckUtils]: 11: Hoare triple {14162#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14166#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:15:54,373 INFO L290 TraceCheckUtils]: 12: Hoare triple {14166#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14115#false} is VALID [2022-04-28 03:15:54,373 INFO L290 TraceCheckUtils]: 13: Hoare triple {14115#false} assume !false; {14115#false} is VALID [2022-04-28 03:15:54,373 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:54,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:15:54,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {14115#false} assume !false; {14115#false} is VALID [2022-04-28 03:15:54,847 INFO L290 TraceCheckUtils]: 12: Hoare triple {14166#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14115#false} is VALID [2022-04-28 03:15:54,848 INFO L290 TraceCheckUtils]: 11: Hoare triple {14162#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14166#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:15:54,848 INFO L272 TraceCheckUtils]: 10: Hoare triple {14122#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {14162#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:15:54,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {14185#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [181] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {14122#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:15:54,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {14189#(and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [184] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1023 v_main_~x~0_1022)) (.cse1 (<= 50 v_main_~x~0_1023))) (or (and (= v_main_~y~0_742 v_main_~y~0_741) .cse0) (and (or (not (< v_main_~x~0_1023 100)) (not .cse1)) (= v_main_~y~0_741 v_main_~y~0_742) .cse0) (and (= (+ v_main_~x~0_1023 v_main_~y~0_741) (+ v_main_~x~0_1022 v_main_~y~0_742)) (< v_main_~x~0_1023 v_main_~x~0_1022) .cse1 (< v_main_~x~0_1022 101)))) InVars {main_~x~0=v_main_~x~0_1023, main_~y~0=v_main_~y~0_742} OutVars{main_~x~0=v_main_~x~0_1022, main_~y~0=v_main_~y~0_741} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {14185#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:15:54,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {14189#(and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [183] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14189#(and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:15:54,851 INFO L290 TraceCheckUtils]: 6: Hoare triple {14196#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (<= 50 main_~y~0) (<= main_~y~0 100) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [182] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1021 v_main_~x~0_1020))) (or .cse0 (and (< v_main_~x~0_1020 51) (< v_main_~x~0_1021 v_main_~x~0_1020)) (and .cse0 (<= 50 v_main_~x~0_1021)))) InVars {main_~x~0=v_main_~x~0_1021} OutVars{main_~x~0=v_main_~x~0_1020} AuxVars[] AssignedVars[main_~x~0] {14189#(and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:15:54,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {14114#true} ~x~0 := 0;~y~0 := 50; {14196#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (<= 50 main_~y~0) (<= main_~y~0 100) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:15:54,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {14114#true} call #t~ret1 := main(); {14114#true} is VALID [2022-04-28 03:15:54,852 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14114#true} {14114#true} #56#return; {14114#true} is VALID [2022-04-28 03:15:54,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {14114#true} assume true; {14114#true} is VALID [2022-04-28 03:15:54,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {14114#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); {14114#true} is VALID [2022-04-28 03:15:54,852 INFO L272 TraceCheckUtils]: 0: Hoare triple {14114#true} call ULTIMATE.init(); {14114#true} is VALID [2022-04-28 03:15:54,852 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:54,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007994572] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:15:54,852 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:15:54,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:15:56,222 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:15:56,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [89681581] [2022-04-28 03:15:56,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [89681581] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:15:56,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:15:56,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-28 03:15:56,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868664666] [2022-04-28 03:15:56,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:15:56,223 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 37 states have internal predecessors, (71), 2 states have call successors, (3), 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 75 [2022-04-28 03:15:56,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:15:56,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 37 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call 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:56,285 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:15:56,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-28 03:15:56,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:15:56,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-28 03:15:56,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=2144, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 03:15:56,286 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 37 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call 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:01,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:01,030 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2022-04-28 03:16:01,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-28 03:16:01,030 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 37 states have internal predecessors, (71), 2 states have call successors, (3), 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 75 [2022-04-28 03:16:01,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:16:01,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 37 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call 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:01,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 91 transitions. [2022-04-28 03:16:01,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 37 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call 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:01,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 91 transitions. [2022-04-28 03:16:01,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 91 transitions. [2022-04-28 03:16:01,114 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:16:01,115 INFO L225 Difference]: With dead ends: 86 [2022-04-28 03:16:01,115 INFO L226 Difference]: Without dead ends: 79 [2022-04-28 03:16:01,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1404 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=609, Invalid=6197, Unknown=0, NotChecked=0, Total=6806 [2022-04-28 03:16:01,116 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 41 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 2559 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 2597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:16:01,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 188 Invalid, 2597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2559 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-28 03:16:01,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-28 03:16:01,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-04-28 03:16:01,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:16:01,232 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 79 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 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:16:01,232 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 79 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 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:16:01,232 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 79 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 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:16:01,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:01,233 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2022-04-28 03:16:01,233 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2022-04-28 03:16:01,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:01,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:01,234 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 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 79 states. [2022-04-28 03:16:01,234 INFO L87 Difference]: Start difference. First operand has 79 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 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 79 states. [2022-04-28 03:16:01,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:01,234 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2022-04-28 03:16:01,234 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2022-04-28 03:16:01,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:01,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:01,235 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:16:01,235 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:16:01,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 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:16:01,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2022-04-28 03:16:01,235 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 75 [2022-04-28 03:16:01,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:16:01,236 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2022-04-28 03:16:01,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 37 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call 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:01,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 81 transitions. [2022-04-28 03:16:01,300 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:16:01,301 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2022-04-28 03:16:01,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-28 03:16:01,301 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:16:01,301 INFO L195 NwaCegarLoop]: trace histogram [33, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:16:01,317 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:01,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:16:01,502 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:16:01,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:16:01,502 INFO L85 PathProgramCache]: Analyzing trace with hash -375727085, now seen corresponding path program 32 times [2022-04-28 03:16:01,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:01,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [127461011] [2022-04-28 03:16:01,591 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:16:01,770 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:16:01,771 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:16:01,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1928154676, now seen corresponding path program 1 times [2022-04-28 03:16:01,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:16:01,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207041891] [2022-04-28 03:16:01,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:16:01,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:16:01,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:01,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:16:01,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:01,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {14815#(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); {14804#true} is VALID [2022-04-28 03:16:01,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {14804#true} assume true; {14804#true} is VALID [2022-04-28 03:16:01,894 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14804#true} {14804#true} #56#return; {14804#true} is VALID [2022-04-28 03:16:01,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {14804#true} call ULTIMATE.init(); {14815#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:16:01,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {14815#(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); {14804#true} is VALID [2022-04-28 03:16:01,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {14804#true} assume true; {14804#true} is VALID [2022-04-28 03:16:01,895 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14804#true} {14804#true} #56#return; {14804#true} is VALID [2022-04-28 03:16:01,895 INFO L272 TraceCheckUtils]: 4: Hoare triple {14804#true} call #t~ret1 := main(); {14804#true} is VALID [2022-04-28 03:16:01,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {14804#true} ~x~0 := 0;~y~0 := 50; {14809#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:16:01,896 INFO L290 TraceCheckUtils]: 6: Hoare triple {14809#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [186] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1070 v_main_~x~0_1069))) (or .cse0 (and (< v_main_~x~0_1069 51) (< v_main_~x~0_1070 v_main_~x~0_1069)) (and .cse0 (not (< v_main_~x~0_1070 50))))) InVars {main_~x~0=v_main_~x~0_1070} OutVars{main_~x~0=v_main_~x~0_1069} AuxVars[] AssignedVars[main_~x~0] {14810#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:16:01,897 INFO L290 TraceCheckUtils]: 7: Hoare triple {14810#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [187] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14810#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:16:01,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {14810#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [188] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_782 v_main_~y~0_781)) (.cse1 (<= 50 v_main_~x~0_1072))) (or (and .cse0 (= v_main_~x~0_1072 v_main_~x~0_1071)) (and .cse0 (or (not (< v_main_~x~0_1072 100)) (not .cse1)) (= v_main_~x~0_1071 v_main_~x~0_1072)) (and (= (+ v_main_~x~0_1072 v_main_~y~0_781) (+ v_main_~x~0_1071 v_main_~y~0_782)) .cse1 (< v_main_~x~0_1071 101) (< v_main_~x~0_1072 v_main_~x~0_1071)))) InVars {main_~x~0=v_main_~x~0_1072, main_~y~0=v_main_~y~0_782} OutVars{main_~x~0=v_main_~x~0_1071, main_~y~0=v_main_~y~0_781} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {14811#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:16:01,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {14811#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} [185] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {14812#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:16:01,899 INFO L272 TraceCheckUtils]: 10: Hoare triple {14812#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {14813#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:16:01,899 INFO L290 TraceCheckUtils]: 11: Hoare triple {14813#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {14814#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:16:01,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {14814#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {14805#false} is VALID [2022-04-28 03:16:01,900 INFO L290 TraceCheckUtils]: 13: Hoare triple {14805#false} assume !false; {14805#false} is VALID [2022-04-28 03:16:01,900 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:01,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:16:01,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207041891] [2022-04-28 03:16:01,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207041891] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:16:01,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91364148] [2022-04-28 03:16:01,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:16:01,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:16:01,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:16:01,902 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:01,903 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:01,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:01,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:16:01,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:01,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:16:02,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {14804#true} call ULTIMATE.init(); {14804#true} is VALID [2022-04-28 03:16:02,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {14804#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); {14804#true} is VALID [2022-04-28 03:16:02,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {14804#true} assume true; {14804#true} is VALID [2022-04-28 03:16:02,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14804#true} {14804#true} #56#return; {14804#true} is VALID [2022-04-28 03:16:02,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {14804#true} call #t~ret1 := main(); {14804#true} is VALID [2022-04-28 03:16:02,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {14804#true} ~x~0 := 0;~y~0 := 50; {14834#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:16:02,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {14834#(and (<= main_~x~0 0) (= main_~y~0 50))} [186] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1070 v_main_~x~0_1069))) (or .cse0 (and (< v_main_~x~0_1069 51) (< v_main_~x~0_1070 v_main_~x~0_1069)) (and .cse0 (not (< v_main_~x~0_1070 50))))) InVars {main_~x~0=v_main_~x~0_1070} OutVars{main_~x~0=v_main_~x~0_1069} AuxVars[] AssignedVars[main_~x~0] {14838#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:16:02,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {14838#(and (= main_~y~0 50) (< main_~x~0 51))} [187] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14838#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:16:02,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {14838#(and (= main_~y~0 50) (< main_~x~0 51))} [188] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_782 v_main_~y~0_781)) (.cse1 (<= 50 v_main_~x~0_1072))) (or (and .cse0 (= v_main_~x~0_1072 v_main_~x~0_1071)) (and .cse0 (or (not (< v_main_~x~0_1072 100)) (not .cse1)) (= v_main_~x~0_1071 v_main_~x~0_1072)) (and (= (+ v_main_~x~0_1072 v_main_~y~0_781) (+ v_main_~x~0_1071 v_main_~y~0_782)) .cse1 (< v_main_~x~0_1071 101) (< v_main_~x~0_1072 v_main_~x~0_1071)))) InVars {main_~x~0=v_main_~x~0_1072, main_~y~0=v_main_~y~0_782} OutVars{main_~x~0=v_main_~x~0_1071, main_~y~0=v_main_~y~0_781} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {14845#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:16:02,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {14845#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [185] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {14812#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:16:02,223 INFO L272 TraceCheckUtils]: 10: Hoare triple {14812#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {14852#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:16:02,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {14852#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14856#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:16:02,224 INFO L290 TraceCheckUtils]: 12: Hoare triple {14856#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14805#false} is VALID [2022-04-28 03:16:02,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {14805#false} assume !false; {14805#false} is VALID [2022-04-28 03:16:02,224 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:02,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:16:02,666 INFO L290 TraceCheckUtils]: 13: Hoare triple {14805#false} assume !false; {14805#false} is VALID [2022-04-28 03:16:02,666 INFO L290 TraceCheckUtils]: 12: Hoare triple {14856#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14805#false} is VALID [2022-04-28 03:16:02,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {14852#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14856#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:16:02,667 INFO L272 TraceCheckUtils]: 10: Hoare triple {14812#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {14852#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:16:02,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {14875#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [185] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {14812#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:16:02,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {14879#(and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [188] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_782 v_main_~y~0_781)) (.cse1 (<= 50 v_main_~x~0_1072))) (or (and .cse0 (= v_main_~x~0_1072 v_main_~x~0_1071)) (and .cse0 (or (not (< v_main_~x~0_1072 100)) (not .cse1)) (= v_main_~x~0_1071 v_main_~x~0_1072)) (and (= (+ v_main_~x~0_1072 v_main_~y~0_781) (+ v_main_~x~0_1071 v_main_~y~0_782)) .cse1 (< v_main_~x~0_1071 101) (< v_main_~x~0_1072 v_main_~x~0_1071)))) InVars {main_~x~0=v_main_~x~0_1072, main_~y~0=v_main_~y~0_782} OutVars{main_~x~0=v_main_~x~0_1071, main_~y~0=v_main_~y~0_781} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {14875#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:16:02,671 INFO L290 TraceCheckUtils]: 7: Hoare triple {14879#(and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [187] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14879#(and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:16:02,672 INFO L290 TraceCheckUtils]: 6: Hoare triple {14886#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (<= 50 main_~y~0) (<= main_~y~0 100) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [186] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1070 v_main_~x~0_1069))) (or .cse0 (and (< v_main_~x~0_1069 51) (< v_main_~x~0_1070 v_main_~x~0_1069)) (and .cse0 (not (< v_main_~x~0_1070 50))))) InVars {main_~x~0=v_main_~x~0_1070} OutVars{main_~x~0=v_main_~x~0_1069} AuxVars[] AssignedVars[main_~x~0] {14879#(and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:16:02,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {14804#true} ~x~0 := 0;~y~0 := 50; {14886#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (<= 50 main_~y~0) (<= main_~y~0 100) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:16:02,673 INFO L272 TraceCheckUtils]: 4: Hoare triple {14804#true} call #t~ret1 := main(); {14804#true} is VALID [2022-04-28 03:16:02,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14804#true} {14804#true} #56#return; {14804#true} is VALID [2022-04-28 03:16:02,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {14804#true} assume true; {14804#true} is VALID [2022-04-28 03:16:02,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {14804#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); {14804#true} is VALID [2022-04-28 03:16:02,673 INFO L272 TraceCheckUtils]: 0: Hoare triple {14804#true} call ULTIMATE.init(); {14804#true} is VALID [2022-04-28 03:16:02,673 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:02,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91364148] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:16:02,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:16:02,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:16:04,092 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:16:04,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [127461011] [2022-04-28 03:16:04,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [127461011] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:16:04,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:16:04,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-28 03:16:04,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750315990] [2022-04-28 03:16:04,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:16:04,093 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 38 states have internal predecessors, (73), 2 states have call successors, (3), 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 77 [2022-04-28 03:16:04,093 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:16:04,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 38 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call 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:04,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:16:04,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-28 03:16:04,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:04,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-28 03:16:04,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=2237, Unknown=0, NotChecked=0, Total=2550 [2022-04-28 03:16:04,152 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand has 40 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 38 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call 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:09,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:09,205 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2022-04-28 03:16:09,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-28 03:16:09,205 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 38 states have internal predecessors, (73), 2 states have call successors, (3), 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 77 [2022-04-28 03:16:09,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:16:09,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 38 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call 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:09,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 93 transitions. [2022-04-28 03:16:09,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 38 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call 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:09,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 93 transitions. [2022-04-28 03:16:09,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 93 transitions. [2022-04-28 03:16:09,294 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:16:09,295 INFO L225 Difference]: With dead ends: 88 [2022-04-28 03:16:09,295 INFO L226 Difference]: Without dead ends: 81 [2022-04-28 03:16:09,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1461 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=625, Invalid=6515, Unknown=0, NotChecked=0, Total=7140 [2022-04-28 03:16:09,296 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 42 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 2704 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 2743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 2704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:16:09,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 193 Invalid, 2743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 2704 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 03:16:09,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-28 03:16:09,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-04-28 03:16:09,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:16:09,414 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 81 states, 76 states have (on average 1.0394736842105263) internal successors, (79), 76 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call 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:09,414 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 81 states, 76 states have (on average 1.0394736842105263) internal successors, (79), 76 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call 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:09,414 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 81 states, 76 states have (on average 1.0394736842105263) internal successors, (79), 76 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call 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:09,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:09,415 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2022-04-28 03:16:09,415 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2022-04-28 03:16:09,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:09,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:09,415 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 76 states have (on average 1.0394736842105263) internal successors, (79), 76 states have internal predecessors, (79), 3 states have call successors, (3), 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:16:09,415 INFO L87 Difference]: Start difference. First operand has 81 states, 76 states have (on average 1.0394736842105263) internal successors, (79), 76 states have internal predecessors, (79), 3 states have call successors, (3), 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:16:09,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:09,416 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2022-04-28 03:16:09,416 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2022-04-28 03:16:09,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:09,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:09,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:16:09,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:16:09,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.0394736842105263) internal successors, (79), 76 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call 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:09,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2022-04-28 03:16:09,418 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 77 [2022-04-28 03:16:09,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:16:09,418 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2022-04-28 03:16:09,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 38 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call 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:09,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 83 transitions. [2022-04-28 03:16:09,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:16:09,485 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2022-04-28 03:16:09,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-28 03:16:09,485 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:16:09,485 INFO L195 NwaCegarLoop]: trace histogram [34, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:16:09,502 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:09,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:16:09,686 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:16:09,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:16:09,686 INFO L85 PathProgramCache]: Analyzing trace with hash 773196462, now seen corresponding path program 33 times [2022-04-28 03:16:09,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:09,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1695546697] [2022-04-28 03:16:11,834 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:16:11,886 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:16:12,406 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:16:12,410 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:16:12,412 INFO L85 PathProgramCache]: Analyzing trace with hash 121377484, now seen corresponding path program 1 times [2022-04-28 03:16:12,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:16:12,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573325916] [2022-04-28 03:16:12,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:16:12,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:16:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:12,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:16:12,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:12,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {15520#(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); {15509#true} is VALID [2022-04-28 03:16:12,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {15509#true} assume true; {15509#true} is VALID [2022-04-28 03:16:12,510 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15509#true} {15509#true} #56#return; {15509#true} is VALID [2022-04-28 03:16:12,511 INFO L272 TraceCheckUtils]: 0: Hoare triple {15509#true} call ULTIMATE.init(); {15520#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:16:12,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {15520#(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); {15509#true} is VALID [2022-04-28 03:16:12,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {15509#true} assume true; {15509#true} is VALID [2022-04-28 03:16:12,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15509#true} {15509#true} #56#return; {15509#true} is VALID [2022-04-28 03:16:12,511 INFO L272 TraceCheckUtils]: 4: Hoare triple {15509#true} call #t~ret1 := main(); {15509#true} is VALID [2022-04-28 03:16:12,511 INFO L290 TraceCheckUtils]: 5: Hoare triple {15509#true} ~x~0 := 0;~y~0 := 50; {15514#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:16:12,512 INFO L290 TraceCheckUtils]: 6: Hoare triple {15514#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [190] L28-2-->L27-2_primed: Formula: (or (= v_main_~x~0_1120 v_main_~x~0_1119) (and (= v_main_~x~0_1119 v_main_~x~0_1120) (not (< v_main_~x~0_1120 50))) (and (< v_main_~x~0_1120 v_main_~x~0_1119) (< v_main_~x~0_1119 51))) InVars {main_~x~0=v_main_~x~0_1120} OutVars{main_~x~0=v_main_~x~0_1119} AuxVars[] AssignedVars[main_~x~0] {15515#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:16:12,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {15515#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [191] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15515#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:16:12,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {15515#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [192] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_823 v_main_~y~0_822)) (.cse2 (<= 50 v_main_~x~0_1122)) (.cse1 (= v_main_~x~0_1122 v_main_~x~0_1121))) (or (and .cse0 .cse1) (let ((.cse3 (+ v_main_~x~0_1122 v_main_~y~0_822))) (and (< v_main_~y~0_823 v_main_~y~0_822) .cse2 (< .cse3 (+ 101 v_main_~y~0_823)) (= .cse3 (+ v_main_~x~0_1121 v_main_~y~0_823)))) (and .cse0 (or (not .cse2) (not (< v_main_~x~0_1122 100))) .cse1))) InVars {main_~x~0=v_main_~x~0_1122, main_~y~0=v_main_~y~0_823} OutVars{main_~x~0=v_main_~x~0_1121, main_~y~0=v_main_~y~0_822} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {15516#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:16:12,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {15516#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} [189] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {15517#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:16:12,515 INFO L272 TraceCheckUtils]: 10: Hoare triple {15517#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {15518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:16:12,515 INFO L290 TraceCheckUtils]: 11: Hoare triple {15518#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {15519#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:16:12,515 INFO L290 TraceCheckUtils]: 12: Hoare triple {15519#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {15510#false} is VALID [2022-04-28 03:16:12,515 INFO L290 TraceCheckUtils]: 13: Hoare triple {15510#false} assume !false; {15510#false} is VALID [2022-04-28 03:16:12,515 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:12,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:16:12,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573325916] [2022-04-28 03:16:12,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573325916] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:16:12,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325456628] [2022-04-28 03:16:12,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:16:12,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:16:12,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:16:12,517 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:12,518 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:12,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:12,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:16:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:12,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:16:12,818 INFO L272 TraceCheckUtils]: 0: Hoare triple {15509#true} call ULTIMATE.init(); {15509#true} is VALID [2022-04-28 03:16:12,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {15509#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); {15509#true} is VALID [2022-04-28 03:16:12,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {15509#true} assume true; {15509#true} is VALID [2022-04-28 03:16:12,818 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15509#true} {15509#true} #56#return; {15509#true} is VALID [2022-04-28 03:16:12,818 INFO L272 TraceCheckUtils]: 4: Hoare triple {15509#true} call #t~ret1 := main(); {15509#true} is VALID [2022-04-28 03:16:12,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {15509#true} ~x~0 := 0;~y~0 := 50; {15539#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:16:12,819 INFO L290 TraceCheckUtils]: 6: Hoare triple {15539#(and (<= main_~x~0 0) (= main_~y~0 50))} [190] L28-2-->L27-2_primed: Formula: (or (= v_main_~x~0_1120 v_main_~x~0_1119) (and (= v_main_~x~0_1119 v_main_~x~0_1120) (not (< v_main_~x~0_1120 50))) (and (< v_main_~x~0_1120 v_main_~x~0_1119) (< v_main_~x~0_1119 51))) InVars {main_~x~0=v_main_~x~0_1120} OutVars{main_~x~0=v_main_~x~0_1119} AuxVars[] AssignedVars[main_~x~0] {15543#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:16:12,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {15543#(and (= main_~y~0 50) (< main_~x~0 51))} [191] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15543#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:16:12,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {15543#(and (= main_~y~0 50) (< main_~x~0 51))} [192] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_823 v_main_~y~0_822)) (.cse2 (<= 50 v_main_~x~0_1122)) (.cse1 (= v_main_~x~0_1122 v_main_~x~0_1121))) (or (and .cse0 .cse1) (let ((.cse3 (+ v_main_~x~0_1122 v_main_~y~0_822))) (and (< v_main_~y~0_823 v_main_~y~0_822) .cse2 (< .cse3 (+ 101 v_main_~y~0_823)) (= .cse3 (+ v_main_~x~0_1121 v_main_~y~0_823)))) (and .cse0 (or (not .cse2) (not (< v_main_~x~0_1122 100))) .cse1))) InVars {main_~x~0=v_main_~x~0_1122, main_~y~0=v_main_~y~0_823} OutVars{main_~x~0=v_main_~x~0_1121, main_~y~0=v_main_~y~0_822} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {15550#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:16:12,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {15550#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [189] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {15517#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:16:12,821 INFO L272 TraceCheckUtils]: 10: Hoare triple {15517#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {15557#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:16:12,822 INFO L290 TraceCheckUtils]: 11: Hoare triple {15557#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15561#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:16:12,822 INFO L290 TraceCheckUtils]: 12: Hoare triple {15561#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15510#false} is VALID [2022-04-28 03:16:12,822 INFO L290 TraceCheckUtils]: 13: Hoare triple {15510#false} assume !false; {15510#false} is VALID [2022-04-28 03:16:12,822 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:12,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:16:13,255 INFO L290 TraceCheckUtils]: 13: Hoare triple {15510#false} assume !false; {15510#false} is VALID [2022-04-28 03:16:13,256 INFO L290 TraceCheckUtils]: 12: Hoare triple {15561#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15510#false} is VALID [2022-04-28 03:16:13,256 INFO L290 TraceCheckUtils]: 11: Hoare triple {15557#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15561#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:16:13,257 INFO L272 TraceCheckUtils]: 10: Hoare triple {15517#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {15557#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:16:13,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {15580#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [189] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {15517#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:16:13,258 INFO L290 TraceCheckUtils]: 8: Hoare triple {15584#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [192] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_823 v_main_~y~0_822)) (.cse2 (<= 50 v_main_~x~0_1122)) (.cse1 (= v_main_~x~0_1122 v_main_~x~0_1121))) (or (and .cse0 .cse1) (let ((.cse3 (+ v_main_~x~0_1122 v_main_~y~0_822))) (and (< v_main_~y~0_823 v_main_~y~0_822) .cse2 (< .cse3 (+ 101 v_main_~y~0_823)) (= .cse3 (+ v_main_~x~0_1121 v_main_~y~0_823)))) (and .cse0 (or (not .cse2) (not (< v_main_~x~0_1122 100))) .cse1))) InVars {main_~x~0=v_main_~x~0_1122, main_~y~0=v_main_~y~0_823} OutVars{main_~x~0=v_main_~x~0_1121, main_~y~0=v_main_~y~0_822} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {15580#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:16:13,259 INFO L290 TraceCheckUtils]: 7: Hoare triple {15584#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [191] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15584#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:16:13,260 INFO L290 TraceCheckUtils]: 6: Hoare triple {15591#(and (<= 50 main_~y~0) (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [190] L28-2-->L27-2_primed: Formula: (or (= v_main_~x~0_1120 v_main_~x~0_1119) (and (= v_main_~x~0_1119 v_main_~x~0_1120) (not (< v_main_~x~0_1120 50))) (and (< v_main_~x~0_1120 v_main_~x~0_1119) (< v_main_~x~0_1119 51))) InVars {main_~x~0=v_main_~x~0_1120} OutVars{main_~x~0=v_main_~x~0_1119} AuxVars[] AssignedVars[main_~x~0] {15584#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:16:13,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {15509#true} ~x~0 := 0;~y~0 := 50; {15591#(and (<= 50 main_~y~0) (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:16:13,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {15509#true} call #t~ret1 := main(); {15509#true} is VALID [2022-04-28 03:16:13,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15509#true} {15509#true} #56#return; {15509#true} is VALID [2022-04-28 03:16:13,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {15509#true} assume true; {15509#true} is VALID [2022-04-28 03:16:13,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {15509#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); {15509#true} is VALID [2022-04-28 03:16:13,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {15509#true} call ULTIMATE.init(); {15509#true} is VALID [2022-04-28 03:16:13,261 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:13,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325456628] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:16:13,261 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:16:13,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:16:14,792 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:16:14,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1695546697] [2022-04-28 03:16:14,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1695546697] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:16:14,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:16:14,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-28 03:16:14,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689140659] [2022-04-28 03:16:14,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:16:14,793 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.875) internal successors, (75), 39 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:16:14,793 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:16:14,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 40 states have (on average 1.875) internal successors, (75), 39 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:16:14,853 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:16:14,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-28 03:16:14,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:14,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-28 03:16:14,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=2332, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 03:16:14,854 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand has 41 states, 40 states have (on average 1.875) internal successors, (75), 39 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:16:20,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:20,030 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2022-04-28 03:16:20,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 03:16:20,030 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.875) internal successors, (75), 39 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:16:20,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:16:20,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.875) internal successors, (75), 39 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:16:20,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 95 transitions. [2022-04-28 03:16:20,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.875) internal successors, (75), 39 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:16:20,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 95 transitions. [2022-04-28 03:16:20,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 95 transitions. [2022-04-28 03:16:20,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:16:20,114 INFO L225 Difference]: With dead ends: 90 [2022-04-28 03:16:20,114 INFO L226 Difference]: Without dead ends: 83 [2022-04-28 03:16:20,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1519 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=641, Invalid=6841, Unknown=0, NotChecked=0, Total=7482 [2022-04-28 03:16:20,115 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 43 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 2853 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 2893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:16:20,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 198 Invalid, 2893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2853 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 03:16:20,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-28 03:16:20,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-04-28 03:16:20,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:16:20,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 83 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 78 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call 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:20,236 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 83 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 78 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call 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:20,236 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 83 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 78 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call 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:20,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:20,237 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2022-04-28 03:16:20,237 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2022-04-28 03:16:20,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:20,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:20,237 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 78 states have internal predecessors, (81), 3 states have call successors, (3), 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 83 states. [2022-04-28 03:16:20,238 INFO L87 Difference]: Start difference. First operand has 83 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 78 states have internal predecessors, (81), 3 states have call successors, (3), 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 83 states. [2022-04-28 03:16:20,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:20,240 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2022-04-28 03:16:20,241 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2022-04-28 03:16:20,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:20,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:20,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:16:20,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:16:20,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 78 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call 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:20,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2022-04-28 03:16:20,242 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 79 [2022-04-28 03:16:20,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:16:20,243 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2022-04-28 03:16:20,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.875) internal successors, (75), 39 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:16:20,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 85 transitions. [2022-04-28 03:16:20,331 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:16:20,331 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2022-04-28 03:16:20,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-28 03:16:20,332 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:16:20,332 INFO L195 NwaCegarLoop]: trace histogram [35, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:16:20,348 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:20,532 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,SelfDestructingSolverStorable35 [2022-04-28 03:16:20,532 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:16:20,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:16:20,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1082130057, now seen corresponding path program 34 times [2022-04-28 03:16:20,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:20,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [86328947] [2022-04-28 03:16:20,620 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:16:20,815 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:16:20,816 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:16:20,818 INFO L85 PathProgramCache]: Analyzing trace with hash -2124057652, now seen corresponding path program 1 times [2022-04-28 03:16:20,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:16:20,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480371865] [2022-04-28 03:16:20,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:16:20,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:16:20,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:20,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:16:20,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:20,923 INFO L290 TraceCheckUtils]: 0: Hoare triple {16240#(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); {16229#true} is VALID [2022-04-28 03:16:20,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {16229#true} assume true; {16229#true} is VALID [2022-04-28 03:16:20,923 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16229#true} {16229#true} #56#return; {16229#true} is VALID [2022-04-28 03:16:20,924 INFO L272 TraceCheckUtils]: 0: Hoare triple {16229#true} call ULTIMATE.init(); {16240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:16:20,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {16240#(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); {16229#true} is VALID [2022-04-28 03:16:20,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {16229#true} assume true; {16229#true} is VALID [2022-04-28 03:16:20,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16229#true} {16229#true} #56#return; {16229#true} is VALID [2022-04-28 03:16:20,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {16229#true} call #t~ret1 := main(); {16229#true} is VALID [2022-04-28 03:16:20,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {16229#true} ~x~0 := 0;~y~0 := 50; {16234#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:16:20,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {16234#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [194] L28-2-->L27-2_primed: Formula: (or (and (< v_main_~x~0_1171 v_main_~x~0_1170) (< v_main_~x~0_1170 51)) (and (= v_main_~x~0_1170 v_main_~x~0_1171) (not (< v_main_~x~0_1171 50))) (= v_main_~x~0_1171 v_main_~x~0_1170)) InVars {main_~x~0=v_main_~x~0_1171} OutVars{main_~x~0=v_main_~x~0_1170} AuxVars[] AssignedVars[main_~x~0] {16235#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:16:20,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {16235#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [195] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16235#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:16:20,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {16235#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [196] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_865 v_main_~y~0_864)) (.cse1 (= v_main_~x~0_1173 v_main_~x~0_1172)) (.cse2 (<= 50 v_main_~x~0_1173))) (or (and .cse0 .cse1) (and .cse0 (or (not .cse2) (not (< v_main_~x~0_1173 100))) .cse1) (and (= (+ v_main_~x~0_1173 v_main_~y~0_864) (+ v_main_~x~0_1172 v_main_~y~0_865)) .cse2 (< v_main_~x~0_1172 101) (< v_main_~x~0_1173 v_main_~x~0_1172)))) InVars {main_~x~0=v_main_~x~0_1173, main_~y~0=v_main_~y~0_865} OutVars{main_~x~0=v_main_~x~0_1172, main_~y~0=v_main_~y~0_864} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {16236#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:16:20,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {16236#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} [193] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {16237#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:16:20,927 INFO L272 TraceCheckUtils]: 10: Hoare triple {16237#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {16238#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:16:20,927 INFO L290 TraceCheckUtils]: 11: Hoare triple {16238#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {16239#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:16:20,928 INFO L290 TraceCheckUtils]: 12: Hoare triple {16239#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {16230#false} is VALID [2022-04-28 03:16:20,928 INFO L290 TraceCheckUtils]: 13: Hoare triple {16230#false} assume !false; {16230#false} is VALID [2022-04-28 03:16:20,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:16:20,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:16:20,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480371865] [2022-04-28 03:16:20,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480371865] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:16:20,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117171779] [2022-04-28 03:16:20,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:16:20,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:16:20,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:16:20,929 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:20,930 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:20,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:20,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:16:20,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:20,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:16:21,244 INFO L272 TraceCheckUtils]: 0: Hoare triple {16229#true} call ULTIMATE.init(); {16229#true} is VALID [2022-04-28 03:16:21,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {16229#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); {16229#true} is VALID [2022-04-28 03:16:21,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {16229#true} assume true; {16229#true} is VALID [2022-04-28 03:16:21,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16229#true} {16229#true} #56#return; {16229#true} is VALID [2022-04-28 03:16:21,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {16229#true} call #t~ret1 := main(); {16229#true} is VALID [2022-04-28 03:16:21,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {16229#true} ~x~0 := 0;~y~0 := 50; {16259#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:16:21,246 INFO L290 TraceCheckUtils]: 6: Hoare triple {16259#(and (<= main_~x~0 0) (= main_~y~0 50))} [194] L28-2-->L27-2_primed: Formula: (or (and (< v_main_~x~0_1171 v_main_~x~0_1170) (< v_main_~x~0_1170 51)) (and (= v_main_~x~0_1170 v_main_~x~0_1171) (not (< v_main_~x~0_1171 50))) (= v_main_~x~0_1171 v_main_~x~0_1170)) InVars {main_~x~0=v_main_~x~0_1171} OutVars{main_~x~0=v_main_~x~0_1170} AuxVars[] AssignedVars[main_~x~0] {16263#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:16:21,246 INFO L290 TraceCheckUtils]: 7: Hoare triple {16263#(and (= main_~y~0 50) (< main_~x~0 51))} [195] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16263#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:16:21,247 INFO L290 TraceCheckUtils]: 8: Hoare triple {16263#(and (= main_~y~0 50) (< main_~x~0 51))} [196] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_865 v_main_~y~0_864)) (.cse1 (= v_main_~x~0_1173 v_main_~x~0_1172)) (.cse2 (<= 50 v_main_~x~0_1173))) (or (and .cse0 .cse1) (and .cse0 (or (not .cse2) (not (< v_main_~x~0_1173 100))) .cse1) (and (= (+ v_main_~x~0_1173 v_main_~y~0_864) (+ v_main_~x~0_1172 v_main_~y~0_865)) .cse2 (< v_main_~x~0_1172 101) (< v_main_~x~0_1173 v_main_~x~0_1172)))) InVars {main_~x~0=v_main_~x~0_1173, main_~y~0=v_main_~y~0_865} OutVars{main_~x~0=v_main_~x~0_1172, main_~y~0=v_main_~y~0_864} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {16270#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:16:21,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {16270#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [193] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {16237#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:16:21,248 INFO L272 TraceCheckUtils]: 10: Hoare triple {16237#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {16277#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:16:21,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {16277#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16281#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:16:21,249 INFO L290 TraceCheckUtils]: 12: Hoare triple {16281#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16230#false} is VALID [2022-04-28 03:16:21,249 INFO L290 TraceCheckUtils]: 13: Hoare triple {16230#false} assume !false; {16230#false} is VALID [2022-04-28 03:16:21,249 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:21,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:16:21,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {16230#false} assume !false; {16230#false} is VALID [2022-04-28 03:16:21,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {16281#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16230#false} is VALID [2022-04-28 03:16:21,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {16277#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16281#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:16:21,739 INFO L272 TraceCheckUtils]: 10: Hoare triple {16237#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {16277#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:16:21,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {16300#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [193] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {16237#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:16:21,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {16304#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [196] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_865 v_main_~y~0_864)) (.cse1 (= v_main_~x~0_1173 v_main_~x~0_1172)) (.cse2 (<= 50 v_main_~x~0_1173))) (or (and .cse0 .cse1) (and .cse0 (or (not .cse2) (not (< v_main_~x~0_1173 100))) .cse1) (and (= (+ v_main_~x~0_1173 v_main_~y~0_864) (+ v_main_~x~0_1172 v_main_~y~0_865)) .cse2 (< v_main_~x~0_1172 101) (< v_main_~x~0_1173 v_main_~x~0_1172)))) InVars {main_~x~0=v_main_~x~0_1173, main_~y~0=v_main_~y~0_865} OutVars{main_~x~0=v_main_~x~0_1172, main_~y~0=v_main_~y~0_864} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {16300#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:16:21,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {16304#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [195] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16304#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:16:21,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {16311#(and (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)) (or (and (< main_~x~0 (+ main_~y~0 1)) (<= 50 main_~y~0)) (<= 99 main_~y~0)))} [194] L28-2-->L27-2_primed: Formula: (or (and (< v_main_~x~0_1171 v_main_~x~0_1170) (< v_main_~x~0_1170 51)) (and (= v_main_~x~0_1170 v_main_~x~0_1171) (not (< v_main_~x~0_1171 50))) (= v_main_~x~0_1171 v_main_~x~0_1170)) InVars {main_~x~0=v_main_~x~0_1171} OutVars{main_~x~0=v_main_~x~0_1170} AuxVars[] AssignedVars[main_~x~0] {16304#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:16:21,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {16229#true} ~x~0 := 0;~y~0 := 50; {16311#(and (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)) (or (and (< main_~x~0 (+ main_~y~0 1)) (<= 50 main_~y~0)) (<= 99 main_~y~0)))} is VALID [2022-04-28 03:16:21,743 INFO L272 TraceCheckUtils]: 4: Hoare triple {16229#true} call #t~ret1 := main(); {16229#true} is VALID [2022-04-28 03:16:21,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16229#true} {16229#true} #56#return; {16229#true} is VALID [2022-04-28 03:16:21,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {16229#true} assume true; {16229#true} is VALID [2022-04-28 03:16:21,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {16229#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); {16229#true} is VALID [2022-04-28 03:16:21,743 INFO L272 TraceCheckUtils]: 0: Hoare triple {16229#true} call ULTIMATE.init(); {16229#true} is VALID [2022-04-28 03:16:21,744 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:21,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117171779] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:16:21,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:16:21,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:16:23,286 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:16:23,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [86328947] [2022-04-28 03:16:23,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [86328947] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:16:23,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:16:23,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-28 03:16:23,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193280083] [2022-04-28 03:16:23,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:16:23,287 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 40 states have internal predecessors, (77), 2 states have call successors, (3), 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 81 [2022-04-28 03:16:23,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:16:23,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 40 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call 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:23,348 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:16:23,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-28 03:16:23,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:23,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-28 03:16:23,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=2429, Unknown=0, NotChecked=0, Total=2756 [2022-04-28 03:16:23,350 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 40 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call 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:28,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:28,768 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2022-04-28 03:16:28,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-28 03:16:28,768 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 40 states have internal predecessors, (77), 2 states have call successors, (3), 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 81 [2022-04-28 03:16:28,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:16:28,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 40 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call 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:28,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 97 transitions. [2022-04-28 03:16:28,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 40 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call 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:28,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 97 transitions. [2022-04-28 03:16:28,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 97 transitions. [2022-04-28 03:16:28,850 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:16:28,851 INFO L225 Difference]: With dead ends: 92 [2022-04-28 03:16:28,851 INFO L226 Difference]: Without dead ends: 85 [2022-04-28 03:16:28,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1578 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=657, Invalid=7175, Unknown=0, NotChecked=0, Total=7832 [2022-04-28 03:16:28,852 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 44 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 3006 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 3047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 3006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:16:28,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 203 Invalid, 3047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 3006 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 03:16:28,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-28 03:16:28,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-04-28 03:16:28,987 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:16:28,987 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 85 states, 80 states have (on average 1.0375) internal successors, (83), 80 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:16:28,988 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 85 states, 80 states have (on average 1.0375) internal successors, (83), 80 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:16:28,988 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 85 states, 80 states have (on average 1.0375) internal successors, (83), 80 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:16:28,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:28,989 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2022-04-28 03:16:28,989 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2022-04-28 03:16:28,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:28,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:28,989 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 80 states have (on average 1.0375) internal successors, (83), 80 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 85 states. [2022-04-28 03:16:28,989 INFO L87 Difference]: Start difference. First operand has 85 states, 80 states have (on average 1.0375) internal successors, (83), 80 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 85 states. [2022-04-28 03:16:28,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:28,990 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2022-04-28 03:16:28,990 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2022-04-28 03:16:28,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:28,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:28,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:16:28,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:16:28,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 80 states have (on average 1.0375) internal successors, (83), 80 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:16:28,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 87 transitions. [2022-04-28 03:16:28,992 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 87 transitions. Word has length 81 [2022-04-28 03:16:28,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:16:28,992 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 87 transitions. [2022-04-28 03:16:28,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 40 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call 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:28,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 87 transitions. [2022-04-28 03:16:29,060 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:16:29,060 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2022-04-28 03:16:29,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-28 03:16:29,061 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:16:29,061 INFO L195 NwaCegarLoop]: trace histogram [36, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:16:29,081 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:29,275 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,SelfDestructingSolverStorable36 [2022-04-28 03:16:29,276 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:16:29,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:16:29,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1614571428, now seen corresponding path program 35 times [2022-04-28 03:16:29,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:29,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1384679899] [2022-04-28 03:16:29,376 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:16:29,569 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:16:29,570 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:16:29,572 INFO L85 PathProgramCache]: Analyzing trace with hash -74525492, now seen corresponding path program 1 times [2022-04-28 03:16:29,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:16:29,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886751021] [2022-04-28 03:16:29,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:16:29,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:16:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:29,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:16:29,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:29,678 INFO L290 TraceCheckUtils]: 0: Hoare triple {16975#(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); {16964#true} is VALID [2022-04-28 03:16:29,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {16964#true} assume true; {16964#true} is VALID [2022-04-28 03:16:29,678 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16964#true} {16964#true} #56#return; {16964#true} is VALID [2022-04-28 03:16:29,679 INFO L272 TraceCheckUtils]: 0: Hoare triple {16964#true} call ULTIMATE.init(); {16975#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:16:29,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {16975#(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); {16964#true} is VALID [2022-04-28 03:16:29,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {16964#true} assume true; {16964#true} is VALID [2022-04-28 03:16:29,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16964#true} {16964#true} #56#return; {16964#true} is VALID [2022-04-28 03:16:29,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {16964#true} call #t~ret1 := main(); {16964#true} is VALID [2022-04-28 03:16:29,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {16964#true} ~x~0 := 0;~y~0 := 50; {16969#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:16:29,680 INFO L290 TraceCheckUtils]: 6: Hoare triple {16969#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [198] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1223 v_main_~x~0_1222))) (or (and (< v_main_~x~0_1223 v_main_~x~0_1222) (< v_main_~x~0_1222 51)) (and .cse0 (<= 50 v_main_~x~0_1223)) .cse0)) InVars {main_~x~0=v_main_~x~0_1223} OutVars{main_~x~0=v_main_~x~0_1222} AuxVars[] AssignedVars[main_~x~0] {16970#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:16:29,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {16970#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [199] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16970#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:16:29,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {16970#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [200] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1225 v_main_~x~0_1224)) (.cse1 (= v_main_~y~0_908 v_main_~y~0_907)) (.cse2 (<= 50 v_main_~x~0_1225))) (or (and .cse0 .cse1) (let ((.cse3 (+ v_main_~x~0_1225 v_main_~y~0_907))) (and .cse2 (< .cse3 (+ 101 v_main_~y~0_908)) (< v_main_~y~0_908 v_main_~y~0_907) (= .cse3 (+ v_main_~x~0_1224 v_main_~y~0_908)))) (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_1225 100)))))) InVars {main_~x~0=v_main_~x~0_1225, main_~y~0=v_main_~y~0_908} OutVars{main_~x~0=v_main_~x~0_1224, main_~y~0=v_main_~y~0_907} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {16971#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:16:29,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {16971#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} [197] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {16972#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:16:29,683 INFO L272 TraceCheckUtils]: 10: Hoare triple {16972#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {16973#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:16:29,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {16973#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {16974#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:16:29,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {16974#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {16965#false} is VALID [2022-04-28 03:16:29,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {16965#false} assume !false; {16965#false} is VALID [2022-04-28 03:16:29,684 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:29,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:16:29,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886751021] [2022-04-28 03:16:29,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886751021] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:16:29,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304308611] [2022-04-28 03:16:29,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:16:29,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:16:29,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:16:29,688 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:29,723 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:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:29,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:16:29,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:29,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:16:30,033 INFO L272 TraceCheckUtils]: 0: Hoare triple {16964#true} call ULTIMATE.init(); {16964#true} is VALID [2022-04-28 03:16:30,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {16964#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); {16964#true} is VALID [2022-04-28 03:16:30,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {16964#true} assume true; {16964#true} is VALID [2022-04-28 03:16:30,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16964#true} {16964#true} #56#return; {16964#true} is VALID [2022-04-28 03:16:30,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {16964#true} call #t~ret1 := main(); {16964#true} is VALID [2022-04-28 03:16:30,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {16964#true} ~x~0 := 0;~y~0 := 50; {16994#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:16:30,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {16994#(and (<= main_~x~0 0) (= main_~y~0 50))} [198] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1223 v_main_~x~0_1222))) (or (and (< v_main_~x~0_1223 v_main_~x~0_1222) (< v_main_~x~0_1222 51)) (and .cse0 (<= 50 v_main_~x~0_1223)) .cse0)) InVars {main_~x~0=v_main_~x~0_1223} OutVars{main_~x~0=v_main_~x~0_1222} AuxVars[] AssignedVars[main_~x~0] {16998#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:16:30,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {16998#(and (= main_~y~0 50) (< main_~x~0 51))} [199] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16998#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:16:30,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {16998#(and (= main_~y~0 50) (< main_~x~0 51))} [200] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1225 v_main_~x~0_1224)) (.cse1 (= v_main_~y~0_908 v_main_~y~0_907)) (.cse2 (<= 50 v_main_~x~0_1225))) (or (and .cse0 .cse1) (let ((.cse3 (+ v_main_~x~0_1225 v_main_~y~0_907))) (and .cse2 (< .cse3 (+ 101 v_main_~y~0_908)) (< v_main_~y~0_908 v_main_~y~0_907) (= .cse3 (+ v_main_~x~0_1224 v_main_~y~0_908)))) (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_1225 100)))))) InVars {main_~x~0=v_main_~x~0_1225, main_~y~0=v_main_~y~0_908} OutVars{main_~x~0=v_main_~x~0_1224, main_~y~0=v_main_~y~0_907} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {17005#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:16:30,037 INFO L290 TraceCheckUtils]: 9: Hoare triple {17005#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [197] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {16972#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:16:30,037 INFO L272 TraceCheckUtils]: 10: Hoare triple {16972#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {17012#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:16:30,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {17012#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17016#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:16:30,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {17016#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16965#false} is VALID [2022-04-28 03:16:30,038 INFO L290 TraceCheckUtils]: 13: Hoare triple {16965#false} assume !false; {16965#false} is VALID [2022-04-28 03:16:30,038 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,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:16:30,469 INFO L290 TraceCheckUtils]: 13: Hoare triple {16965#false} assume !false; {16965#false} is VALID [2022-04-28 03:16:30,469 INFO L290 TraceCheckUtils]: 12: Hoare triple {17016#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16965#false} is VALID [2022-04-28 03:16:30,470 INFO L290 TraceCheckUtils]: 11: Hoare triple {17012#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17016#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:16:30,470 INFO L272 TraceCheckUtils]: 10: Hoare triple {16972#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {17012#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:16:30,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {17035#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [197] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {16972#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:16:30,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {17039#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [200] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1225 v_main_~x~0_1224)) (.cse1 (= v_main_~y~0_908 v_main_~y~0_907)) (.cse2 (<= 50 v_main_~x~0_1225))) (or (and .cse0 .cse1) (let ((.cse3 (+ v_main_~x~0_1225 v_main_~y~0_907))) (and .cse2 (< .cse3 (+ 101 v_main_~y~0_908)) (< v_main_~y~0_908 v_main_~y~0_907) (= .cse3 (+ v_main_~x~0_1224 v_main_~y~0_908)))) (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_1225 100)))))) InVars {main_~x~0=v_main_~x~0_1225, main_~y~0=v_main_~y~0_908} OutVars{main_~x~0=v_main_~x~0_1224, main_~y~0=v_main_~y~0_907} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {17035#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:16:30,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {17039#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [199] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17039#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:16:30,473 INFO L290 TraceCheckUtils]: 6: Hoare triple {17046#(and (<= 50 main_~y~0) (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [198] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1223 v_main_~x~0_1222))) (or (and (< v_main_~x~0_1223 v_main_~x~0_1222) (< v_main_~x~0_1222 51)) (and .cse0 (<= 50 v_main_~x~0_1223)) .cse0)) InVars {main_~x~0=v_main_~x~0_1223} OutVars{main_~x~0=v_main_~x~0_1222} AuxVars[] AssignedVars[main_~x~0] {17039#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:16:30,474 INFO L290 TraceCheckUtils]: 5: Hoare triple {16964#true} ~x~0 := 0;~y~0 := 50; {17046#(and (<= 50 main_~y~0) (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:16:30,474 INFO L272 TraceCheckUtils]: 4: Hoare triple {16964#true} call #t~ret1 := main(); {16964#true} is VALID [2022-04-28 03:16:30,474 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16964#true} {16964#true} #56#return; {16964#true} is VALID [2022-04-28 03:16:30,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {16964#true} assume true; {16964#true} is VALID [2022-04-28 03:16:30,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {16964#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); {16964#true} is VALID [2022-04-28 03:16:30,474 INFO L272 TraceCheckUtils]: 0: Hoare triple {16964#true} call ULTIMATE.init(); {16964#true} is VALID [2022-04-28 03:16:30,474 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,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304308611] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:16:30,474 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:16:30,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:16:32,066 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:16:32,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1384679899] [2022-04-28 03:16:32,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1384679899] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:16:32,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:16:32,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-28 03:16:32,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915952758] [2022-04-28 03:16:32,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:16:32,067 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.880952380952381) internal successors, (79), 41 states have internal predecessors, (79), 2 states have call successors, (3), 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 83 [2022-04-28 03:16:32,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:16:32,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 42 states have (on average 1.880952380952381) internal successors, (79), 41 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call 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,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:16:32,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-28 03:16:32,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:32,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-28 03:16:32,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=2528, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 03:16:32,142 INFO L87 Difference]: Start difference. First operand 85 states and 87 transitions. Second operand has 43 states, 42 states have (on average 1.880952380952381) internal successors, (79), 41 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call 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:37,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:37,990 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2022-04-28 03:16:37,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-28 03:16:37,990 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.880952380952381) internal successors, (79), 41 states have internal predecessors, (79), 2 states have call successors, (3), 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 83 [2022-04-28 03:16:37,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:16:37,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.880952380952381) internal successors, (79), 41 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call 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:37,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 99 transitions. [2022-04-28 03:16:37,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.880952380952381) internal successors, (79), 41 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call 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:37,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 99 transitions. [2022-04-28 03:16:37,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 99 transitions. [2022-04-28 03:16:38,074 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:16:38,074 INFO L225 Difference]: With dead ends: 94 [2022-04-28 03:16:38,075 INFO L226 Difference]: Without dead ends: 87 [2022-04-28 03:16:38,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1638 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=673, Invalid=7517, Unknown=0, NotChecked=0, Total=8190 [2022-04-28 03:16:38,075 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 45 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 3240 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 3282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 3240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:16:38,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 213 Invalid, 3282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 3240 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-28 03:16:38,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-28 03:16:38,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-04-28 03:16:38,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:16:38,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 87 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 82 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call 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,205 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 87 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 82 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call 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,206 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 87 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 82 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call 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,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:38,207 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2022-04-28 03:16:38,207 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2022-04-28 03:16:38,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:38,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:38,207 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 82 states have internal predecessors, (85), 3 states have call successors, (3), 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:16:38,207 INFO L87 Difference]: Start difference. First operand has 87 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 82 states have internal predecessors, (85), 3 states have call successors, (3), 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:16:38,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:38,208 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2022-04-28 03:16:38,208 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2022-04-28 03:16:38,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:38,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:38,209 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:16:38,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:16:38,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 82 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call 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,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2022-04-28 03:16:38,210 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 83 [2022-04-28 03:16:38,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:16:38,210 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2022-04-28 03:16:38,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.880952380952381) internal successors, (79), 41 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call 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,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 89 transitions. [2022-04-28 03:16:38,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:16:38,291 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2022-04-28 03:16:38,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-28 03:16:38,292 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:16:38,292 INFO L195 NwaCegarLoop]: trace histogram [37, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:16:38,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-04-28 03:16:38,507 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,SelfDestructingSolverStorable37 [2022-04-28 03:16:38,507 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:16:38,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:16:38,508 INFO L85 PathProgramCache]: Analyzing trace with hash -2105346561, now seen corresponding path program 36 times [2022-04-28 03:16:38,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:38,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1761690066] [2022-04-28 03:16:40,305 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:16:40,348 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:16:40,563 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:16:40,564 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:16:40,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1975006668, now seen corresponding path program 1 times [2022-04-28 03:16:40,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:16:40,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312840973] [2022-04-28 03:16:40,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:16:40,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:16:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:40,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:16:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:40,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {17725#(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); {17714#true} is VALID [2022-04-28 03:16:40,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {17714#true} assume true; {17714#true} is VALID [2022-04-28 03:16:40,664 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17714#true} {17714#true} #56#return; {17714#true} is VALID [2022-04-28 03:16:40,664 INFO L272 TraceCheckUtils]: 0: Hoare triple {17714#true} call ULTIMATE.init(); {17725#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:16:40,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {17725#(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); {17714#true} is VALID [2022-04-28 03:16:40,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {17714#true} assume true; {17714#true} is VALID [2022-04-28 03:16:40,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17714#true} {17714#true} #56#return; {17714#true} is VALID [2022-04-28 03:16:40,664 INFO L272 TraceCheckUtils]: 4: Hoare triple {17714#true} call #t~ret1 := main(); {17714#true} is VALID [2022-04-28 03:16:40,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {17714#true} ~x~0 := 0;~y~0 := 50; {17719#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:16:40,665 INFO L290 TraceCheckUtils]: 6: Hoare triple {17719#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [202] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1276 v_main_~x~0_1275))) (or .cse0 (and .cse0 (<= 50 v_main_~x~0_1276)) (and (< v_main_~x~0_1276 v_main_~x~0_1275) (< v_main_~x~0_1275 51)))) InVars {main_~x~0=v_main_~x~0_1276} OutVars{main_~x~0=v_main_~x~0_1275} AuxVars[] AssignedVars[main_~x~0] {17720#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:16:40,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {17720#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [203] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17720#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:16:40,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {17720#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [204] L28-2-->L27-2_primed: Formula: (let ((.cse2 (<= 50 v_main_~x~0_1278)) (.cse0 (= v_main_~y~0_952 v_main_~y~0_951)) (.cse1 (= v_main_~x~0_1278 v_main_~x~0_1277))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_1278 100)) (not .cse2))) (and .cse2 (< v_main_~x~0_1277 101) (= (+ v_main_~x~0_1278 v_main_~y~0_951) (+ v_main_~x~0_1277 v_main_~y~0_952)) (< v_main_~x~0_1278 v_main_~x~0_1277)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1278, main_~y~0=v_main_~y~0_952} OutVars{main_~x~0=v_main_~x~0_1277, main_~y~0=v_main_~y~0_951} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {17721#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:16:40,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {17721#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} [201] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {17722#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:16:40,668 INFO L272 TraceCheckUtils]: 10: Hoare triple {17722#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {17723#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:16:40,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {17723#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {17724#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:16:40,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {17724#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {17715#false} is VALID [2022-04-28 03:16:40,668 INFO L290 TraceCheckUtils]: 13: Hoare triple {17715#false} assume !false; {17715#false} is VALID [2022-04-28 03:16:40,668 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:40,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:16:40,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312840973] [2022-04-28 03:16:40,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312840973] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:16:40,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869075995] [2022-04-28 03:16:40,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:16:40,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:16:40,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:16:40,670 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:40,671 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:40,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:40,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:16:40,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:40,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:16:40,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {17714#true} call ULTIMATE.init(); {17714#true} is VALID [2022-04-28 03:16:40,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {17714#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); {17714#true} is VALID [2022-04-28 03:16:40,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {17714#true} assume true; {17714#true} is VALID [2022-04-28 03:16:40,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17714#true} {17714#true} #56#return; {17714#true} is VALID [2022-04-28 03:16:40,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {17714#true} call #t~ret1 := main(); {17714#true} is VALID [2022-04-28 03:16:40,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {17714#true} ~x~0 := 0;~y~0 := 50; {17744#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:16:40,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {17744#(and (<= main_~x~0 0) (= main_~y~0 50))} [202] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1276 v_main_~x~0_1275))) (or .cse0 (and .cse0 (<= 50 v_main_~x~0_1276)) (and (< v_main_~x~0_1276 v_main_~x~0_1275) (< v_main_~x~0_1275 51)))) InVars {main_~x~0=v_main_~x~0_1276} OutVars{main_~x~0=v_main_~x~0_1275} AuxVars[] AssignedVars[main_~x~0] {17748#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:16:40,976 INFO L290 TraceCheckUtils]: 7: Hoare triple {17748#(and (= main_~y~0 50) (< main_~x~0 51))} [203] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17748#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:16:40,977 INFO L290 TraceCheckUtils]: 8: Hoare triple {17748#(and (= main_~y~0 50) (< main_~x~0 51))} [204] L28-2-->L27-2_primed: Formula: (let ((.cse2 (<= 50 v_main_~x~0_1278)) (.cse0 (= v_main_~y~0_952 v_main_~y~0_951)) (.cse1 (= v_main_~x~0_1278 v_main_~x~0_1277))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_1278 100)) (not .cse2))) (and .cse2 (< v_main_~x~0_1277 101) (= (+ v_main_~x~0_1278 v_main_~y~0_951) (+ v_main_~x~0_1277 v_main_~y~0_952)) (< v_main_~x~0_1278 v_main_~x~0_1277)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1278, main_~y~0=v_main_~y~0_952} OutVars{main_~x~0=v_main_~x~0_1277, main_~y~0=v_main_~y~0_951} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {17755#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:16:40,977 INFO L290 TraceCheckUtils]: 9: Hoare triple {17755#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [201] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {17722#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:16:40,978 INFO L272 TraceCheckUtils]: 10: Hoare triple {17722#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {17762#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:16:40,978 INFO L290 TraceCheckUtils]: 11: Hoare triple {17762#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17766#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:16:40,978 INFO L290 TraceCheckUtils]: 12: Hoare triple {17766#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17715#false} is VALID [2022-04-28 03:16:40,978 INFO L290 TraceCheckUtils]: 13: Hoare triple {17715#false} assume !false; {17715#false} is VALID [2022-04-28 03:16:40,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:16:40,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:16:41,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {17715#false} assume !false; {17715#false} is VALID [2022-04-28 03:16:41,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {17766#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17715#false} is VALID [2022-04-28 03:16:41,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {17762#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17766#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:16:41,414 INFO L272 TraceCheckUtils]: 10: Hoare triple {17722#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {17762#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:16:41,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {17785#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [201] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {17722#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:16:41,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {17789#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [204] L28-2-->L27-2_primed: Formula: (let ((.cse2 (<= 50 v_main_~x~0_1278)) (.cse0 (= v_main_~y~0_952 v_main_~y~0_951)) (.cse1 (= v_main_~x~0_1278 v_main_~x~0_1277))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_1278 100)) (not .cse2))) (and .cse2 (< v_main_~x~0_1277 101) (= (+ v_main_~x~0_1278 v_main_~y~0_951) (+ v_main_~x~0_1277 v_main_~y~0_952)) (< v_main_~x~0_1278 v_main_~x~0_1277)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1278, main_~y~0=v_main_~y~0_952} OutVars{main_~x~0=v_main_~x~0_1277, main_~y~0=v_main_~y~0_951} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {17785#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:16:41,416 INFO L290 TraceCheckUtils]: 7: Hoare triple {17789#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [203] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17789#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:16:41,417 INFO L290 TraceCheckUtils]: 6: Hoare triple {17796#(and (<= 50 main_~y~0) (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [202] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1276 v_main_~x~0_1275))) (or .cse0 (and .cse0 (<= 50 v_main_~x~0_1276)) (and (< v_main_~x~0_1276 v_main_~x~0_1275) (< v_main_~x~0_1275 51)))) InVars {main_~x~0=v_main_~x~0_1276} OutVars{main_~x~0=v_main_~x~0_1275} AuxVars[] AssignedVars[main_~x~0] {17789#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:16:41,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {17714#true} ~x~0 := 0;~y~0 := 50; {17796#(and (<= 50 main_~y~0) (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:16:41,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {17714#true} call #t~ret1 := main(); {17714#true} is VALID [2022-04-28 03:16:41,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17714#true} {17714#true} #56#return; {17714#true} is VALID [2022-04-28 03:16:41,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {17714#true} assume true; {17714#true} is VALID [2022-04-28 03:16:41,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {17714#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); {17714#true} is VALID [2022-04-28 03:16:41,417 INFO L272 TraceCheckUtils]: 0: Hoare triple {17714#true} call ULTIMATE.init(); {17714#true} is VALID [2022-04-28 03:16:41,418 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:41,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869075995] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:16:41,418 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:16:41,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:16:43,089 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:16:43,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1761690066] [2022-04-28 03:16:43,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1761690066] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:16:43,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:16:43,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-28 03:16:43,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658520815] [2022-04-28 03:16:43,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:16:43,090 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.8837209302325582) internal successors, (81), 42 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:16:43,090 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:16:43,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 43 states have (on average 1.8837209302325582) internal successors, (81), 42 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:16:43,164 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:16:43,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-28 03:16:43,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:43,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-28 03:16:43,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=2629, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 03:16:43,165 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand has 44 states, 43 states have (on average 1.8837209302325582) internal successors, (81), 42 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:16:49,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:49,279 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2022-04-28 03:16:49,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-28 03:16:49,280 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.8837209302325582) internal successors, (81), 42 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:16:49,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:16:49,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.8837209302325582) internal successors, (81), 42 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:16:49,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 101 transitions. [2022-04-28 03:16:49,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.8837209302325582) internal successors, (81), 42 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:16:49,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 101 transitions. [2022-04-28 03:16:49,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 101 transitions. [2022-04-28 03:16:49,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:16:49,367 INFO L225 Difference]: With dead ends: 96 [2022-04-28 03:16:49,367 INFO L226 Difference]: Without dead ends: 89 [2022-04-28 03:16:49,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1699 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=689, Invalid=7867, Unknown=0, NotChecked=0, Total=8556 [2022-04-28 03:16:49,368 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 46 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 3403 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 3446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 3403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:16:49,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 218 Invalid, 3446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 3403 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-28 03:16:49,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-28 03:16:49,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-04-28 03:16:49,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:16:49,521 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 89 states, 84 states have (on average 1.0357142857142858) internal successors, (87), 84 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call 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:49,521 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 89 states, 84 states have (on average 1.0357142857142858) internal successors, (87), 84 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call 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:49,521 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 89 states, 84 states have (on average 1.0357142857142858) internal successors, (87), 84 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call 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:49,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:49,522 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2022-04-28 03:16:49,522 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2022-04-28 03:16:49,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:49,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:49,523 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 84 states have (on average 1.0357142857142858) internal successors, (87), 84 states have internal predecessors, (87), 3 states have call successors, (3), 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:16:49,523 INFO L87 Difference]: Start difference. First operand has 89 states, 84 states have (on average 1.0357142857142858) internal successors, (87), 84 states have internal predecessors, (87), 3 states have call successors, (3), 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:16:49,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:49,524 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2022-04-28 03:16:49,524 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2022-04-28 03:16:49,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:49,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:49,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:16:49,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:16:49,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 84 states have (on average 1.0357142857142858) internal successors, (87), 84 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call 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:49,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2022-04-28 03:16:49,526 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 85 [2022-04-28 03:16:49,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:16:49,526 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2022-04-28 03:16:49,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.8837209302325582) internal successors, (81), 42 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:16:49,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 91 transitions. [2022-04-28 03:16:49,619 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:16:49,619 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2022-04-28 03:16:49,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-28 03:16:49,620 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:16:49,620 INFO L195 NwaCegarLoop]: trace histogram [38, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:16:49,645 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:16:49,820 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,SelfDestructingSolverStorable38 [2022-04-28 03:16:49,821 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:16:49,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:16:49,821 INFO L85 PathProgramCache]: Analyzing trace with hash 761223578, now seen corresponding path program 37 times [2022-04-28 03:16:49,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:49,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [829992115] [2022-04-28 03:16:53,893 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:16:53,936 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:16:54,118 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:16:54,119 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:16:54,121 INFO L85 PathProgramCache]: Analyzing trace with hash -270428468, now seen corresponding path program 1 times [2022-04-28 03:16:54,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:16:54,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797461918] [2022-04-28 03:16:54,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:16:54,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:16:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:54,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:16:54,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:54,237 INFO L290 TraceCheckUtils]: 0: Hoare triple {18490#(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); {18479#true} is VALID [2022-04-28 03:16:54,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {18479#true} assume true; {18479#true} is VALID [2022-04-28 03:16:54,238 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18479#true} {18479#true} #56#return; {18479#true} is VALID [2022-04-28 03:16:54,238 INFO L272 TraceCheckUtils]: 0: Hoare triple {18479#true} call ULTIMATE.init(); {18490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:16:54,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {18490#(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); {18479#true} is VALID [2022-04-28 03:16:54,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {18479#true} assume true; {18479#true} is VALID [2022-04-28 03:16:54,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18479#true} {18479#true} #56#return; {18479#true} is VALID [2022-04-28 03:16:54,239 INFO L272 TraceCheckUtils]: 4: Hoare triple {18479#true} call #t~ret1 := main(); {18479#true} is VALID [2022-04-28 03:16:54,239 INFO L290 TraceCheckUtils]: 5: Hoare triple {18479#true} ~x~0 := 0;~y~0 := 50; {18484#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:16:54,240 INFO L290 TraceCheckUtils]: 6: Hoare triple {18484#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [206] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1330 v_main_~x~0_1329))) (or .cse0 (and (< v_main_~x~0_1330 v_main_~x~0_1329) (< v_main_~x~0_1329 51)) (and .cse0 (<= 50 v_main_~x~0_1330)))) InVars {main_~x~0=v_main_~x~0_1330} OutVars{main_~x~0=v_main_~x~0_1329} AuxVars[] AssignedVars[main_~x~0] {18485#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:16:54,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {18485#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [207] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18485#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:16:54,241 INFO L290 TraceCheckUtils]: 8: Hoare triple {18485#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [208] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1332 v_main_~x~0_1331)) (.cse1 (= v_main_~y~0_997 v_main_~y~0_996)) (.cse2 (<= 50 v_main_~x~0_1332))) (or (and .cse0 .cse1) (and (or (not (< v_main_~x~0_1332 100)) (not .cse2)) .cse0 .cse1) (and .cse2 (= (+ v_main_~x~0_1331 v_main_~y~0_997) (+ v_main_~x~0_1332 v_main_~y~0_996)) (< v_main_~x~0_1331 101) (< v_main_~x~0_1332 v_main_~x~0_1331)))) InVars {main_~x~0=v_main_~x~0_1332, main_~y~0=v_main_~y~0_997} OutVars{main_~x~0=v_main_~x~0_1331, main_~y~0=v_main_~y~0_996} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {18486#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:16:54,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {18486#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} [205] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {18487#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:16:54,242 INFO L272 TraceCheckUtils]: 10: Hoare triple {18487#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {18488#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:16:54,242 INFO L290 TraceCheckUtils]: 11: Hoare triple {18488#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {18489#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:16:54,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {18489#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {18480#false} is VALID [2022-04-28 03:16:54,243 INFO L290 TraceCheckUtils]: 13: Hoare triple {18480#false} assume !false; {18480#false} is VALID [2022-04-28 03:16:54,243 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:54,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:16:54,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797461918] [2022-04-28 03:16:54,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797461918] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:16:54,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888276515] [2022-04-28 03:16:54,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:16:54,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:16:54,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:16:54,244 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:16:54,245 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:16:54,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:54,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:16:54,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:54,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:16:54,541 INFO L272 TraceCheckUtils]: 0: Hoare triple {18479#true} call ULTIMATE.init(); {18479#true} is VALID [2022-04-28 03:16:54,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {18479#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); {18479#true} is VALID [2022-04-28 03:16:54,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {18479#true} assume true; {18479#true} is VALID [2022-04-28 03:16:54,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18479#true} {18479#true} #56#return; {18479#true} is VALID [2022-04-28 03:16:54,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {18479#true} call #t~ret1 := main(); {18479#true} is VALID [2022-04-28 03:16:54,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {18479#true} ~x~0 := 0;~y~0 := 50; {18509#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:16:54,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {18509#(and (<= main_~x~0 0) (= main_~y~0 50))} [206] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1330 v_main_~x~0_1329))) (or .cse0 (and (< v_main_~x~0_1330 v_main_~x~0_1329) (< v_main_~x~0_1329 51)) (and .cse0 (<= 50 v_main_~x~0_1330)))) InVars {main_~x~0=v_main_~x~0_1330} OutVars{main_~x~0=v_main_~x~0_1329} AuxVars[] AssignedVars[main_~x~0] {18513#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:16:54,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {18513#(and (= main_~y~0 50) (< main_~x~0 51))} [207] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18513#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:16:54,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {18513#(and (= main_~y~0 50) (< main_~x~0 51))} [208] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1332 v_main_~x~0_1331)) (.cse1 (= v_main_~y~0_997 v_main_~y~0_996)) (.cse2 (<= 50 v_main_~x~0_1332))) (or (and .cse0 .cse1) (and (or (not (< v_main_~x~0_1332 100)) (not .cse2)) .cse0 .cse1) (and .cse2 (= (+ v_main_~x~0_1331 v_main_~y~0_997) (+ v_main_~x~0_1332 v_main_~y~0_996)) (< v_main_~x~0_1331 101) (< v_main_~x~0_1332 v_main_~x~0_1331)))) InVars {main_~x~0=v_main_~x~0_1332, main_~y~0=v_main_~y~0_997} OutVars{main_~x~0=v_main_~x~0_1331, main_~y~0=v_main_~y~0_996} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {18520#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:16:54,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {18520#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [205] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {18487#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:16:54,545 INFO L272 TraceCheckUtils]: 10: Hoare triple {18487#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {18527#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:16:54,545 INFO L290 TraceCheckUtils]: 11: Hoare triple {18527#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18531#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:16:54,546 INFO L290 TraceCheckUtils]: 12: Hoare triple {18531#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18480#false} is VALID [2022-04-28 03:16:54,546 INFO L290 TraceCheckUtils]: 13: Hoare triple {18480#false} assume !false; {18480#false} is VALID [2022-04-28 03:16:54,546 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:54,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:16:55,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {18480#false} assume !false; {18480#false} is VALID [2022-04-28 03:16:55,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {18531#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18480#false} is VALID [2022-04-28 03:16:55,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {18527#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18531#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:16:55,021 INFO L272 TraceCheckUtils]: 10: Hoare triple {18487#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {18527#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:16:55,021 INFO L290 TraceCheckUtils]: 9: Hoare triple {18550#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [205] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {18487#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:16:55,022 INFO L290 TraceCheckUtils]: 8: Hoare triple {18554#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [208] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1332 v_main_~x~0_1331)) (.cse1 (= v_main_~y~0_997 v_main_~y~0_996)) (.cse2 (<= 50 v_main_~x~0_1332))) (or (and .cse0 .cse1) (and (or (not (< v_main_~x~0_1332 100)) (not .cse2)) .cse0 .cse1) (and .cse2 (= (+ v_main_~x~0_1331 v_main_~y~0_997) (+ v_main_~x~0_1332 v_main_~y~0_996)) (< v_main_~x~0_1331 101) (< v_main_~x~0_1332 v_main_~x~0_1331)))) InVars {main_~x~0=v_main_~x~0_1332, main_~y~0=v_main_~y~0_997} OutVars{main_~x~0=v_main_~x~0_1331, main_~y~0=v_main_~y~0_996} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {18550#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:16:55,023 INFO L290 TraceCheckUtils]: 7: Hoare triple {18554#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [207] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18554#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:16:55,024 INFO L290 TraceCheckUtils]: 6: Hoare triple {18561#(and (<= 50 main_~y~0) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))) (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [206] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1330 v_main_~x~0_1329))) (or .cse0 (and (< v_main_~x~0_1330 v_main_~x~0_1329) (< v_main_~x~0_1329 51)) (and .cse0 (<= 50 v_main_~x~0_1330)))) InVars {main_~x~0=v_main_~x~0_1330} OutVars{main_~x~0=v_main_~x~0_1329} AuxVars[] AssignedVars[main_~x~0] {18554#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:16:55,024 INFO L290 TraceCheckUtils]: 5: Hoare triple {18479#true} ~x~0 := 0;~y~0 := 50; {18561#(and (<= 50 main_~y~0) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))) (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:16:55,024 INFO L272 TraceCheckUtils]: 4: Hoare triple {18479#true} call #t~ret1 := main(); {18479#true} is VALID [2022-04-28 03:16:55,024 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18479#true} {18479#true} #56#return; {18479#true} is VALID [2022-04-28 03:16:55,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {18479#true} assume true; {18479#true} is VALID [2022-04-28 03:16:55,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {18479#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); {18479#true} is VALID [2022-04-28 03:16:55,025 INFO L272 TraceCheckUtils]: 0: Hoare triple {18479#true} call ULTIMATE.init(); {18479#true} is VALID [2022-04-28 03:16:55,025 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:55,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888276515] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:16:55,025 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:16:55,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:16:56,792 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:16:56,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [829992115] [2022-04-28 03:16:56,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [829992115] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:16:56,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:16:56,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-04-28 03:16:56,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846894446] [2022-04-28 03:16:56,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:16:56,793 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 43 states have internal predecessors, (83), 2 states have call successors, (3), 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 87 [2022-04-28 03:16:56,793 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:16:56,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 45 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 43 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call 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,859 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:16:56,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-04-28 03:16:56,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:56,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-04-28 03:16:56,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=2732, Unknown=0, NotChecked=0, Total=3080 [2022-04-28 03:16:56,860 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. Second operand has 45 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 43 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call 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:03,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:03,119 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2022-04-28 03:17:03,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-28 03:17:03,120 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 43 states have internal predecessors, (83), 2 states have call successors, (3), 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 87 [2022-04-28 03:17:03,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:17:03,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 43 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call 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:03,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 103 transitions. [2022-04-28 03:17:03,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 43 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call 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:03,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 103 transitions. [2022-04-28 03:17:03,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 103 transitions. [2022-04-28 03:17:03,234 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:17:03,235 INFO L225 Difference]: With dead ends: 98 [2022-04-28 03:17:03,235 INFO L226 Difference]: Without dead ends: 91 [2022-04-28 03:17:03,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1761 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=705, Invalid=8225, Unknown=0, NotChecked=0, Total=8930 [2022-04-28 03:17:03,236 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 47 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 3489 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 3533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 3489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:17:03,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 218 Invalid, 3533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 3489 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-28 03:17:03,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-28 03:17:03,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-04-28 03:17:03,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:17:03,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 91 states, 86 states have (on average 1.0348837209302326) internal successors, (89), 86 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:17:03,370 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 91 states, 86 states have (on average 1.0348837209302326) internal successors, (89), 86 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:17:03,370 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 91 states, 86 states have (on average 1.0348837209302326) internal successors, (89), 86 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:17:03,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:03,371 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2022-04-28 03:17:03,371 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2022-04-28 03:17:03,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:03,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:03,372 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 86 states have (on average 1.0348837209302326) internal successors, (89), 86 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 91 states. [2022-04-28 03:17:03,372 INFO L87 Difference]: Start difference. First operand has 91 states, 86 states have (on average 1.0348837209302326) internal successors, (89), 86 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 91 states. [2022-04-28 03:17:03,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:03,373 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2022-04-28 03:17:03,373 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2022-04-28 03:17:03,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:03,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:03,374 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:17:03,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:17:03,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.0348837209302326) internal successors, (89), 86 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:17:03,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2022-04-28 03:17:03,375 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 93 transitions. Word has length 87 [2022-04-28 03:17:03,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:17:03,375 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 93 transitions. [2022-04-28 03:17:03,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 43 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call 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:03,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 93 transitions. [2022-04-28 03:17:03,457 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:17:03,457 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2022-04-28 03:17:03,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-28 03:17:03,457 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:17:03,457 INFO L195 NwaCegarLoop]: trace histogram [39, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:17:03,474 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:03,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-28 03:17:03,658 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:17:03,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:17:03,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1833876875, now seen corresponding path program 38 times [2022-04-28 03:17:03,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:03,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [348676601] [2022-04-28 03:17:07,724 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:17:07,774 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:17:08,046 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:17:08,047 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:17:08,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1779103692, now seen corresponding path program 1 times [2022-04-28 03:17:08,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:17:08,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406238553] [2022-04-28 03:17:08,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:17:08,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:17:08,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:08,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:17:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:08,159 INFO L290 TraceCheckUtils]: 0: Hoare triple {19270#(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); {19259#true} is VALID [2022-04-28 03:17:08,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {19259#true} assume true; {19259#true} is VALID [2022-04-28 03:17:08,159 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19259#true} {19259#true} #56#return; {19259#true} is VALID [2022-04-28 03:17:08,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {19259#true} call ULTIMATE.init(); {19270#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:17:08,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {19270#(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); {19259#true} is VALID [2022-04-28 03:17:08,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {19259#true} assume true; {19259#true} is VALID [2022-04-28 03:17:08,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19259#true} {19259#true} #56#return; {19259#true} is VALID [2022-04-28 03:17:08,160 INFO L272 TraceCheckUtils]: 4: Hoare triple {19259#true} call #t~ret1 := main(); {19259#true} is VALID [2022-04-28 03:17:08,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {19259#true} ~x~0 := 0;~y~0 := 50; {19264#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:17:08,161 INFO L290 TraceCheckUtils]: 6: Hoare triple {19264#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [210] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1385 v_main_~x~0_1384))) (or .cse0 (and (< v_main_~x~0_1384 51) (< v_main_~x~0_1385 v_main_~x~0_1384)) (and .cse0 (not (< v_main_~x~0_1385 50))))) InVars {main_~x~0=v_main_~x~0_1385} OutVars{main_~x~0=v_main_~x~0_1384} AuxVars[] AssignedVars[main_~x~0] {19265#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:17:08,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {19265#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [211] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19265#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:17:08,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {19265#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [212] L28-2-->L27-2_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_1387)) (.cse1 (= v_main_~y~0_1043 v_main_~y~0_1042)) (.cse2 (= v_main_~x~0_1387 v_main_~x~0_1386))) (or (and (or (not .cse0) (not (< v_main_~x~0_1387 100))) .cse1 .cse2) (and (< v_main_~x~0_1386 101) (< v_main_~x~0_1387 v_main_~x~0_1386) .cse0 (= (+ v_main_~x~0_1387 v_main_~y~0_1042) (+ v_main_~x~0_1386 v_main_~y~0_1043))) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_1387, main_~y~0=v_main_~y~0_1043} OutVars{main_~x~0=v_main_~x~0_1386, main_~y~0=v_main_~y~0_1042} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {19266#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:17:08,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {19266#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} [209] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {19267#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:17:08,163 INFO L272 TraceCheckUtils]: 10: Hoare triple {19267#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {19268#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:17:08,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {19268#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {19269#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:17:08,164 INFO L290 TraceCheckUtils]: 12: Hoare triple {19269#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {19260#false} is VALID [2022-04-28 03:17:08,164 INFO L290 TraceCheckUtils]: 13: Hoare triple {19260#false} assume !false; {19260#false} is VALID [2022-04-28 03:17:08,164 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:08,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:17:08,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406238553] [2022-04-28 03:17:08,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406238553] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:17:08,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856809509] [2022-04-28 03:17:08,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:17:08,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:17:08,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:17:08,165 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:08,166 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:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:08,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:17:08,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:08,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:17:08,491 INFO L272 TraceCheckUtils]: 0: Hoare triple {19259#true} call ULTIMATE.init(); {19259#true} is VALID [2022-04-28 03:17:08,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {19259#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); {19259#true} is VALID [2022-04-28 03:17:08,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {19259#true} assume true; {19259#true} is VALID [2022-04-28 03:17:08,491 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19259#true} {19259#true} #56#return; {19259#true} is VALID [2022-04-28 03:17:08,491 INFO L272 TraceCheckUtils]: 4: Hoare triple {19259#true} call #t~ret1 := main(); {19259#true} is VALID [2022-04-28 03:17:08,492 INFO L290 TraceCheckUtils]: 5: Hoare triple {19259#true} ~x~0 := 0;~y~0 := 50; {19289#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:17:08,492 INFO L290 TraceCheckUtils]: 6: Hoare triple {19289#(and (<= main_~x~0 0) (= main_~y~0 50))} [210] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1385 v_main_~x~0_1384))) (or .cse0 (and (< v_main_~x~0_1384 51) (< v_main_~x~0_1385 v_main_~x~0_1384)) (and .cse0 (not (< v_main_~x~0_1385 50))))) InVars {main_~x~0=v_main_~x~0_1385} OutVars{main_~x~0=v_main_~x~0_1384} AuxVars[] AssignedVars[main_~x~0] {19293#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:17:08,492 INFO L290 TraceCheckUtils]: 7: Hoare triple {19293#(and (= main_~y~0 50) (< main_~x~0 51))} [211] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19293#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:17:08,493 INFO L290 TraceCheckUtils]: 8: Hoare triple {19293#(and (= main_~y~0 50) (< main_~x~0 51))} [212] L28-2-->L27-2_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_1387)) (.cse1 (= v_main_~y~0_1043 v_main_~y~0_1042)) (.cse2 (= v_main_~x~0_1387 v_main_~x~0_1386))) (or (and (or (not .cse0) (not (< v_main_~x~0_1387 100))) .cse1 .cse2) (and (< v_main_~x~0_1386 101) (< v_main_~x~0_1387 v_main_~x~0_1386) .cse0 (= (+ v_main_~x~0_1387 v_main_~y~0_1042) (+ v_main_~x~0_1386 v_main_~y~0_1043))) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_1387, main_~y~0=v_main_~y~0_1043} OutVars{main_~x~0=v_main_~x~0_1386, main_~y~0=v_main_~y~0_1042} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {19300#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:17:08,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {19300#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [209] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {19267#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:17:08,494 INFO L272 TraceCheckUtils]: 10: Hoare triple {19267#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {19307#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:17:08,495 INFO L290 TraceCheckUtils]: 11: Hoare triple {19307#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19311#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:17:08,495 INFO L290 TraceCheckUtils]: 12: Hoare triple {19311#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19260#false} is VALID [2022-04-28 03:17:08,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {19260#false} assume !false; {19260#false} is VALID [2022-04-28 03:17:08,495 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:08,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:17:08,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {19260#false} assume !false; {19260#false} is VALID [2022-04-28 03:17:08,934 INFO L290 TraceCheckUtils]: 12: Hoare triple {19311#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19260#false} is VALID [2022-04-28 03:17:08,934 INFO L290 TraceCheckUtils]: 11: Hoare triple {19307#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19311#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:17:08,935 INFO L272 TraceCheckUtils]: 10: Hoare triple {19267#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {19307#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:17:08,935 INFO L290 TraceCheckUtils]: 9: Hoare triple {19330#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [209] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {19267#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:17:08,936 INFO L290 TraceCheckUtils]: 8: Hoare triple {19334#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (< main_~x~0 (+ main_~y~0 1)) (not (<= 50 main_~x~0)) (<= 99 main_~y~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [212] L28-2-->L27-2_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_1387)) (.cse1 (= v_main_~y~0_1043 v_main_~y~0_1042)) (.cse2 (= v_main_~x~0_1387 v_main_~x~0_1386))) (or (and (or (not .cse0) (not (< v_main_~x~0_1387 100))) .cse1 .cse2) (and (< v_main_~x~0_1386 101) (< v_main_~x~0_1387 v_main_~x~0_1386) .cse0 (= (+ v_main_~x~0_1387 v_main_~y~0_1042) (+ v_main_~x~0_1386 v_main_~y~0_1043))) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_1387, main_~y~0=v_main_~y~0_1043} OutVars{main_~x~0=v_main_~x~0_1386, main_~y~0=v_main_~y~0_1042} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {19330#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:17:08,937 INFO L290 TraceCheckUtils]: 7: Hoare triple {19334#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (< main_~x~0 (+ main_~y~0 1)) (not (<= 50 main_~x~0)) (<= 99 main_~y~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [211] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19334#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (< main_~x~0 (+ main_~y~0 1)) (not (<= 50 main_~x~0)) (<= 99 main_~y~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:17:08,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {19341#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (<= 50 main_~y~0) (<= main_~y~0 100) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [210] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1385 v_main_~x~0_1384))) (or .cse0 (and (< v_main_~x~0_1384 51) (< v_main_~x~0_1385 v_main_~x~0_1384)) (and .cse0 (not (< v_main_~x~0_1385 50))))) InVars {main_~x~0=v_main_~x~0_1385} OutVars{main_~x~0=v_main_~x~0_1384} AuxVars[] AssignedVars[main_~x~0] {19334#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (< main_~x~0 (+ main_~y~0 1)) (not (<= 50 main_~x~0)) (<= 99 main_~y~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:17:08,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {19259#true} ~x~0 := 0;~y~0 := 50; {19341#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (<= 50 main_~y~0) (<= main_~y~0 100) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:17:08,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {19259#true} call #t~ret1 := main(); {19259#true} is VALID [2022-04-28 03:17:08,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19259#true} {19259#true} #56#return; {19259#true} is VALID [2022-04-28 03:17:08,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {19259#true} assume true; {19259#true} is VALID [2022-04-28 03:17:08,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {19259#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); {19259#true} is VALID [2022-04-28 03:17:08,939 INFO L272 TraceCheckUtils]: 0: Hoare triple {19259#true} call ULTIMATE.init(); {19259#true} is VALID [2022-04-28 03:17:08,939 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:08,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856809509] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:17:08,939 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:17:08,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:17:10,689 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:17:10,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [348676601] [2022-04-28 03:17:10,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [348676601] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:17:10,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:17:10,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-28 03:17:10,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506240494] [2022-04-28 03:17:10,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:17:10,690 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 44 states have internal predecessors, (85), 2 states have call successors, (3), 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 89 [2022-04-28 03:17:10,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:17:10,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 44 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call 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,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:17:10,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-28 03:17:10,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:10,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-28 03:17:10,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=2837, Unknown=0, NotChecked=0, Total=3192 [2022-04-28 03:17:10,766 INFO L87 Difference]: Start difference. First operand 91 states and 93 transitions. Second operand has 46 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 44 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call 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:17,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:17,381 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2022-04-28 03:17:17,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-28 03:17:17,382 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 44 states have internal predecessors, (85), 2 states have call successors, (3), 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 89 [2022-04-28 03:17:17,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:17:17,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 44 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call 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:17,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 105 transitions. [2022-04-28 03:17:17,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 44 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call 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:17,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 105 transitions. [2022-04-28 03:17:17,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 105 transitions. [2022-04-28 03:17:17,473 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:17:17,474 INFO L225 Difference]: With dead ends: 100 [2022-04-28 03:17:17,474 INFO L226 Difference]: Without dead ends: 93 [2022-04-28 03:17:17,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1824 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=721, Invalid=8591, Unknown=0, NotChecked=0, Total=9312 [2022-04-28 03:17:17,475 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 48 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 3741 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 3786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 3741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:17:17,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 228 Invalid, 3786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 3741 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-04-28 03:17:17,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-28 03:17:17,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-28 03:17:17,624 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:17:17,624 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 88 states have (on average 1.0340909090909092) internal successors, (91), 88 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call 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:17,624 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 88 states have (on average 1.0340909090909092) internal successors, (91), 88 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call 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:17,624 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 88 states have (on average 1.0340909090909092) internal successors, (91), 88 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call 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:17,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:17,625 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2022-04-28 03:17:17,625 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2022-04-28 03:17:17,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:17,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:17,626 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 88 states have (on average 1.0340909090909092) internal successors, (91), 88 states have internal predecessors, (91), 3 states have call successors, (3), 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:17:17,626 INFO L87 Difference]: Start difference. First operand has 93 states, 88 states have (on average 1.0340909090909092) internal successors, (91), 88 states have internal predecessors, (91), 3 states have call successors, (3), 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:17:17,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:17,627 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2022-04-28 03:17:17,627 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2022-04-28 03:17:17,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:17,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:17,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:17:17,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:17:17,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 88 states have (on average 1.0340909090909092) internal successors, (91), 88 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call 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:17,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 95 transitions. [2022-04-28 03:17:17,629 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 95 transitions. Word has length 89 [2022-04-28 03:17:17,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:17:17,629 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 95 transitions. [2022-04-28 03:17:17,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 44 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call 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:17,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 93 states and 95 transitions. [2022-04-28 03:17:17,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:17:17,709 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2022-04-28 03:17:17,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-28 03:17:17,709 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:17:17,709 INFO L195 NwaCegarLoop]: trace histogram [40, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:17:17,725 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:17,910 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,SelfDestructingSolverStorable40 [2022-04-28 03:17:17,910 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:17:17,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:17:17,910 INFO L85 PathProgramCache]: Analyzing trace with hash -349413232, now seen corresponding path program 39 times [2022-04-28 03:17:17,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:17,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [71622432] [2022-04-28 03:17:21,967 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:17:22,012 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:17:22,230 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:17:22,231 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:17:22,233 INFO L85 PathProgramCache]: Analyzing trace with hash -466331444, now seen corresponding path program 1 times [2022-04-28 03:17:22,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:17:22,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023084621] [2022-04-28 03:17:22,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:17:22,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:17:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:22,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:17:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:22,323 INFO L290 TraceCheckUtils]: 0: Hoare triple {20065#(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); {20054#true} is VALID [2022-04-28 03:17:22,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {20054#true} assume true; {20054#true} is VALID [2022-04-28 03:17:22,323 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20054#true} {20054#true} #56#return; {20054#true} is VALID [2022-04-28 03:17:22,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {20054#true} call ULTIMATE.init(); {20065#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:17:22,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {20065#(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); {20054#true} is VALID [2022-04-28 03:17:22,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {20054#true} assume true; {20054#true} is VALID [2022-04-28 03:17:22,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20054#true} {20054#true} #56#return; {20054#true} is VALID [2022-04-28 03:17:22,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {20054#true} call #t~ret1 := main(); {20054#true} is VALID [2022-04-28 03:17:22,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {20054#true} ~x~0 := 0;~y~0 := 50; {20059#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:17:22,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {20059#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [214] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1441 v_main_~x~0_1440))) (or (and .cse0 (not (< v_main_~x~0_1441 50))) (and (< v_main_~x~0_1441 v_main_~x~0_1440) (< v_main_~x~0_1440 51)) .cse0)) InVars {main_~x~0=v_main_~x~0_1441} OutVars{main_~x~0=v_main_~x~0_1440} AuxVars[] AssignedVars[main_~x~0] {20060#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:17:22,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {20060#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [215] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20060#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:17:22,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {20060#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [216] L28-2-->L27-2_primed: Formula: (let ((.cse1 (<= 50 v_main_~x~0_1443)) (.cse0 (= v_main_~x~0_1443 v_main_~x~0_1442))) (or (and .cse0 (= v_main_~y~0_1090 v_main_~y~0_1089)) (let ((.cse2 (+ v_main_~x~0_1443 v_main_~y~0_1089))) (and (< v_main_~y~0_1090 v_main_~y~0_1089) .cse1 (= (+ v_main_~x~0_1442 v_main_~y~0_1090) .cse2) (< .cse2 (+ 101 v_main_~y~0_1090)))) (and (or (not .cse1) (not (< v_main_~x~0_1443 100))) .cse0 (= v_main_~y~0_1089 v_main_~y~0_1090)))) InVars {main_~x~0=v_main_~x~0_1443, main_~y~0=v_main_~y~0_1090} OutVars{main_~x~0=v_main_~x~0_1442, main_~y~0=v_main_~y~0_1089} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {20061#(or (<= main_~x~0 99) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:17:22,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {20061#(or (<= main_~x~0 99) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [213] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {20062#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:17:22,327 INFO L272 TraceCheckUtils]: 10: Hoare triple {20062#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {20063#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:17:22,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {20063#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {20064#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:17:22,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {20064#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {20055#false} is VALID [2022-04-28 03:17:22,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {20055#false} assume !false; {20055#false} is VALID [2022-04-28 03:17:22,328 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:22,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:17:22,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023084621] [2022-04-28 03:17:22,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023084621] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:17:22,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928615258] [2022-04-28 03:17:22,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:17:22,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:17:22,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:17:22,332 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:22,339 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:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:22,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:17:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:22,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:17:22,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {20054#true} call ULTIMATE.init(); {20054#true} is VALID [2022-04-28 03:17:22,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {20054#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); {20054#true} is VALID [2022-04-28 03:17:22,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {20054#true} assume true; {20054#true} is VALID [2022-04-28 03:17:22,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20054#true} {20054#true} #56#return; {20054#true} is VALID [2022-04-28 03:17:22,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {20054#true} call #t~ret1 := main(); {20054#true} is VALID [2022-04-28 03:17:22,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {20054#true} ~x~0 := 0;~y~0 := 50; {20084#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:17:22,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {20084#(and (<= main_~x~0 0) (= main_~y~0 50))} [214] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1441 v_main_~x~0_1440))) (or (and .cse0 (not (< v_main_~x~0_1441 50))) (and (< v_main_~x~0_1441 v_main_~x~0_1440) (< v_main_~x~0_1440 51)) .cse0)) InVars {main_~x~0=v_main_~x~0_1441} OutVars{main_~x~0=v_main_~x~0_1440} AuxVars[] AssignedVars[main_~x~0] {20088#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:17:22,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {20088#(and (= main_~y~0 50) (< main_~x~0 51))} [215] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20088#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:17:22,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {20088#(and (= main_~y~0 50) (< main_~x~0 51))} [216] L28-2-->L27-2_primed: Formula: (let ((.cse1 (<= 50 v_main_~x~0_1443)) (.cse0 (= v_main_~x~0_1443 v_main_~x~0_1442))) (or (and .cse0 (= v_main_~y~0_1090 v_main_~y~0_1089)) (let ((.cse2 (+ v_main_~x~0_1443 v_main_~y~0_1089))) (and (< v_main_~y~0_1090 v_main_~y~0_1089) .cse1 (= (+ v_main_~x~0_1442 v_main_~y~0_1090) .cse2) (< .cse2 (+ 101 v_main_~y~0_1090)))) (and (or (not .cse1) (not (< v_main_~x~0_1443 100))) .cse0 (= v_main_~y~0_1089 v_main_~y~0_1090)))) InVars {main_~x~0=v_main_~x~0_1443, main_~y~0=v_main_~y~0_1090} OutVars{main_~x~0=v_main_~x~0_1442, main_~y~0=v_main_~y~0_1089} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {20095#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:17:22,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {20095#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [213] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {20062#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:17:22,628 INFO L272 TraceCheckUtils]: 10: Hoare triple {20062#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {20102#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:17:22,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {20102#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20106#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:17:22,628 INFO L290 TraceCheckUtils]: 12: Hoare triple {20106#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20055#false} is VALID [2022-04-28 03:17:22,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {20055#false} assume !false; {20055#false} is VALID [2022-04-28 03:17:22,628 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:22,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:17:23,052 INFO L290 TraceCheckUtils]: 13: Hoare triple {20055#false} assume !false; {20055#false} is VALID [2022-04-28 03:17:23,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {20106#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20055#false} is VALID [2022-04-28 03:17:23,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {20102#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20106#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:17:23,054 INFO L272 TraceCheckUtils]: 10: Hoare triple {20062#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {20102#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:17:23,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {20061#(or (<= main_~x~0 99) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [213] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {20062#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:17:23,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {20128#(and (or (and (or (<= main_~x~0 main_~y~0) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0)) (not (<= 50 main_~x~0))) (or (<= main_~x~0 99) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [216] L28-2-->L27-2_primed: Formula: (let ((.cse1 (<= 50 v_main_~x~0_1443)) (.cse0 (= v_main_~x~0_1443 v_main_~x~0_1442))) (or (and .cse0 (= v_main_~y~0_1090 v_main_~y~0_1089)) (let ((.cse2 (+ v_main_~x~0_1443 v_main_~y~0_1089))) (and (< v_main_~y~0_1090 v_main_~y~0_1089) .cse1 (= (+ v_main_~x~0_1442 v_main_~y~0_1090) .cse2) (< .cse2 (+ 101 v_main_~y~0_1090)))) (and (or (not .cse1) (not (< v_main_~x~0_1443 100))) .cse0 (= v_main_~y~0_1089 v_main_~y~0_1090)))) InVars {main_~x~0=v_main_~x~0_1443, main_~y~0=v_main_~y~0_1090} OutVars{main_~x~0=v_main_~x~0_1442, main_~y~0=v_main_~y~0_1089} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {20061#(or (<= main_~x~0 99) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:17:23,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {20128#(and (or (and (or (<= main_~x~0 main_~y~0) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0)) (not (<= 50 main_~x~0))) (or (<= main_~x~0 99) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [215] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20128#(and (or (and (or (<= main_~x~0 main_~y~0) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0)) (not (<= 50 main_~x~0))) (or (<= main_~x~0 99) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:17:23,058 INFO L290 TraceCheckUtils]: 6: Hoare triple {20135#(and (<= 50 main_~y~0) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (and (or (<= main_~x~0 main_~y~0) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0)) (not (<= 50 main_~x~0))) (or (<= main_~x~0 99) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [214] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1441 v_main_~x~0_1440))) (or (and .cse0 (not (< v_main_~x~0_1441 50))) (and (< v_main_~x~0_1441 v_main_~x~0_1440) (< v_main_~x~0_1440 51)) .cse0)) InVars {main_~x~0=v_main_~x~0_1441} OutVars{main_~x~0=v_main_~x~0_1440} AuxVars[] AssignedVars[main_~x~0] {20128#(and (or (and (or (<= main_~x~0 main_~y~0) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0)) (not (<= 50 main_~x~0))) (or (<= main_~x~0 99) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:17:23,058 INFO L290 TraceCheckUtils]: 5: Hoare triple {20054#true} ~x~0 := 0;~y~0 := 50; {20135#(and (<= 50 main_~y~0) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (and (or (<= main_~x~0 main_~y~0) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0)) (not (<= 50 main_~x~0))) (or (<= main_~x~0 99) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:17:23,058 INFO L272 TraceCheckUtils]: 4: Hoare triple {20054#true} call #t~ret1 := main(); {20054#true} is VALID [2022-04-28 03:17:23,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20054#true} {20054#true} #56#return; {20054#true} is VALID [2022-04-28 03:17:23,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {20054#true} assume true; {20054#true} is VALID [2022-04-28 03:17:23,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {20054#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); {20054#true} is VALID [2022-04-28 03:17:23,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {20054#true} call ULTIMATE.init(); {20054#true} is VALID [2022-04-28 03:17:23,059 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:23,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928615258] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:17:23,059 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:17:23,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-28 03:17:24,863 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:17:24,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [71622432] [2022-04-28 03:17:24,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [71622432] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:17:24,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:17:24,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-04-28 03:17:24,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126862629] [2022-04-28 03:17:24,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:17:24,864 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.891304347826087) internal successors, (87), 45 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:17:24,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:17:24,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 47 states, 46 states have (on average 1.891304347826087) internal successors, (87), 45 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:17:24,932 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:17:24,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-28 03:17:24,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:24,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-28 03:17:24,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=2882, Unknown=0, NotChecked=0, Total=3192 [2022-04-28 03:17:24,933 INFO L87 Difference]: Start difference. First operand 93 states and 95 transitions. Second operand has 47 states, 46 states have (on average 1.891304347826087) internal successors, (87), 45 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:17:31,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:31,711 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2022-04-28 03:17:31,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-28 03:17:31,711 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.891304347826087) internal successors, (87), 45 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:17:31,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:17:31,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.891304347826087) internal successors, (87), 45 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:17:31,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 107 transitions. [2022-04-28 03:17:31,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.891304347826087) internal successors, (87), 45 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:17:31,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 107 transitions. [2022-04-28 03:17:31,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 107 transitions. [2022-04-28 03:17:31,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:17:31,804 INFO L225 Difference]: With dead ends: 102 [2022-04-28 03:17:31,804 INFO L226 Difference]: Without dead ends: 95 [2022-04-28 03:17:31,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1796 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=644, Invalid=8862, Unknown=0, NotChecked=0, Total=9506 [2022-04-28 03:17:31,805 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 49 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 3831 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 3877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 3831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:17:31,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 228 Invalid, 3877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 3831 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-28 03:17:31,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-28 03:17:31,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-04-28 03:17:31,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:17:31,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 95 states, 90 states have (on average 1.0333333333333334) internal successors, (93), 90 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call 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:31,946 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 95 states, 90 states have (on average 1.0333333333333334) internal successors, (93), 90 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call 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:31,946 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 95 states, 90 states have (on average 1.0333333333333334) internal successors, (93), 90 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call 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:31,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:31,947 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2022-04-28 03:17:31,947 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2022-04-28 03:17:31,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:31,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:31,947 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 90 states have (on average 1.0333333333333334) internal successors, (93), 90 states have internal predecessors, (93), 3 states have call successors, (3), 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 95 states. [2022-04-28 03:17:31,948 INFO L87 Difference]: Start difference. First operand has 95 states, 90 states have (on average 1.0333333333333334) internal successors, (93), 90 states have internal predecessors, (93), 3 states have call successors, (3), 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 95 states. [2022-04-28 03:17:31,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:31,949 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2022-04-28 03:17:31,949 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2022-04-28 03:17:31,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:31,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:31,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:17:31,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:17:31,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.0333333333333334) internal successors, (93), 90 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call 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:31,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2022-04-28 03:17:31,951 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 91 [2022-04-28 03:17:31,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:17:31,951 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2022-04-28 03:17:31,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.891304347826087) internal successors, (87), 45 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:17:31,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 97 transitions. [2022-04-28 03:17:32,052 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:17:32,052 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2022-04-28 03:17:32,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-28 03:17:32,052 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:17:32,052 INFO L195 NwaCegarLoop]: trace histogram [41, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:17:32,068 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:32,253 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,SelfDestructingSolverStorable41 [2022-04-28 03:17:32,253 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:17:32,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:17:32,253 INFO L85 PathProgramCache]: Analyzing trace with hash 291005419, now seen corresponding path program 40 times [2022-04-28 03:17:32,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:32,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1776258440] [2022-04-28 03:17:36,313 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:17:36,356 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:17:36,726 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:17:36,727 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:17:36,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1583200716, now seen corresponding path program 1 times [2022-04-28 03:17:36,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:17:36,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686365171] [2022-04-28 03:17:36,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:17:36,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:17:36,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:36,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:17:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:36,821 INFO L290 TraceCheckUtils]: 0: Hoare triple {20874#(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); {20863#true} is VALID [2022-04-28 03:17:36,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {20863#true} assume true; {20863#true} is VALID [2022-04-28 03:17:36,822 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20863#true} {20863#true} #56#return; {20863#true} is VALID [2022-04-28 03:17:36,822 INFO L272 TraceCheckUtils]: 0: Hoare triple {20863#true} call ULTIMATE.init(); {20874#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:17:36,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {20874#(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); {20863#true} is VALID [2022-04-28 03:17:36,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {20863#true} assume true; {20863#true} is VALID [2022-04-28 03:17:36,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20863#true} {20863#true} #56#return; {20863#true} is VALID [2022-04-28 03:17:36,823 INFO L272 TraceCheckUtils]: 4: Hoare triple {20863#true} call #t~ret1 := main(); {20863#true} is VALID [2022-04-28 03:17:36,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {20863#true} ~x~0 := 0;~y~0 := 50; {20868#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:17:36,824 INFO L290 TraceCheckUtils]: 6: Hoare triple {20868#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [218] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1498 v_main_~x~0_1497))) (or .cse0 (and (< v_main_~x~0_1497 51) (< v_main_~x~0_1498 v_main_~x~0_1497)) (and .cse0 (not (< v_main_~x~0_1498 50))))) InVars {main_~x~0=v_main_~x~0_1498} OutVars{main_~x~0=v_main_~x~0_1497} AuxVars[] AssignedVars[main_~x~0] {20869#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:17:36,824 INFO L290 TraceCheckUtils]: 7: Hoare triple {20869#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [219] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20869#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:17:36,825 INFO L290 TraceCheckUtils]: 8: Hoare triple {20869#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [220] L28-2-->L27-2_primed: Formula: (let ((.cse1 (<= 50 v_main_~x~0_1500)) (.cse2 (= v_main_~x~0_1500 v_main_~x~0_1499)) (.cse3 (= v_main_~y~0_1138 v_main_~y~0_1137))) (or (let ((.cse0 (+ v_main_~x~0_1500 v_main_~y~0_1137))) (and (< v_main_~y~0_1138 v_main_~y~0_1137) (< .cse0 (+ 101 v_main_~y~0_1138)) .cse1 (= .cse0 (+ v_main_~x~0_1499 v_main_~y~0_1138)))) (and .cse2 .cse3 (or (not .cse1) (not (< v_main_~x~0_1500 100)))) (and .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_1500, main_~y~0=v_main_~y~0_1138} OutVars{main_~x~0=v_main_~x~0_1499, main_~y~0=v_main_~y~0_1137} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {20870#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:17:36,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {20870#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} [217] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {20871#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:17:36,826 INFO L272 TraceCheckUtils]: 10: Hoare triple {20871#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {20872#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:17:36,827 INFO L290 TraceCheckUtils]: 11: Hoare triple {20872#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {20873#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:17:36,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {20873#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {20864#false} is VALID [2022-04-28 03:17:36,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {20864#false} assume !false; {20864#false} is VALID [2022-04-28 03:17:36,827 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:36,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:17:36,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686365171] [2022-04-28 03:17:36,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686365171] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:17:36,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454504663] [2022-04-28 03:17:36,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:17:36,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:17:36,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:17:36,829 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:17:36,829 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:17:36,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:36,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:17:36,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:36,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:17:37,150 INFO L272 TraceCheckUtils]: 0: Hoare triple {20863#true} call ULTIMATE.init(); {20863#true} is VALID [2022-04-28 03:17:37,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {20863#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); {20863#true} is VALID [2022-04-28 03:17:37,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {20863#true} assume true; {20863#true} is VALID [2022-04-28 03:17:37,150 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20863#true} {20863#true} #56#return; {20863#true} is VALID [2022-04-28 03:17:37,150 INFO L272 TraceCheckUtils]: 4: Hoare triple {20863#true} call #t~ret1 := main(); {20863#true} is VALID [2022-04-28 03:17:37,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {20863#true} ~x~0 := 0;~y~0 := 50; {20893#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:17:37,151 INFO L290 TraceCheckUtils]: 6: Hoare triple {20893#(and (<= main_~x~0 0) (= main_~y~0 50))} [218] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1498 v_main_~x~0_1497))) (or .cse0 (and (< v_main_~x~0_1497 51) (< v_main_~x~0_1498 v_main_~x~0_1497)) (and .cse0 (not (< v_main_~x~0_1498 50))))) InVars {main_~x~0=v_main_~x~0_1498} OutVars{main_~x~0=v_main_~x~0_1497} AuxVars[] AssignedVars[main_~x~0] {20897#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:17:37,151 INFO L290 TraceCheckUtils]: 7: Hoare triple {20897#(and (= main_~y~0 50) (< main_~x~0 51))} [219] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20897#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:17:37,152 INFO L290 TraceCheckUtils]: 8: Hoare triple {20897#(and (= main_~y~0 50) (< main_~x~0 51))} [220] L28-2-->L27-2_primed: Formula: (let ((.cse1 (<= 50 v_main_~x~0_1500)) (.cse2 (= v_main_~x~0_1500 v_main_~x~0_1499)) (.cse3 (= v_main_~y~0_1138 v_main_~y~0_1137))) (or (let ((.cse0 (+ v_main_~x~0_1500 v_main_~y~0_1137))) (and (< v_main_~y~0_1138 v_main_~y~0_1137) (< .cse0 (+ 101 v_main_~y~0_1138)) .cse1 (= .cse0 (+ v_main_~x~0_1499 v_main_~y~0_1138)))) (and .cse2 .cse3 (or (not .cse1) (not (< v_main_~x~0_1500 100)))) (and .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_1500, main_~y~0=v_main_~y~0_1138} OutVars{main_~x~0=v_main_~x~0_1499, main_~y~0=v_main_~y~0_1137} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {20904#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:17:37,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {20904#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [217] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {20871#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:17:37,153 INFO L272 TraceCheckUtils]: 10: Hoare triple {20871#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {20911#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:17:37,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {20911#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20915#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:17:37,154 INFO L290 TraceCheckUtils]: 12: Hoare triple {20915#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20864#false} is VALID [2022-04-28 03:17:37,154 INFO L290 TraceCheckUtils]: 13: Hoare triple {20864#false} assume !false; {20864#false} is VALID [2022-04-28 03:17:37,154 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:37,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:17:37,615 INFO L290 TraceCheckUtils]: 13: Hoare triple {20864#false} assume !false; {20864#false} is VALID [2022-04-28 03:17:37,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {20915#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20864#false} is VALID [2022-04-28 03:17:37,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {20911#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20915#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:17:37,617 INFO L272 TraceCheckUtils]: 10: Hoare triple {20871#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {20911#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:17:37,617 INFO L290 TraceCheckUtils]: 9: Hoare triple {20934#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [217] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {20871#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:17:37,618 INFO L290 TraceCheckUtils]: 8: Hoare triple {20938#(and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [220] L28-2-->L27-2_primed: Formula: (let ((.cse1 (<= 50 v_main_~x~0_1500)) (.cse2 (= v_main_~x~0_1500 v_main_~x~0_1499)) (.cse3 (= v_main_~y~0_1138 v_main_~y~0_1137))) (or (let ((.cse0 (+ v_main_~x~0_1500 v_main_~y~0_1137))) (and (< v_main_~y~0_1138 v_main_~y~0_1137) (< .cse0 (+ 101 v_main_~y~0_1138)) .cse1 (= .cse0 (+ v_main_~x~0_1499 v_main_~y~0_1138)))) (and .cse2 .cse3 (or (not .cse1) (not (< v_main_~x~0_1500 100)))) (and .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_1500, main_~y~0=v_main_~y~0_1138} OutVars{main_~x~0=v_main_~x~0_1499, main_~y~0=v_main_~y~0_1137} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {20934#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:17:37,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {20938#(and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [219] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20938#(and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:17:37,620 INFO L290 TraceCheckUtils]: 6: Hoare triple {20945#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (<= 50 main_~y~0) (<= main_~y~0 100) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [218] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1498 v_main_~x~0_1497))) (or .cse0 (and (< v_main_~x~0_1497 51) (< v_main_~x~0_1498 v_main_~x~0_1497)) (and .cse0 (not (< v_main_~x~0_1498 50))))) InVars {main_~x~0=v_main_~x~0_1498} OutVars{main_~x~0=v_main_~x~0_1497} AuxVars[] AssignedVars[main_~x~0] {20938#(and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:17:37,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {20863#true} ~x~0 := 0;~y~0 := 50; {20945#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (<= 50 main_~y~0) (<= main_~y~0 100) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:17:37,620 INFO L272 TraceCheckUtils]: 4: Hoare triple {20863#true} call #t~ret1 := main(); {20863#true} is VALID [2022-04-28 03:17:37,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20863#true} {20863#true} #56#return; {20863#true} is VALID [2022-04-28 03:17:37,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {20863#true} assume true; {20863#true} is VALID [2022-04-28 03:17:37,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {20863#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); {20863#true} is VALID [2022-04-28 03:17:37,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {20863#true} call ULTIMATE.init(); {20863#true} is VALID [2022-04-28 03:17:37,621 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:37,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454504663] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:17:37,621 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:17:37,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:17:39,522 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:17:39,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1776258440] [2022-04-28 03:17:39,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1776258440] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:17:39,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:17:39,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-04-28 03:17:39,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787905572] [2022-04-28 03:17:39,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:17:39,523 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 46 states have internal predecessors, (89), 2 states have call successors, (3), 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 93 [2022-04-28 03:17:39,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:17:39,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 46 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call 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:39,593 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:17:39,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-28 03:17:39,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:39,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-28 03:17:39,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=3053, Unknown=0, NotChecked=0, Total=3422 [2022-04-28 03:17:39,595 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 46 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call 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:46,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:46,748 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2022-04-28 03:17:46,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-28 03:17:46,748 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 46 states have internal predecessors, (89), 2 states have call successors, (3), 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 93 [2022-04-28 03:17:46,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:17:46,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 46 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call 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:46,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 109 transitions. [2022-04-28 03:17:46,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 46 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call 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:46,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 109 transitions. [2022-04-28 03:17:46,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 109 transitions. [2022-04-28 03:17:46,859 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:17:46,860 INFO L225 Difference]: With dead ends: 104 [2022-04-28 03:17:46,860 INFO L226 Difference]: Without dead ends: 97 [2022-04-28 03:17:46,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=753, Invalid=9347, Unknown=0, NotChecked=0, Total=10100 [2022-04-28 03:17:46,862 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 50 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 4008 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 4055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 4008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:17:46,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 233 Invalid, 4055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 4008 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-28 03:17:46,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-28 03:17:47,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-04-28 03:17:47,019 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:17:47,019 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 97 states, 92 states have (on average 1.0326086956521738) internal successors, (95), 92 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:17:47,019 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 97 states, 92 states have (on average 1.0326086956521738) internal successors, (95), 92 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:17:47,019 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 97 states, 92 states have (on average 1.0326086956521738) internal successors, (95), 92 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:17:47,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:47,021 INFO L93 Difference]: Finished difference Result 97 states and 99 transitions. [2022-04-28 03:17:47,021 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2022-04-28 03:17:47,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:47,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:47,021 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 92 states have (on average 1.0326086956521738) internal successors, (95), 92 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 97 states. [2022-04-28 03:17:47,021 INFO L87 Difference]: Start difference. First operand has 97 states, 92 states have (on average 1.0326086956521738) internal successors, (95), 92 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 97 states. [2022-04-28 03:17:47,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:47,022 INFO L93 Difference]: Finished difference Result 97 states and 99 transitions. [2022-04-28 03:17:47,022 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2022-04-28 03:17:47,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:47,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:47,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:17:47,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:17:47,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 92 states have (on average 1.0326086956521738) internal successors, (95), 92 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:17:47,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2022-04-28 03:17:47,024 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 99 transitions. Word has length 93 [2022-04-28 03:17:47,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:17:47,024 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 99 transitions. [2022-04-28 03:17:47,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 46 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call 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:47,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 99 transitions. [2022-04-28 03:17:47,132 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:17:47,132 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2022-04-28 03:17:47,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-28 03:17:47,133 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:17:47,133 INFO L195 NwaCegarLoop]: trace histogram [42, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:17:47,159 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:17:47,333 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,SelfDestructingSolverStorable42 [2022-04-28 03:17:47,334 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:17:47,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:17:47,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1553005702, now seen corresponding path program 41 times [2022-04-28 03:17:47,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:47,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1332907351] [2022-04-28 03:17:47,443 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:17:47,669 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:17:47,670 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:17:47,673 INFO L85 PathProgramCache]: Analyzing trace with hash -662234420, now seen corresponding path program 1 times [2022-04-28 03:17:47,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:17:47,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332325669] [2022-04-28 03:17:47,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:17:47,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:17:47,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:47,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:17:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:47,780 INFO L290 TraceCheckUtils]: 0: Hoare triple {21699#(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); {21688#true} is VALID [2022-04-28 03:17:47,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {21688#true} assume true; {21688#true} is VALID [2022-04-28 03:17:47,781 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21688#true} {21688#true} #56#return; {21688#true} is VALID [2022-04-28 03:17:47,781 INFO L272 TraceCheckUtils]: 0: Hoare triple {21688#true} call ULTIMATE.init(); {21699#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:17:47,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {21699#(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); {21688#true} is VALID [2022-04-28 03:17:47,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {21688#true} assume true; {21688#true} is VALID [2022-04-28 03:17:47,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21688#true} {21688#true} #56#return; {21688#true} is VALID [2022-04-28 03:17:47,782 INFO L272 TraceCheckUtils]: 4: Hoare triple {21688#true} call #t~ret1 := main(); {21688#true} is VALID [2022-04-28 03:17:47,782 INFO L290 TraceCheckUtils]: 5: Hoare triple {21688#true} ~x~0 := 0;~y~0 := 50; {21693#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:17:47,783 INFO L290 TraceCheckUtils]: 6: Hoare triple {21693#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [222] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1556 v_main_~x~0_1555))) (or .cse0 (and (not (< v_main_~x~0_1556 50)) .cse0) (and (< v_main_~x~0_1556 v_main_~x~0_1555) (< v_main_~x~0_1555 51)))) InVars {main_~x~0=v_main_~x~0_1556} OutVars{main_~x~0=v_main_~x~0_1555} AuxVars[] AssignedVars[main_~x~0] {21694#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:17:47,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {21694#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [223] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21694#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:17:47,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {21694#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [224] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1558 v_main_~x~0_1557)) (.cse3 (<= 50 v_main_~x~0_1558)) (.cse1 (= v_main_~y~0_1187 v_main_~y~0_1186))) (or (and .cse0 .cse1) (let ((.cse2 (+ v_main_~x~0_1558 v_main_~y~0_1186))) (and (< v_main_~y~0_1187 v_main_~y~0_1186) (< .cse2 (+ 101 v_main_~y~0_1187)) (= .cse2 (+ v_main_~x~0_1557 v_main_~y~0_1187)) .cse3)) (and .cse0 (or (not (< v_main_~x~0_1558 100)) (not .cse3)) .cse1))) InVars {main_~x~0=v_main_~x~0_1558, main_~y~0=v_main_~y~0_1187} OutVars{main_~x~0=v_main_~x~0_1557, main_~y~0=v_main_~y~0_1186} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {21695#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:17:47,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {21695#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} [221] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {21696#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:17:47,786 INFO L272 TraceCheckUtils]: 10: Hoare triple {21696#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {21697#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:17:47,786 INFO L290 TraceCheckUtils]: 11: Hoare triple {21697#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {21698#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:17:47,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {21698#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {21689#false} is VALID [2022-04-28 03:17:47,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {21689#false} assume !false; {21689#false} is VALID [2022-04-28 03:17:47,787 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:47,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:17:47,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332325669] [2022-04-28 03:17:47,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332325669] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:17:47,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997477380] [2022-04-28 03:17:47,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:17:47,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:17:47,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:17:47,789 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:17:47,791 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:17:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:47,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:17:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:47,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:17:48,177 INFO L272 TraceCheckUtils]: 0: Hoare triple {21688#true} call ULTIMATE.init(); {21688#true} is VALID [2022-04-28 03:17:48,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {21688#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); {21688#true} is VALID [2022-04-28 03:17:48,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {21688#true} assume true; {21688#true} is VALID [2022-04-28 03:17:48,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21688#true} {21688#true} #56#return; {21688#true} is VALID [2022-04-28 03:17:48,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {21688#true} call #t~ret1 := main(); {21688#true} is VALID [2022-04-28 03:17:48,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {21688#true} ~x~0 := 0;~y~0 := 50; {21718#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:17:48,178 INFO L290 TraceCheckUtils]: 6: Hoare triple {21718#(and (<= main_~x~0 0) (= main_~y~0 50))} [222] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1556 v_main_~x~0_1555))) (or .cse0 (and (not (< v_main_~x~0_1556 50)) .cse0) (and (< v_main_~x~0_1556 v_main_~x~0_1555) (< v_main_~x~0_1555 51)))) InVars {main_~x~0=v_main_~x~0_1556} OutVars{main_~x~0=v_main_~x~0_1555} AuxVars[] AssignedVars[main_~x~0] {21722#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:17:48,178 INFO L290 TraceCheckUtils]: 7: Hoare triple {21722#(and (= main_~y~0 50) (< main_~x~0 51))} [223] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21722#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:17:48,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {21722#(and (= main_~y~0 50) (< main_~x~0 51))} [224] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1558 v_main_~x~0_1557)) (.cse3 (<= 50 v_main_~x~0_1558)) (.cse1 (= v_main_~y~0_1187 v_main_~y~0_1186))) (or (and .cse0 .cse1) (let ((.cse2 (+ v_main_~x~0_1558 v_main_~y~0_1186))) (and (< v_main_~y~0_1187 v_main_~y~0_1186) (< .cse2 (+ 101 v_main_~y~0_1187)) (= .cse2 (+ v_main_~x~0_1557 v_main_~y~0_1187)) .cse3)) (and .cse0 (or (not (< v_main_~x~0_1558 100)) (not .cse3)) .cse1))) InVars {main_~x~0=v_main_~x~0_1558, main_~y~0=v_main_~y~0_1187} OutVars{main_~x~0=v_main_~x~0_1557, main_~y~0=v_main_~y~0_1186} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {21729#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:17:48,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {21729#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [221] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {21696#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:17:48,180 INFO L272 TraceCheckUtils]: 10: Hoare triple {21696#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {21736#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:17:48,181 INFO L290 TraceCheckUtils]: 11: Hoare triple {21736#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21740#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:17:48,181 INFO L290 TraceCheckUtils]: 12: Hoare triple {21740#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21689#false} is VALID [2022-04-28 03:17:48,181 INFO L290 TraceCheckUtils]: 13: Hoare triple {21689#false} assume !false; {21689#false} is VALID [2022-04-28 03:17:48,181 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:48,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:17:48,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {21689#false} assume !false; {21689#false} is VALID [2022-04-28 03:17:48,647 INFO L290 TraceCheckUtils]: 12: Hoare triple {21740#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21689#false} is VALID [2022-04-28 03:17:48,647 INFO L290 TraceCheckUtils]: 11: Hoare triple {21736#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21740#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:17:48,648 INFO L272 TraceCheckUtils]: 10: Hoare triple {21696#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {21736#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:17:48,648 INFO L290 TraceCheckUtils]: 9: Hoare triple {21759#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [221] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {21696#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:17:48,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {21763#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [224] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1558 v_main_~x~0_1557)) (.cse3 (<= 50 v_main_~x~0_1558)) (.cse1 (= v_main_~y~0_1187 v_main_~y~0_1186))) (or (and .cse0 .cse1) (let ((.cse2 (+ v_main_~x~0_1558 v_main_~y~0_1186))) (and (< v_main_~y~0_1187 v_main_~y~0_1186) (< .cse2 (+ 101 v_main_~y~0_1187)) (= .cse2 (+ v_main_~x~0_1557 v_main_~y~0_1187)) .cse3)) (and .cse0 (or (not (< v_main_~x~0_1558 100)) (not .cse3)) .cse1))) InVars {main_~x~0=v_main_~x~0_1558, main_~y~0=v_main_~y~0_1187} OutVars{main_~x~0=v_main_~x~0_1557, main_~y~0=v_main_~y~0_1186} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {21759#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:17:48,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {21763#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [223] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21763#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:17:48,651 INFO L290 TraceCheckUtils]: 6: Hoare triple {21770#(and (<= 50 main_~y~0) (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [222] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1556 v_main_~x~0_1555))) (or .cse0 (and (not (< v_main_~x~0_1556 50)) .cse0) (and (< v_main_~x~0_1556 v_main_~x~0_1555) (< v_main_~x~0_1555 51)))) InVars {main_~x~0=v_main_~x~0_1556} OutVars{main_~x~0=v_main_~x~0_1555} AuxVars[] AssignedVars[main_~x~0] {21763#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:17:48,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {21688#true} ~x~0 := 0;~y~0 := 50; {21770#(and (<= 50 main_~y~0) (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:17:48,651 INFO L272 TraceCheckUtils]: 4: Hoare triple {21688#true} call #t~ret1 := main(); {21688#true} is VALID [2022-04-28 03:17:48,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21688#true} {21688#true} #56#return; {21688#true} is VALID [2022-04-28 03:17:48,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {21688#true} assume true; {21688#true} is VALID [2022-04-28 03:17:48,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {21688#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); {21688#true} is VALID [2022-04-28 03:17:48,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {21688#true} call ULTIMATE.init(); {21688#true} is VALID [2022-04-28 03:17:48,652 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:48,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997477380] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:17:48,652 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:17:48,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:17:50,584 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:17:50,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1332907351] [2022-04-28 03:17:50,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1332907351] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:17:50,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:17:50,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-04-28 03:17:50,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565804807] [2022-04-28 03:17:50,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:17:50,585 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 47 states have internal predecessors, (91), 2 states have call successors, (3), 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 95 [2022-04-28 03:17:50,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:17:50,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 49 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 47 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call 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:50,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:17:50,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-04-28 03:17:50,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:50,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-04-28 03:17:50,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=376, Invalid=3164, Unknown=0, NotChecked=0, Total=3540 [2022-04-28 03:17:50,658 INFO L87 Difference]: Start difference. First operand 97 states and 99 transitions. Second operand has 49 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 47 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call 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:58,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:58,116 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2022-04-28 03:17:58,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-28 03:17:58,117 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 47 states have internal predecessors, (91), 2 states have call successors, (3), 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 95 [2022-04-28 03:17:58,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:17:58,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 47 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call 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:58,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 111 transitions. [2022-04-28 03:17:58,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 47 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call 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:58,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 111 transitions. [2022-04-28 03:17:58,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 111 transitions. [2022-04-28 03:17:58,212 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:17:58,213 INFO L225 Difference]: With dead ends: 106 [2022-04-28 03:17:58,213 INFO L226 Difference]: Without dead ends: 99 [2022-04-28 03:17:58,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2019 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=769, Invalid=9737, Unknown=0, NotChecked=0, Total=10506 [2022-04-28 03:17:58,214 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 51 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 4189 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 4237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 4189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:17:58,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 238 Invalid, 4237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 4189 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-28 03:17:58,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-28 03:17:58,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-04-28 03:17:58,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:17:58,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 99 states, 94 states have (on average 1.0319148936170213) internal successors, (97), 94 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call 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:58,370 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 99 states, 94 states have (on average 1.0319148936170213) internal successors, (97), 94 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call 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:58,370 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 99 states, 94 states have (on average 1.0319148936170213) internal successors, (97), 94 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call 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:58,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:58,371 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2022-04-28 03:17:58,371 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2022-04-28 03:17:58,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:58,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:58,372 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 94 states have (on average 1.0319148936170213) internal successors, (97), 94 states have internal predecessors, (97), 3 states have call successors, (3), 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:17:58,372 INFO L87 Difference]: Start difference. First operand has 99 states, 94 states have (on average 1.0319148936170213) internal successors, (97), 94 states have internal predecessors, (97), 3 states have call successors, (3), 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:17:58,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:58,373 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2022-04-28 03:17:58,373 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2022-04-28 03:17:58,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:58,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:58,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:17:58,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:17:58,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.0319148936170213) internal successors, (97), 94 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call 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:58,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2022-04-28 03:17:58,375 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 101 transitions. Word has length 95 [2022-04-28 03:17:58,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:17:58,375 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 101 transitions. [2022-04-28 03:17:58,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 47 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call 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:58,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 101 transitions. [2022-04-28 03:17:58,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:17:58,454 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2022-04-28 03:17:58,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-28 03:17:58,454 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:17:58,454 INFO L195 NwaCegarLoop]: trace histogram [43, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:17:58,470 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:17:58,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:17:58,659 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:17:58,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:17:58,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1140467103, now seen corresponding path program 42 times [2022-04-28 03:17:58,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:58,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [533747357] [2022-04-28 03:18:02,732 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:18:02,783 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:18:03,006 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:18:03,008 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:18:03,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1387297740, now seen corresponding path program 1 times [2022-04-28 03:18:03,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:18:03,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164040304] [2022-04-28 03:18:03,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:18:03,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:18:03,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:18:03,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:18:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:18:03,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {22539#(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); {22528#true} is VALID [2022-04-28 03:18:03,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {22528#true} assume true; {22528#true} is VALID [2022-04-28 03:18:03,165 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22528#true} {22528#true} #56#return; {22528#true} is VALID [2022-04-28 03:18:03,166 INFO L272 TraceCheckUtils]: 0: Hoare triple {22528#true} call ULTIMATE.init(); {22539#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:18:03,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {22539#(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); {22528#true} is VALID [2022-04-28 03:18:03,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {22528#true} assume true; {22528#true} is VALID [2022-04-28 03:18:03,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22528#true} {22528#true} #56#return; {22528#true} is VALID [2022-04-28 03:18:03,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {22528#true} call #t~ret1 := main(); {22528#true} is VALID [2022-04-28 03:18:03,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {22528#true} ~x~0 := 0;~y~0 := 50; {22533#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:18:03,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {22533#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [226] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1615 v_main_~x~0_1614))) (or .cse0 (and (< v_main_~x~0_1615 v_main_~x~0_1614) (< v_main_~x~0_1614 51)) (and .cse0 (not (< v_main_~x~0_1615 50))))) InVars {main_~x~0=v_main_~x~0_1615} OutVars{main_~x~0=v_main_~x~0_1614} AuxVars[] AssignedVars[main_~x~0] {22534#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:18:03,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {22534#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [227] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22534#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:18:03,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {22534#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [228] L28-2-->L27-2_primed: Formula: (let ((.cse2 (<= 50 v_main_~x~0_1617)) (.cse0 (= v_main_~y~0_1237 v_main_~y~0_1236)) (.cse1 (= v_main_~x~0_1617 v_main_~x~0_1616))) (or (and .cse0 .cse1) (let ((.cse3 (+ v_main_~x~0_1617 v_main_~y~0_1236))) (and (< v_main_~y~0_1237 v_main_~y~0_1236) .cse2 (= .cse3 (+ v_main_~x~0_1616 v_main_~y~0_1237)) (< .cse3 (+ 101 v_main_~y~0_1237)))) (and (or (not (< v_main_~x~0_1617 100)) (not .cse2)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1617, main_~y~0=v_main_~y~0_1237} OutVars{main_~x~0=v_main_~x~0_1616, main_~y~0=v_main_~y~0_1236} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {22535#(or (and (or (< 99 main_~y~0) (<= main_~x~0 main_~y~0)) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:18:03,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {22535#(or (and (or (< 99 main_~y~0) (<= main_~x~0 main_~y~0)) (<= main_~y~0 100)) (<= main_~x~0 50))} [225] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {22536#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:18:03,170 INFO L272 TraceCheckUtils]: 10: Hoare triple {22536#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {22537#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:18:03,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {22537#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {22538#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:18:03,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {22538#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {22529#false} is VALID [2022-04-28 03:18:03,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {22529#false} assume !false; {22529#false} is VALID [2022-04-28 03:18:03,172 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,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:18:03,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164040304] [2022-04-28 03:18:03,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164040304] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:18:03,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598331754] [2022-04-28 03:18:03,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:18:03,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:18:03,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:18:03,173 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:03,175 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:03,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:18:03,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:18:03,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:18:03,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:18:03,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {22528#true} call ULTIMATE.init(); {22528#true} is VALID [2022-04-28 03:18:03,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {22528#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); {22528#true} is VALID [2022-04-28 03:18:03,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {22528#true} assume true; {22528#true} is VALID [2022-04-28 03:18:03,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22528#true} {22528#true} #56#return; {22528#true} is VALID [2022-04-28 03:18:03,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {22528#true} call #t~ret1 := main(); {22528#true} is VALID [2022-04-28 03:18:03,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {22528#true} ~x~0 := 0;~y~0 := 50; {22558#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:18:03,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {22558#(and (<= main_~x~0 0) (= main_~y~0 50))} [226] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1615 v_main_~x~0_1614))) (or .cse0 (and (< v_main_~x~0_1615 v_main_~x~0_1614) (< v_main_~x~0_1614 51)) (and .cse0 (not (< v_main_~x~0_1615 50))))) InVars {main_~x~0=v_main_~x~0_1615} OutVars{main_~x~0=v_main_~x~0_1614} AuxVars[] AssignedVars[main_~x~0] {22562#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:18:03,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {22562#(and (= main_~y~0 50) (< main_~x~0 51))} [227] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22562#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:18:03,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {22562#(and (= main_~y~0 50) (< main_~x~0 51))} [228] L28-2-->L27-2_primed: Formula: (let ((.cse2 (<= 50 v_main_~x~0_1617)) (.cse0 (= v_main_~y~0_1237 v_main_~y~0_1236)) (.cse1 (= v_main_~x~0_1617 v_main_~x~0_1616))) (or (and .cse0 .cse1) (let ((.cse3 (+ v_main_~x~0_1617 v_main_~y~0_1236))) (and (< v_main_~y~0_1237 v_main_~y~0_1236) .cse2 (= .cse3 (+ v_main_~x~0_1616 v_main_~y~0_1237)) (< .cse3 (+ 101 v_main_~y~0_1237)))) (and (or (not (< v_main_~x~0_1617 100)) (not .cse2)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1617, main_~y~0=v_main_~y~0_1237} OutVars{main_~x~0=v_main_~x~0_1616, main_~y~0=v_main_~y~0_1236} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {22569#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:18:03,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {22569#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [225] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {22536#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:18:03,542 INFO L272 TraceCheckUtils]: 10: Hoare triple {22536#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {22576#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:18:03,542 INFO L290 TraceCheckUtils]: 11: Hoare triple {22576#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22580#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:18:03,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {22580#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22529#false} is VALID [2022-04-28 03:18:03,542 INFO L290 TraceCheckUtils]: 13: Hoare triple {22529#false} assume !false; {22529#false} is VALID [2022-04-28 03:18:03,542 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,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:18:03,983 INFO L290 TraceCheckUtils]: 13: Hoare triple {22529#false} assume !false; {22529#false} is VALID [2022-04-28 03:18:03,984 INFO L290 TraceCheckUtils]: 12: Hoare triple {22580#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22529#false} is VALID [2022-04-28 03:18:03,984 INFO L290 TraceCheckUtils]: 11: Hoare triple {22576#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22580#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:18:03,985 INFO L272 TraceCheckUtils]: 10: Hoare triple {22536#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {22576#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:18:03,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {22599#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [225] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {22536#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:18:03,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {22603#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [228] L28-2-->L27-2_primed: Formula: (let ((.cse2 (<= 50 v_main_~x~0_1617)) (.cse0 (= v_main_~y~0_1237 v_main_~y~0_1236)) (.cse1 (= v_main_~x~0_1617 v_main_~x~0_1616))) (or (and .cse0 .cse1) (let ((.cse3 (+ v_main_~x~0_1617 v_main_~y~0_1236))) (and (< v_main_~y~0_1237 v_main_~y~0_1236) .cse2 (= .cse3 (+ v_main_~x~0_1616 v_main_~y~0_1237)) (< .cse3 (+ 101 v_main_~y~0_1237)))) (and (or (not (< v_main_~x~0_1617 100)) (not .cse2)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1617, main_~y~0=v_main_~y~0_1237} OutVars{main_~x~0=v_main_~x~0_1616, main_~y~0=v_main_~y~0_1236} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {22599#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:18:03,987 INFO L290 TraceCheckUtils]: 7: Hoare triple {22603#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [227] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22603#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:18:03,987 INFO L290 TraceCheckUtils]: 6: Hoare triple {22610#(and (<= 50 main_~y~0) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [226] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1615 v_main_~x~0_1614))) (or .cse0 (and (< v_main_~x~0_1615 v_main_~x~0_1614) (< v_main_~x~0_1614 51)) (and .cse0 (not (< v_main_~x~0_1615 50))))) InVars {main_~x~0=v_main_~x~0_1615} OutVars{main_~x~0=v_main_~x~0_1614} AuxVars[] AssignedVars[main_~x~0] {22603#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:18:03,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {22528#true} ~x~0 := 0;~y~0 := 50; {22610#(and (<= 50 main_~y~0) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:18:03,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {22528#true} call #t~ret1 := main(); {22528#true} is VALID [2022-04-28 03:18:03,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22528#true} {22528#true} #56#return; {22528#true} is VALID [2022-04-28 03:18:03,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {22528#true} assume true; {22528#true} is VALID [2022-04-28 03:18:03,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {22528#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); {22528#true} is VALID [2022-04-28 03:18:03,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {22528#true} call ULTIMATE.init(); {22528#true} is VALID [2022-04-28 03:18:03,989 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,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598331754] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:18:03,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:18:03,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:18:06,049 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:18:06,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [533747357] [2022-04-28 03:18:06,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [533747357] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:18:06,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:18:06,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2022-04-28 03:18:06,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423975968] [2022-04-28 03:18:06,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:18:06,050 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 1.8979591836734695) internal successors, (93), 48 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:18:06,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:18:06,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 49 states have (on average 1.8979591836734695) internal successors, (93), 48 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:18:06,123 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:18:06,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-28 03:18:06,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:18:06,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-28 03:18:06,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=3277, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 03:18:06,124 INFO L87 Difference]: Start difference. First operand 99 states and 101 transitions. Second operand has 50 states, 49 states have (on average 1.8979591836734695) internal successors, (93), 48 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:18:13,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:18:13,919 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2022-04-28 03:18:13,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-28 03:18:13,920 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 1.8979591836734695) internal successors, (93), 48 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:18:13,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:18:13,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.8979591836734695) internal successors, (93), 48 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:18:13,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 113 transitions. [2022-04-28 03:18:13,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.8979591836734695) internal successors, (93), 48 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:18:13,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 113 transitions. [2022-04-28 03:18:13,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 113 transitions. [2022-04-28 03:18:14,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:18:14,017 INFO L225 Difference]: With dead ends: 108 [2022-04-28 03:18:14,017 INFO L226 Difference]: Without dead ends: 101 [2022-04-28 03:18:14,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2086 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=785, Invalid=10135, Unknown=0, NotChecked=0, Total=10920 [2022-04-28 03:18:14,018 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 52 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 4374 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 4423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 4374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:18:14,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 243 Invalid, 4423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 4374 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-04-28 03:18:14,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-28 03:18:14,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-04-28 03:18:14,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:18:14,170 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 101 states, 96 states have (on average 1.03125) internal successors, (99), 96 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call 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:14,170 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 101 states, 96 states have (on average 1.03125) internal successors, (99), 96 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call 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:14,170 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 101 states, 96 states have (on average 1.03125) internal successors, (99), 96 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call 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:14,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:18:14,171 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2022-04-28 03:18:14,171 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2022-04-28 03:18:14,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:18:14,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:18:14,171 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 96 states have (on average 1.03125) internal successors, (99), 96 states have internal predecessors, (99), 3 states have call successors, (3), 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 101 states. [2022-04-28 03:18:14,171 INFO L87 Difference]: Start difference. First operand has 101 states, 96 states have (on average 1.03125) internal successors, (99), 96 states have internal predecessors, (99), 3 states have call successors, (3), 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 101 states. [2022-04-28 03:18:14,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:18:14,172 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2022-04-28 03:18:14,172 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2022-04-28 03:18:14,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:18:14,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:18:14,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:18:14,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:18:14,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 96 states have (on average 1.03125) internal successors, (99), 96 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call 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:14,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2022-04-28 03:18:14,174 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 97 [2022-04-28 03:18:14,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:18:14,174 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2022-04-28 03:18:14,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 1.8979591836734695) internal successors, (93), 48 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:18:14,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 103 transitions. [2022-04-28 03:18:14,261 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:18:14,262 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2022-04-28 03:18:14,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-28 03:18:14,262 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:18:14,262 INFO L195 NwaCegarLoop]: trace histogram [44, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:18:14,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2022-04-28 03:18:14,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:18:14,463 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:18:14,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:18:14,463 INFO L85 PathProgramCache]: Analyzing trace with hash 297446780, now seen corresponding path program 43 times [2022-04-28 03:18:14,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:18:14,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1384897380] [2022-04-28 03:18:17,489 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:18:17,539 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:18:17,873 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:18:17,874 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:18:17,876 INFO L85 PathProgramCache]: Analyzing trace with hash -858137396, now seen corresponding path program 1 times [2022-04-28 03:18:17,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:18:17,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064623048] [2022-04-28 03:18:17,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:18:17,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:18:17,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:18:17,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:18:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:18:17,986 INFO L290 TraceCheckUtils]: 0: Hoare triple {23394#(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); {23383#true} is VALID [2022-04-28 03:18:17,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {23383#true} assume true; {23383#true} is VALID [2022-04-28 03:18:17,987 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23383#true} {23383#true} #56#return; {23383#true} is VALID [2022-04-28 03:18:17,987 INFO L272 TraceCheckUtils]: 0: Hoare triple {23383#true} call ULTIMATE.init(); {23394#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:18:17,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {23394#(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); {23383#true} is VALID [2022-04-28 03:18:17,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {23383#true} assume true; {23383#true} is VALID [2022-04-28 03:18:17,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23383#true} {23383#true} #56#return; {23383#true} is VALID [2022-04-28 03:18:17,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {23383#true} call #t~ret1 := main(); {23383#true} is VALID [2022-04-28 03:18:17,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {23383#true} ~x~0 := 0;~y~0 := 50; {23388#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:18:17,989 INFO L290 TraceCheckUtils]: 6: Hoare triple {23388#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [230] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1675 v_main_~x~0_1674))) (or (and (< v_main_~x~0_1675 v_main_~x~0_1674) (< v_main_~x~0_1674 51)) .cse0 (and .cse0 (not (< v_main_~x~0_1675 50))))) InVars {main_~x~0=v_main_~x~0_1675} OutVars{main_~x~0=v_main_~x~0_1674} AuxVars[] AssignedVars[main_~x~0] {23389#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:18:17,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {23389#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [231] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23389#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:18:17,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {23389#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [232] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1677 v_main_~x~0_1676)) (.cse1 (= v_main_~y~0_1288 v_main_~y~0_1287)) (.cse2 (<= 50 v_main_~x~0_1677))) (or (and .cse0 .cse1) (let ((.cse3 (+ v_main_~x~0_1677 v_main_~y~0_1287))) (and .cse2 (< v_main_~y~0_1288 v_main_~y~0_1287) (< .cse3 (+ 101 v_main_~y~0_1288)) (= .cse3 (+ v_main_~x~0_1676 v_main_~y~0_1288)))) (and .cse0 .cse1 (or (not (< v_main_~x~0_1677 100)) (not .cse2))))) InVars {main_~x~0=v_main_~x~0_1677, main_~y~0=v_main_~y~0_1288} OutVars{main_~x~0=v_main_~x~0_1676, main_~y~0=v_main_~y~0_1287} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {23390#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:18:17,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {23390#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} [229] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {23391#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:18:17,992 INFO L272 TraceCheckUtils]: 10: Hoare triple {23391#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {23392#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:18:17,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {23392#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {23393#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:18:17,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {23393#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {23384#false} is VALID [2022-04-28 03:18:17,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {23384#false} assume !false; {23384#false} is VALID [2022-04-28 03:18:17,993 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:17,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:18:17,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064623048] [2022-04-28 03:18:17,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064623048] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:18:17,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437386055] [2022-04-28 03:18:17,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:18:17,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:18:17,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:18:17,996 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:18,021 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:18,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:18:18,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:18:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:18:18,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:18:18,306 INFO L272 TraceCheckUtils]: 0: Hoare triple {23383#true} call ULTIMATE.init(); {23383#true} is VALID [2022-04-28 03:18:18,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {23383#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); {23383#true} is VALID [2022-04-28 03:18:18,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {23383#true} assume true; {23383#true} is VALID [2022-04-28 03:18:18,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23383#true} {23383#true} #56#return; {23383#true} is VALID [2022-04-28 03:18:18,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {23383#true} call #t~ret1 := main(); {23383#true} is VALID [2022-04-28 03:18:18,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {23383#true} ~x~0 := 0;~y~0 := 50; {23413#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:18:18,307 INFO L290 TraceCheckUtils]: 6: Hoare triple {23413#(and (<= main_~x~0 0) (= main_~y~0 50))} [230] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1675 v_main_~x~0_1674))) (or (and (< v_main_~x~0_1675 v_main_~x~0_1674) (< v_main_~x~0_1674 51)) .cse0 (and .cse0 (not (< v_main_~x~0_1675 50))))) InVars {main_~x~0=v_main_~x~0_1675} OutVars{main_~x~0=v_main_~x~0_1674} AuxVars[] AssignedVars[main_~x~0] {23417#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:18:18,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {23417#(and (= main_~y~0 50) (< main_~x~0 51))} [231] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23417#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:18:18,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {23417#(and (= main_~y~0 50) (< main_~x~0 51))} [232] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1677 v_main_~x~0_1676)) (.cse1 (= v_main_~y~0_1288 v_main_~y~0_1287)) (.cse2 (<= 50 v_main_~x~0_1677))) (or (and .cse0 .cse1) (let ((.cse3 (+ v_main_~x~0_1677 v_main_~y~0_1287))) (and .cse2 (< v_main_~y~0_1288 v_main_~y~0_1287) (< .cse3 (+ 101 v_main_~y~0_1288)) (= .cse3 (+ v_main_~x~0_1676 v_main_~y~0_1288)))) (and .cse0 .cse1 (or (not (< v_main_~x~0_1677 100)) (not .cse2))))) InVars {main_~x~0=v_main_~x~0_1677, main_~y~0=v_main_~y~0_1288} OutVars{main_~x~0=v_main_~x~0_1676, main_~y~0=v_main_~y~0_1287} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {23424#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:18:18,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {23424#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [229] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {23391#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:18:18,309 INFO L272 TraceCheckUtils]: 10: Hoare triple {23391#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {23431#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:18:18,310 INFO L290 TraceCheckUtils]: 11: Hoare triple {23431#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {23435#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:18:18,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {23435#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {23384#false} is VALID [2022-04-28 03:18:18,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {23384#false} assume !false; {23384#false} is VALID [2022-04-28 03:18:18,310 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:18,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:18:18,763 INFO L290 TraceCheckUtils]: 13: Hoare triple {23384#false} assume !false; {23384#false} is VALID [2022-04-28 03:18:18,763 INFO L290 TraceCheckUtils]: 12: Hoare triple {23435#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {23384#false} is VALID [2022-04-28 03:18:18,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {23431#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {23435#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:18:18,764 INFO L272 TraceCheckUtils]: 10: Hoare triple {23391#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {23431#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:18:18,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {23454#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [229] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {23391#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:18:18,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {23458#(and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [232] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1677 v_main_~x~0_1676)) (.cse1 (= v_main_~y~0_1288 v_main_~y~0_1287)) (.cse2 (<= 50 v_main_~x~0_1677))) (or (and .cse0 .cse1) (let ((.cse3 (+ v_main_~x~0_1677 v_main_~y~0_1287))) (and .cse2 (< v_main_~y~0_1288 v_main_~y~0_1287) (< .cse3 (+ 101 v_main_~y~0_1288)) (= .cse3 (+ v_main_~x~0_1676 v_main_~y~0_1288)))) (and .cse0 .cse1 (or (not (< v_main_~x~0_1677 100)) (not .cse2))))) InVars {main_~x~0=v_main_~x~0_1677, main_~y~0=v_main_~y~0_1288} OutVars{main_~x~0=v_main_~x~0_1676, main_~y~0=v_main_~y~0_1287} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {23454#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:18:18,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {23458#(and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [231] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23458#(and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:18:18,767 INFO L290 TraceCheckUtils]: 6: Hoare triple {23465#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (<= 50 main_~y~0) (<= main_~y~0 100) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [230] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1675 v_main_~x~0_1674))) (or (and (< v_main_~x~0_1675 v_main_~x~0_1674) (< v_main_~x~0_1674 51)) .cse0 (and .cse0 (not (< v_main_~x~0_1675 50))))) InVars {main_~x~0=v_main_~x~0_1675} OutVars{main_~x~0=v_main_~x~0_1674} AuxVars[] AssignedVars[main_~x~0] {23458#(and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:18:18,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {23383#true} ~x~0 := 0;~y~0 := 50; {23465#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (<= 50 main_~y~0) (<= main_~y~0 100) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:18:18,767 INFO L272 TraceCheckUtils]: 4: Hoare triple {23383#true} call #t~ret1 := main(); {23383#true} is VALID [2022-04-28 03:18:18,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23383#true} {23383#true} #56#return; {23383#true} is VALID [2022-04-28 03:18:18,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {23383#true} assume true; {23383#true} is VALID [2022-04-28 03:18:18,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {23383#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); {23383#true} is VALID [2022-04-28 03:18:18,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {23383#true} call ULTIMATE.init(); {23383#true} is VALID [2022-04-28 03:18:18,768 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:18,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437386055] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:18:18,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:18:18,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:18:20,841 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:18:20,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1384897380] [2022-04-28 03:18:20,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1384897380] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:18:20,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:18:20,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2022-04-28 03:18:20,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243501159] [2022-04-28 03:18:20,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:18:20,842 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.9) internal successors, (95), 49 states have internal predecessors, (95), 2 states have call successors, (3), 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 99 [2022-04-28 03:18:20,842 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:18:20,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 51 states, 50 states have (on average 1.9) internal successors, (95), 49 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call 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:20,917 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:18:20,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-04-28 03:18:20,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:18:20,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-04-28 03:18:20,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=3392, Unknown=0, NotChecked=0, Total=3782 [2022-04-28 03:18:20,919 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 49 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call 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,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:18:29,298 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2022-04-28 03:18:29,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-28 03:18:29,298 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.9) internal successors, (95), 49 states have internal predecessors, (95), 2 states have call successors, (3), 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 99 [2022-04-28 03:18:29,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:18:29,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 49 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call 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,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 115 transitions. [2022-04-28 03:18:29,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 49 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call 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,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 115 transitions. [2022-04-28 03:18:29,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 115 transitions. [2022-04-28 03:18:29,396 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:18:29,397 INFO L225 Difference]: With dead ends: 110 [2022-04-28 03:18:29,397 INFO L226 Difference]: Without dead ends: 103 [2022-04-28 03:18:29,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2154 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=801, Invalid=10541, Unknown=0, NotChecked=0, Total=11342 [2022-04-28 03:18:29,398 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 53 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 4656 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 4706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 4656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:18:29,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 253 Invalid, 4706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 4656 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-28 03:18:29,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-28 03:18:29,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-04-28 03:18:29,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:18:29,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 103 states, 98 states have (on average 1.030612244897959) internal successors, (101), 98 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:18:29,556 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 103 states, 98 states have (on average 1.030612244897959) internal successors, (101), 98 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:18:29,556 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 103 states, 98 states have (on average 1.030612244897959) internal successors, (101), 98 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:18:29,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:18:29,557 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2022-04-28 03:18:29,557 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 105 transitions. [2022-04-28 03:18:29,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:18:29,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:18:29,558 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 98 states have (on average 1.030612244897959) internal successors, (101), 98 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 103 states. [2022-04-28 03:18:29,558 INFO L87 Difference]: Start difference. First operand has 103 states, 98 states have (on average 1.030612244897959) internal successors, (101), 98 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 103 states. [2022-04-28 03:18:29,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:18:29,559 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2022-04-28 03:18:29,559 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 105 transitions. [2022-04-28 03:18:29,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:18:29,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:18:29,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:18:29,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:18:29,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.030612244897959) internal successors, (101), 98 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:18:29,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 105 transitions. [2022-04-28 03:18:29,560 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 105 transitions. Word has length 99 [2022-04-28 03:18:29,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:18:29,560 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 105 transitions. [2022-04-28 03:18:29,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.9) internal successors, (95), 49 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call 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,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 105 transitions. [2022-04-28 03:18:29,641 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:18:29,641 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 105 transitions. [2022-04-28 03:18:29,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-28 03:18:29,641 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:18:29,641 INFO L195 NwaCegarLoop]: trace histogram [45, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:18:29,661 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:18:29,842 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,SelfDestructingSolverStorable45 [2022-04-28 03:18:29,842 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:18:29,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:18:29,842 INFO L85 PathProgramCache]: Analyzing trace with hash -846780969, now seen corresponding path program 44 times [2022-04-28 03:18:29,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:18:29,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1452163603] [2022-04-28 03:18:29,944 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:18:30,326 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:18:30,327 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:18:30,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1191394764, now seen corresponding path program 1 times [2022-04-28 03:18:30,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:18:30,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377783199] [2022-04-28 03:18:30,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:18:30,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:18:30,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:18:30,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:18:30,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:18:30,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {24264#(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); {24253#true} is VALID [2022-04-28 03:18:30,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {24253#true} assume true; {24253#true} is VALID [2022-04-28 03:18:30,446 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24253#true} {24253#true} #56#return; {24253#true} is VALID [2022-04-28 03:18:30,446 INFO L272 TraceCheckUtils]: 0: Hoare triple {24253#true} call ULTIMATE.init(); {24264#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:18:30,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {24264#(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); {24253#true} is VALID [2022-04-28 03:18:30,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {24253#true} assume true; {24253#true} is VALID [2022-04-28 03:18:30,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24253#true} {24253#true} #56#return; {24253#true} is VALID [2022-04-28 03:18:30,447 INFO L272 TraceCheckUtils]: 4: Hoare triple {24253#true} call #t~ret1 := main(); {24253#true} is VALID [2022-04-28 03:18:30,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {24253#true} ~x~0 := 0;~y~0 := 50; {24258#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:18:30,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {24258#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [234] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1736 v_main_~x~0_1735))) (or .cse0 (and .cse0 (<= 50 v_main_~x~0_1736)) (and (< v_main_~x~0_1736 v_main_~x~0_1735) (< v_main_~x~0_1735 51)))) InVars {main_~x~0=v_main_~x~0_1736} OutVars{main_~x~0=v_main_~x~0_1735} AuxVars[] AssignedVars[main_~x~0] {24259#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:18:30,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {24259#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [235] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24259#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:18:30,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {24259#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [236] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1738 v_main_~x~0_1737)) (.cse1 (= v_main_~y~0_1340 v_main_~y~0_1339)) (.cse2 (<= 50 v_main_~x~0_1738))) (or (and .cse0 .cse1) (and .cse2 (< v_main_~x~0_1738 v_main_~x~0_1737) (= (+ v_main_~x~0_1737 v_main_~y~0_1340) (+ v_main_~x~0_1738 v_main_~y~0_1339)) (< v_main_~x~0_1737 101)) (and .cse0 .cse1 (or (not (< v_main_~x~0_1738 100)) (not .cse2))))) InVars {main_~x~0=v_main_~x~0_1738, main_~y~0=v_main_~y~0_1340} OutVars{main_~x~0=v_main_~x~0_1737, main_~y~0=v_main_~y~0_1339} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {24260#(or (and (not (<= main_~y~0 99)) (<= main_~y~0 100)) (<= main_~x~0 99))} is VALID [2022-04-28 03:18:30,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {24260#(or (and (not (<= main_~y~0 99)) (<= main_~y~0 100)) (<= main_~x~0 99))} [233] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {24261#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:18:30,450 INFO L272 TraceCheckUtils]: 10: Hoare triple {24261#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {24262#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:18:30,451 INFO L290 TraceCheckUtils]: 11: Hoare triple {24262#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {24263#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:18:30,451 INFO L290 TraceCheckUtils]: 12: Hoare triple {24263#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {24254#false} is VALID [2022-04-28 03:18:30,451 INFO L290 TraceCheckUtils]: 13: Hoare triple {24254#false} assume !false; {24254#false} is VALID [2022-04-28 03:18:30,451 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,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:18:30,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377783199] [2022-04-28 03:18:30,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377783199] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:18:30,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653475135] [2022-04-28 03:18:30,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:18:30,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:18:30,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:18:30,456 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:18:30,464 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:18:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:18:30,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:18:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:18:30,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:18:30,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {24253#true} call ULTIMATE.init(); {24253#true} is VALID [2022-04-28 03:18:30,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {24253#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); {24253#true} is VALID [2022-04-28 03:18:30,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {24253#true} assume true; {24253#true} is VALID [2022-04-28 03:18:30,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24253#true} {24253#true} #56#return; {24253#true} is VALID [2022-04-28 03:18:30,797 INFO L272 TraceCheckUtils]: 4: Hoare triple {24253#true} call #t~ret1 := main(); {24253#true} is VALID [2022-04-28 03:18:30,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {24253#true} ~x~0 := 0;~y~0 := 50; {24283#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:18:30,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {24283#(and (<= main_~x~0 0) (= main_~y~0 50))} [234] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1736 v_main_~x~0_1735))) (or .cse0 (and .cse0 (<= 50 v_main_~x~0_1736)) (and (< v_main_~x~0_1736 v_main_~x~0_1735) (< v_main_~x~0_1735 51)))) InVars {main_~x~0=v_main_~x~0_1736} OutVars{main_~x~0=v_main_~x~0_1735} AuxVars[] AssignedVars[main_~x~0] {24287#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:18:30,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {24287#(and (= main_~y~0 50) (< main_~x~0 51))} [235] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24287#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:18:30,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {24287#(and (= main_~y~0 50) (< main_~x~0 51))} [236] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1738 v_main_~x~0_1737)) (.cse1 (= v_main_~y~0_1340 v_main_~y~0_1339)) (.cse2 (<= 50 v_main_~x~0_1738))) (or (and .cse0 .cse1) (and .cse2 (< v_main_~x~0_1738 v_main_~x~0_1737) (= (+ v_main_~x~0_1737 v_main_~y~0_1340) (+ v_main_~x~0_1738 v_main_~y~0_1339)) (< v_main_~x~0_1737 101)) (and .cse0 .cse1 (or (not (< v_main_~x~0_1738 100)) (not .cse2))))) InVars {main_~x~0=v_main_~x~0_1738, main_~y~0=v_main_~y~0_1340} OutVars{main_~x~0=v_main_~x~0_1737, main_~y~0=v_main_~y~0_1339} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {24294#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:18:30,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {24294#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [233] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {24261#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:18:30,801 INFO L272 TraceCheckUtils]: 10: Hoare triple {24261#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {24301#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:18:30,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {24301#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {24305#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:18:30,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {24305#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24254#false} is VALID [2022-04-28 03:18:30,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {24254#false} assume !false; {24254#false} is VALID [2022-04-28 03:18:30,801 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,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:18:31,233 INFO L290 TraceCheckUtils]: 13: Hoare triple {24254#false} assume !false; {24254#false} is VALID [2022-04-28 03:18:31,234 INFO L290 TraceCheckUtils]: 12: Hoare triple {24305#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24254#false} is VALID [2022-04-28 03:18:31,234 INFO L290 TraceCheckUtils]: 11: Hoare triple {24301#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {24305#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:18:31,235 INFO L272 TraceCheckUtils]: 10: Hoare triple {24261#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {24301#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:18:31,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {24260#(or (and (not (<= main_~y~0 99)) (<= main_~y~0 100)) (<= main_~x~0 99))} [233] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {24261#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:18:31,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {24327#(and (or (not (<= main_~y~0 99)) (<= main_~x~0 99)) (or (<= main_~x~0 main_~y~0) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (<= main_~x~0 99) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [236] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1738 v_main_~x~0_1737)) (.cse1 (= v_main_~y~0_1340 v_main_~y~0_1339)) (.cse2 (<= 50 v_main_~x~0_1738))) (or (and .cse0 .cse1) (and .cse2 (< v_main_~x~0_1738 v_main_~x~0_1737) (= (+ v_main_~x~0_1737 v_main_~y~0_1340) (+ v_main_~x~0_1738 v_main_~y~0_1339)) (< v_main_~x~0_1737 101)) (and .cse0 .cse1 (or (not (< v_main_~x~0_1738 100)) (not .cse2))))) InVars {main_~x~0=v_main_~x~0_1738, main_~y~0=v_main_~y~0_1340} OutVars{main_~x~0=v_main_~x~0_1737, main_~y~0=v_main_~y~0_1339} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {24260#(or (and (not (<= main_~y~0 99)) (<= main_~y~0 100)) (<= main_~x~0 99))} is VALID [2022-04-28 03:18:31,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {24327#(and (or (not (<= main_~y~0 99)) (<= main_~x~0 99)) (or (<= main_~x~0 main_~y~0) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (<= main_~x~0 99) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [235] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24327#(and (or (not (<= main_~y~0 99)) (<= main_~x~0 99)) (or (<= main_~x~0 main_~y~0) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (<= main_~x~0 99) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:18:31,238 INFO L290 TraceCheckUtils]: 6: Hoare triple {24334#(and (<= 50 main_~y~0) (or (<= main_~x~0 main_~y~0) (<= 100 main_~x~0)) (or (not (<= main_~y~0 99)) (<= main_~x~0 99)) (<= main_~y~0 100) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [234] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1736 v_main_~x~0_1735))) (or .cse0 (and .cse0 (<= 50 v_main_~x~0_1736)) (and (< v_main_~x~0_1736 v_main_~x~0_1735) (< v_main_~x~0_1735 51)))) InVars {main_~x~0=v_main_~x~0_1736} OutVars{main_~x~0=v_main_~x~0_1735} AuxVars[] AssignedVars[main_~x~0] {24327#(and (or (not (<= main_~y~0 99)) (<= main_~x~0 99)) (or (<= main_~x~0 main_~y~0) (<= 100 main_~x~0) (not (<= 50 main_~x~0))) (or (<= main_~x~0 99) (<= main_~y~0 100)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:18:31,238 INFO L290 TraceCheckUtils]: 5: Hoare triple {24253#true} ~x~0 := 0;~y~0 := 50; {24334#(and (<= 50 main_~y~0) (or (<= main_~x~0 main_~y~0) (<= 100 main_~x~0)) (or (not (<= main_~y~0 99)) (<= main_~x~0 99)) (<= main_~y~0 100) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:18:31,238 INFO L272 TraceCheckUtils]: 4: Hoare triple {24253#true} call #t~ret1 := main(); {24253#true} is VALID [2022-04-28 03:18:31,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24253#true} {24253#true} #56#return; {24253#true} is VALID [2022-04-28 03:18:31,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {24253#true} assume true; {24253#true} is VALID [2022-04-28 03:18:31,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {24253#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); {24253#true} is VALID [2022-04-28 03:18:31,238 INFO L272 TraceCheckUtils]: 0: Hoare triple {24253#true} call ULTIMATE.init(); {24253#true} is VALID [2022-04-28 03:18:31,239 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,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653475135] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:18:31,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:18:31,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-28 03:18:33,381 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:18:33,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1452163603] [2022-04-28 03:18:33,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1452163603] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:18:33,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:18:33,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2022-04-28 03:18:33,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22752484] [2022-04-28 03:18:33,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:18:33,383 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 50 states have internal predecessors, (97), 2 states have call successors, (3), 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 101 [2022-04-28 03:18:33,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:18:33,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 52 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 50 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call 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,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:18:33,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-04-28 03:18:33,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:18:33,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-04-28 03:18:33,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=3442, Unknown=0, NotChecked=0, Total=3782 [2022-04-28 03:18:33,485 INFO L87 Difference]: Start difference. First operand 103 states and 105 transitions. Second operand has 52 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 50 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call 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:42,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:18:42,189 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2022-04-28 03:18:42,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-28 03:18:42,190 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 50 states have internal predecessors, (97), 2 states have call successors, (3), 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 101 [2022-04-28 03:18:42,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:18:42,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 50 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call 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:42,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 117 transitions. [2022-04-28 03:18:42,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 50 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call 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:42,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 117 transitions. [2022-04-28 03:18:42,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 117 transitions. [2022-04-28 03:18:42,290 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:18:42,291 INFO L225 Difference]: With dead ends: 112 [2022-04-28 03:18:42,291 INFO L226 Difference]: Without dead ends: 105 [2022-04-28 03:18:42,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2121 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=714, Invalid=10842, Unknown=0, NotChecked=0, Total=11556 [2022-04-28 03:18:42,292 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 54 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 4851 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 4902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 4851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-28 03:18:42,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 258 Invalid, 4902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 4851 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-04-28 03:18:42,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-04-28 03:18:42,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-04-28 03:18:42,470 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:18:42,470 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 105 states, 100 states have (on average 1.03) internal successors, (103), 100 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call 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:42,470 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 105 states, 100 states have (on average 1.03) internal successors, (103), 100 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call 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:42,471 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 105 states, 100 states have (on average 1.03) internal successors, (103), 100 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call 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:42,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:18:42,471 INFO L93 Difference]: Finished difference Result 105 states and 107 transitions. [2022-04-28 03:18:42,471 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2022-04-28 03:18:42,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:18:42,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:18:42,472 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 100 states have (on average 1.03) internal successors, (103), 100 states have internal predecessors, (103), 3 states have call successors, (3), 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:18:42,472 INFO L87 Difference]: Start difference. First operand has 105 states, 100 states have (on average 1.03) internal successors, (103), 100 states have internal predecessors, (103), 3 states have call successors, (3), 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:18:42,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:18:42,473 INFO L93 Difference]: Finished difference Result 105 states and 107 transitions. [2022-04-28 03:18:42,473 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2022-04-28 03:18:42,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:18:42,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:18:42,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:18:42,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:18:42,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 100 states have (on average 1.03) internal successors, (103), 100 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call 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:42,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2022-04-28 03:18:42,474 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 101 [2022-04-28 03:18:42,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:18:42,474 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2022-04-28 03:18:42,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 50 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call 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:42,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 105 states and 107 transitions. [2022-04-28 03:18:42,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:18:42,561 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2022-04-28 03:18:42,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-28 03:18:42,562 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:18:42,562 INFO L195 NwaCegarLoop]: trace histogram [46, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:18:42,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-04-28 03:18:42,762 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,SelfDestructingSolverStorable46 [2022-04-28 03:18:42,762 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:18:42,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:18:42,763 INFO L85 PathProgramCache]: Analyzing trace with hash -938019982, now seen corresponding path program 45 times [2022-04-28 03:18:42,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:18:42,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [507110200] [2022-04-28 03:18:42,869 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:18:43,063 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:18:43,064 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:18:43,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1054040372, now seen corresponding path program 1 times [2022-04-28 03:18:43,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:18:43,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348811376] [2022-04-28 03:18:43,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:18:43,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:18:43,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:18:43,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:18:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:18:43,158 INFO L290 TraceCheckUtils]: 0: Hoare triple {25148#(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); {25137#true} is VALID [2022-04-28 03:18:43,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {25137#true} assume true; {25137#true} is VALID [2022-04-28 03:18:43,159 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25137#true} {25137#true} #56#return; {25137#true} is VALID [2022-04-28 03:18:43,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {25137#true} call ULTIMATE.init(); {25148#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:18:43,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {25148#(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); {25137#true} is VALID [2022-04-28 03:18:43,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {25137#true} assume true; {25137#true} is VALID [2022-04-28 03:18:43,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25137#true} {25137#true} #56#return; {25137#true} is VALID [2022-04-28 03:18:43,159 INFO L272 TraceCheckUtils]: 4: Hoare triple {25137#true} call #t~ret1 := main(); {25137#true} is VALID [2022-04-28 03:18:43,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {25137#true} ~x~0 := 0;~y~0 := 50; {25142#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:18:43,160 INFO L290 TraceCheckUtils]: 6: Hoare triple {25142#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [238] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1798 v_main_~x~0_1797))) (or .cse0 (and .cse0 (not (< v_main_~x~0_1798 50))) (and (< v_main_~x~0_1797 51) (< v_main_~x~0_1798 v_main_~x~0_1797)))) InVars {main_~x~0=v_main_~x~0_1798} OutVars{main_~x~0=v_main_~x~0_1797} AuxVars[] AssignedVars[main_~x~0] {25143#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:18:43,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {25143#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [239] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25143#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:18:43,161 INFO L290 TraceCheckUtils]: 8: Hoare triple {25143#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [240] L28-2-->L27-2_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_1800)) (.cse1 (= v_main_~x~0_1800 v_main_~x~0_1799)) (.cse2 (= v_main_~y~0_1393 v_main_~y~0_1392))) (or (and (< v_main_~x~0_1799 101) (< v_main_~x~0_1800 v_main_~x~0_1799) (= (+ v_main_~x~0_1800 v_main_~y~0_1392) (+ v_main_~x~0_1799 v_main_~y~0_1393)) .cse0) (and .cse1 (or (not (< v_main_~x~0_1800 100)) (not .cse0)) .cse2) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_1800, main_~y~0=v_main_~y~0_1393} OutVars{main_~x~0=v_main_~x~0_1799, main_~y~0=v_main_~y~0_1392} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {25144#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:18:43,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {25144#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} [237] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {25145#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:18:43,162 INFO L272 TraceCheckUtils]: 10: Hoare triple {25145#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {25146#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:18:43,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {25146#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {25147#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:18:43,163 INFO L290 TraceCheckUtils]: 12: Hoare triple {25147#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {25138#false} is VALID [2022-04-28 03:18:43,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {25138#false} assume !false; {25138#false} is VALID [2022-04-28 03:18:43,163 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:43,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:18:43,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348811376] [2022-04-28 03:18:43,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348811376] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:18:43,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886253956] [2022-04-28 03:18:43,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:18:43,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:18:43,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:18:43,167 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:18:43,167 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:18:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:18:43,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:18:43,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:18:43,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:18:43,462 INFO L272 TraceCheckUtils]: 0: Hoare triple {25137#true} call ULTIMATE.init(); {25137#true} is VALID [2022-04-28 03:18:43,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {25137#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); {25137#true} is VALID [2022-04-28 03:18:43,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {25137#true} assume true; {25137#true} is VALID [2022-04-28 03:18:43,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25137#true} {25137#true} #56#return; {25137#true} is VALID [2022-04-28 03:18:43,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {25137#true} call #t~ret1 := main(); {25137#true} is VALID [2022-04-28 03:18:43,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {25137#true} ~x~0 := 0;~y~0 := 50; {25167#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:18:43,463 INFO L290 TraceCheckUtils]: 6: Hoare triple {25167#(and (<= main_~x~0 0) (= main_~y~0 50))} [238] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1798 v_main_~x~0_1797))) (or .cse0 (and .cse0 (not (< v_main_~x~0_1798 50))) (and (< v_main_~x~0_1797 51) (< v_main_~x~0_1798 v_main_~x~0_1797)))) InVars {main_~x~0=v_main_~x~0_1798} OutVars{main_~x~0=v_main_~x~0_1797} AuxVars[] AssignedVars[main_~x~0] {25171#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:18:43,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {25171#(and (= main_~y~0 50) (< main_~x~0 51))} [239] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25171#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:18:43,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {25171#(and (= main_~y~0 50) (< main_~x~0 51))} [240] L28-2-->L27-2_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_1800)) (.cse1 (= v_main_~x~0_1800 v_main_~x~0_1799)) (.cse2 (= v_main_~y~0_1393 v_main_~y~0_1392))) (or (and (< v_main_~x~0_1799 101) (< v_main_~x~0_1800 v_main_~x~0_1799) (= (+ v_main_~x~0_1800 v_main_~y~0_1392) (+ v_main_~x~0_1799 v_main_~y~0_1393)) .cse0) (and .cse1 (or (not (< v_main_~x~0_1800 100)) (not .cse0)) .cse2) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_1800, main_~y~0=v_main_~y~0_1393} OutVars{main_~x~0=v_main_~x~0_1799, main_~y~0=v_main_~y~0_1392} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {25178#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:18:43,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {25178#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [237] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {25145#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:18:43,466 INFO L272 TraceCheckUtils]: 10: Hoare triple {25145#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {25185#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:18:43,466 INFO L290 TraceCheckUtils]: 11: Hoare triple {25185#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25189#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:18:43,466 INFO L290 TraceCheckUtils]: 12: Hoare triple {25189#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25138#false} is VALID [2022-04-28 03:18:43,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {25138#false} assume !false; {25138#false} is VALID [2022-04-28 03:18:43,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:18:43,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:18:43,928 INFO L290 TraceCheckUtils]: 13: Hoare triple {25138#false} assume !false; {25138#false} is VALID [2022-04-28 03:18:43,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {25189#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25138#false} is VALID [2022-04-28 03:18:43,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {25185#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25189#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:18:43,930 INFO L272 TraceCheckUtils]: 10: Hoare triple {25145#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {25185#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:18:43,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {25208#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [237] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {25145#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:18:43,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {25212#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [240] L28-2-->L27-2_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_1800)) (.cse1 (= v_main_~x~0_1800 v_main_~x~0_1799)) (.cse2 (= v_main_~y~0_1393 v_main_~y~0_1392))) (or (and (< v_main_~x~0_1799 101) (< v_main_~x~0_1800 v_main_~x~0_1799) (= (+ v_main_~x~0_1800 v_main_~y~0_1392) (+ v_main_~x~0_1799 v_main_~y~0_1393)) .cse0) (and .cse1 (or (not (< v_main_~x~0_1800 100)) (not .cse0)) .cse2) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_1800, main_~y~0=v_main_~y~0_1393} OutVars{main_~x~0=v_main_~x~0_1799, main_~y~0=v_main_~y~0_1392} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {25208#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:18:43,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {25212#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [239] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25212#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:18:43,933 INFO L290 TraceCheckUtils]: 6: Hoare triple {25219#(and (<= 50 main_~y~0) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))) (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [238] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1798 v_main_~x~0_1797))) (or .cse0 (and .cse0 (not (< v_main_~x~0_1798 50))) (and (< v_main_~x~0_1797 51) (< v_main_~x~0_1798 v_main_~x~0_1797)))) InVars {main_~x~0=v_main_~x~0_1798} OutVars{main_~x~0=v_main_~x~0_1797} AuxVars[] AssignedVars[main_~x~0] {25212#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:18:43,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {25137#true} ~x~0 := 0;~y~0 := 50; {25219#(and (<= 50 main_~y~0) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))) (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:18:43,933 INFO L272 TraceCheckUtils]: 4: Hoare triple {25137#true} call #t~ret1 := main(); {25137#true} is VALID [2022-04-28 03:18:43,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25137#true} {25137#true} #56#return; {25137#true} is VALID [2022-04-28 03:18:43,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {25137#true} assume true; {25137#true} is VALID [2022-04-28 03:18:43,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {25137#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); {25137#true} is VALID [2022-04-28 03:18:43,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {25137#true} call ULTIMATE.init(); {25137#true} is VALID [2022-04-28 03:18:43,934 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:43,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886253956] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:18:43,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:18:43,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:18:46,140 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:18:46,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [507110200] [2022-04-28 03:18:46,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [507110200] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:18:46,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:18:46,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2022-04-28 03:18:46,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520799441] [2022-04-28 03:18:46,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:18:46,141 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.9038461538461537) internal successors, (99), 51 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:18:46,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:18:46,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 53 states, 52 states have (on average 1.9038461538461537) internal successors, (99), 51 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:18:46,225 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:18:46,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-04-28 03:18:46,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:18:46,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-04-28 03:18:46,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=3628, Unknown=0, NotChecked=0, Total=4032 [2022-04-28 03:18:46,226 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand has 53 states, 52 states have (on average 1.9038461538461537) internal successors, (99), 51 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:18:55,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:18:55,112 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2022-04-28 03:18:55,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-28 03:18:55,112 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.9038461538461537) internal successors, (99), 51 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:18:55,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:18:55,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.9038461538461537) internal successors, (99), 51 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:18:55,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 119 transitions. [2022-04-28 03:18:55,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.9038461538461537) internal successors, (99), 51 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:18:55,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 119 transitions. [2022-04-28 03:18:55,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 119 transitions. [2022-04-28 03:18:55,214 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:18:55,215 INFO L225 Difference]: With dead ends: 114 [2022-04-28 03:18:55,215 INFO L226 Difference]: Without dead ends: 107 [2022-04-28 03:18:55,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2293 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=833, Invalid=11377, Unknown=0, NotChecked=0, Total=12210 [2022-04-28 03:18:55,216 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 55 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 4953 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 5005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 4953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:18:55,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 258 Invalid, 5005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 4953 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-04-28 03:18:55,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-28 03:18:55,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-04-28 03:18:55,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:18:55,457 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 107 states, 102 states have (on average 1.0294117647058822) internal successors, (105), 102 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call 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:55,457 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 107 states, 102 states have (on average 1.0294117647058822) internal successors, (105), 102 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call 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:55,457 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 107 states, 102 states have (on average 1.0294117647058822) internal successors, (105), 102 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call 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:55,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:18:55,459 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2022-04-28 03:18:55,459 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2022-04-28 03:18:55,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:18:55,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:18:55,459 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 102 states have (on average 1.0294117647058822) internal successors, (105), 102 states have internal predecessors, (105), 3 states have call successors, (3), 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 107 states. [2022-04-28 03:18:55,463 INFO L87 Difference]: Start difference. First operand has 107 states, 102 states have (on average 1.0294117647058822) internal successors, (105), 102 states have internal predecessors, (105), 3 states have call successors, (3), 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 107 states. [2022-04-28 03:18:55,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:18:55,464 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2022-04-28 03:18:55,464 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2022-04-28 03:18:55,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:18:55,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:18:55,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:18:55,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:18:55,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 102 states have (on average 1.0294117647058822) internal successors, (105), 102 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call 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:55,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2022-04-28 03:18:55,466 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 109 transitions. Word has length 103 [2022-04-28 03:18:55,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:18:55,466 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 109 transitions. [2022-04-28 03:18:55,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 1.9038461538461537) internal successors, (99), 51 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:18:55,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 107 states and 109 transitions. [2022-04-28 03:18:55,566 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:18:55,566 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2022-04-28 03:18:55,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-28 03:18:55,567 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:18:55,567 INFO L195 NwaCegarLoop]: trace histogram [47, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:18:55,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-04-28 03:18:55,767 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,SelfDestructingSolverStorable47 [2022-04-28 03:18:55,768 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:18:55,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:18:55,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1575601741, now seen corresponding path program 46 times [2022-04-28 03:18:55,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:18:55,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [837370561] [2022-04-28 03:18:55,856 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:18:56,078 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:18:56,079 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:18:56,081 INFO L85 PathProgramCache]: Analyzing trace with hash 995491788, now seen corresponding path program 1 times [2022-04-28 03:18:56,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:18:56,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135455298] [2022-04-28 03:18:56,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:18:56,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:18:56,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:18:56,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:18:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:18:56,187 INFO L290 TraceCheckUtils]: 0: Hoare triple {26048#(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); {26037#true} is VALID [2022-04-28 03:18:56,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {26037#true} assume true; {26037#true} is VALID [2022-04-28 03:18:56,187 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26037#true} {26037#true} #56#return; {26037#true} is VALID [2022-04-28 03:18:56,188 INFO L272 TraceCheckUtils]: 0: Hoare triple {26037#true} call ULTIMATE.init(); {26048#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:18:56,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {26048#(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); {26037#true} is VALID [2022-04-28 03:18:56,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {26037#true} assume true; {26037#true} is VALID [2022-04-28 03:18:56,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26037#true} {26037#true} #56#return; {26037#true} is VALID [2022-04-28 03:18:56,188 INFO L272 TraceCheckUtils]: 4: Hoare triple {26037#true} call #t~ret1 := main(); {26037#true} is VALID [2022-04-28 03:18:56,188 INFO L290 TraceCheckUtils]: 5: Hoare triple {26037#true} ~x~0 := 0;~y~0 := 50; {26042#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:18:56,189 INFO L290 TraceCheckUtils]: 6: Hoare triple {26042#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [242] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1861 v_main_~x~0_1860))) (or (and (< v_main_~x~0_1861 v_main_~x~0_1860) (< v_main_~x~0_1860 51)) (and (not (< v_main_~x~0_1861 50)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_1861} OutVars{main_~x~0=v_main_~x~0_1860} AuxVars[] AssignedVars[main_~x~0] {26043#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:18:56,189 INFO L290 TraceCheckUtils]: 7: Hoare triple {26043#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [243] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26043#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:18:56,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {26043#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [244] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_1447 v_main_~y~0_1446)) (.cse3 (<= 50 v_main_~x~0_1863)) (.cse1 (= v_main_~x~0_1863 v_main_~x~0_1862))) (or (and .cse0 .cse1) (let ((.cse2 (+ v_main_~x~0_1863 v_main_~y~0_1446))) (and (= .cse2 (+ v_main_~x~0_1862 v_main_~y~0_1447)) (< .cse2 (+ 101 v_main_~y~0_1447)) (< v_main_~y~0_1447 v_main_~y~0_1446) .cse3)) (and .cse0 (or (not .cse3) (not (< v_main_~x~0_1863 100))) .cse1))) InVars {main_~x~0=v_main_~x~0_1863, main_~y~0=v_main_~y~0_1447} OutVars{main_~x~0=v_main_~x~0_1862, main_~y~0=v_main_~y~0_1446} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {26044#(or (and (or (< 99 main_~y~0) (<= main_~x~0 main_~y~0)) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:18:56,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {26044#(or (and (or (< 99 main_~y~0) (<= main_~x~0 main_~y~0)) (<= main_~y~0 100)) (<= main_~x~0 50))} [241] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {26045#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:18:56,191 INFO L272 TraceCheckUtils]: 10: Hoare triple {26045#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {26046#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:18:56,191 INFO L290 TraceCheckUtils]: 11: Hoare triple {26046#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {26047#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:18:56,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {26047#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {26038#false} is VALID [2022-04-28 03:18:56,192 INFO L290 TraceCheckUtils]: 13: Hoare triple {26038#false} assume !false; {26038#false} is VALID [2022-04-28 03:18:56,192 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:56,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:18:56,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135455298] [2022-04-28 03:18:56,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135455298] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:18:56,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568039247] [2022-04-28 03:18:56,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:18:56,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:18:56,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:18:56,196 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:18:56,197 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:18:56,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:18:56,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:18:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:18:56,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:18:56,519 INFO L272 TraceCheckUtils]: 0: Hoare triple {26037#true} call ULTIMATE.init(); {26037#true} is VALID [2022-04-28 03:18:56,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {26037#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); {26037#true} is VALID [2022-04-28 03:18:56,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {26037#true} assume true; {26037#true} is VALID [2022-04-28 03:18:56,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26037#true} {26037#true} #56#return; {26037#true} is VALID [2022-04-28 03:18:56,519 INFO L272 TraceCheckUtils]: 4: Hoare triple {26037#true} call #t~ret1 := main(); {26037#true} is VALID [2022-04-28 03:18:56,519 INFO L290 TraceCheckUtils]: 5: Hoare triple {26037#true} ~x~0 := 0;~y~0 := 50; {26067#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:18:56,520 INFO L290 TraceCheckUtils]: 6: Hoare triple {26067#(and (<= main_~x~0 0) (= main_~y~0 50))} [242] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1861 v_main_~x~0_1860))) (or (and (< v_main_~x~0_1861 v_main_~x~0_1860) (< v_main_~x~0_1860 51)) (and (not (< v_main_~x~0_1861 50)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_1861} OutVars{main_~x~0=v_main_~x~0_1860} AuxVars[] AssignedVars[main_~x~0] {26071#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:18:56,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {26071#(and (= main_~y~0 50) (< main_~x~0 51))} [243] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26071#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:18:56,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {26071#(and (= main_~y~0 50) (< main_~x~0 51))} [244] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_1447 v_main_~y~0_1446)) (.cse3 (<= 50 v_main_~x~0_1863)) (.cse1 (= v_main_~x~0_1863 v_main_~x~0_1862))) (or (and .cse0 .cse1) (let ((.cse2 (+ v_main_~x~0_1863 v_main_~y~0_1446))) (and (= .cse2 (+ v_main_~x~0_1862 v_main_~y~0_1447)) (< .cse2 (+ 101 v_main_~y~0_1447)) (< v_main_~y~0_1447 v_main_~y~0_1446) .cse3)) (and .cse0 (or (not .cse3) (not (< v_main_~x~0_1863 100))) .cse1))) InVars {main_~x~0=v_main_~x~0_1863, main_~y~0=v_main_~y~0_1447} OutVars{main_~x~0=v_main_~x~0_1862, main_~y~0=v_main_~y~0_1446} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {26078#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:18:56,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {26078#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [241] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {26045#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:18:56,522 INFO L272 TraceCheckUtils]: 10: Hoare triple {26045#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {26085#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:18:56,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {26085#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {26089#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:18:56,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {26089#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {26038#false} is VALID [2022-04-28 03:18:56,523 INFO L290 TraceCheckUtils]: 13: Hoare triple {26038#false} assume !false; {26038#false} is VALID [2022-04-28 03:18:56,523 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:56,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:18:56,977 INFO L290 TraceCheckUtils]: 13: Hoare triple {26038#false} assume !false; {26038#false} is VALID [2022-04-28 03:18:56,978 INFO L290 TraceCheckUtils]: 12: Hoare triple {26089#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {26038#false} is VALID [2022-04-28 03:18:56,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {26085#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {26089#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:18:56,984 INFO L272 TraceCheckUtils]: 10: Hoare triple {26045#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {26085#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:18:56,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {26108#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [241] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {26045#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:18:56,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {26112#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [244] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_1447 v_main_~y~0_1446)) (.cse3 (<= 50 v_main_~x~0_1863)) (.cse1 (= v_main_~x~0_1863 v_main_~x~0_1862))) (or (and .cse0 .cse1) (let ((.cse2 (+ v_main_~x~0_1863 v_main_~y~0_1446))) (and (= .cse2 (+ v_main_~x~0_1862 v_main_~y~0_1447)) (< .cse2 (+ 101 v_main_~y~0_1447)) (< v_main_~y~0_1447 v_main_~y~0_1446) .cse3)) (and .cse0 (or (not .cse3) (not (< v_main_~x~0_1863 100))) .cse1))) InVars {main_~x~0=v_main_~x~0_1863, main_~y~0=v_main_~y~0_1447} OutVars{main_~x~0=v_main_~x~0_1862, main_~y~0=v_main_~y~0_1446} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {26108#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:18:56,987 INFO L290 TraceCheckUtils]: 7: Hoare triple {26112#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [243] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26112#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:18:56,988 INFO L290 TraceCheckUtils]: 6: Hoare triple {26119#(and (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)) (or (and (< main_~x~0 (+ main_~y~0 1)) (<= 50 main_~y~0)) (<= 99 main_~y~0)))} [242] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1861 v_main_~x~0_1860))) (or (and (< v_main_~x~0_1861 v_main_~x~0_1860) (< v_main_~x~0_1860 51)) (and (not (< v_main_~x~0_1861 50)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_1861} OutVars{main_~x~0=v_main_~x~0_1860} AuxVars[] AssignedVars[main_~x~0] {26112#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:18:56,989 INFO L290 TraceCheckUtils]: 5: Hoare triple {26037#true} ~x~0 := 0;~y~0 := 50; {26119#(and (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)) (or (and (< main_~x~0 (+ main_~y~0 1)) (<= 50 main_~y~0)) (<= 99 main_~y~0)))} is VALID [2022-04-28 03:18:56,989 INFO L272 TraceCheckUtils]: 4: Hoare triple {26037#true} call #t~ret1 := main(); {26037#true} is VALID [2022-04-28 03:18:56,989 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26037#true} {26037#true} #56#return; {26037#true} is VALID [2022-04-28 03:18:56,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {26037#true} assume true; {26037#true} is VALID [2022-04-28 03:18:56,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {26037#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); {26037#true} is VALID [2022-04-28 03:18:56,989 INFO L272 TraceCheckUtils]: 0: Hoare triple {26037#true} call ULTIMATE.init(); {26037#true} is VALID [2022-04-28 03:18:56,990 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:56,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568039247] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:18:56,990 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:18:56,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:18:59,287 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:18:59,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [837370561] [2022-04-28 03:18:59,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [837370561] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:18:59,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:18:59,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2022-04-28 03:18:59,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234288512] [2022-04-28 03:18:59,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:18:59,291 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 52 states have internal predecessors, (101), 2 states have call successors, (3), 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 105 [2022-04-28 03:18:59,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:18:59,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 52 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call 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:59,378 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:18:59,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-04-28 03:18:59,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:18:59,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-04-28 03:18:59,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=3749, Unknown=0, NotChecked=0, Total=4160 [2022-04-28 03:18:59,379 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. Second operand has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 52 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call 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:08,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:19:08,545 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2022-04-28 03:19:08,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-04-28 03:19:08,545 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 52 states have internal predecessors, (101), 2 states have call successors, (3), 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 105 [2022-04-28 03:19:08,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:19:08,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 52 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call 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:08,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 121 transitions. [2022-04-28 03:19:08,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 52 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call 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:08,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 121 transitions. [2022-04-28 03:19:08,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 121 transitions. [2022-04-28 03:19:08,648 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:19:08,649 INFO L225 Difference]: With dead ends: 116 [2022-04-28 03:19:08,649 INFO L226 Difference]: Without dead ends: 109 [2022-04-28 03:19:08,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2364 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=849, Invalid=11807, Unknown=0, NotChecked=0, Total=12656 [2022-04-28 03:19:08,650 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 56 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 5154 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 5207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 5154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:19:08,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 263 Invalid, 5207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 5154 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-28 03:19:08,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-28 03:19:08,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-04-28 03:19:08,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:19:08,852 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 109 states, 104 states have (on average 1.0288461538461537) internal successors, (107), 104 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:19:08,852 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 109 states, 104 states have (on average 1.0288461538461537) internal successors, (107), 104 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:19:08,852 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 109 states, 104 states have (on average 1.0288461538461537) internal successors, (107), 104 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:19:08,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:19:08,853 INFO L93 Difference]: Finished difference Result 109 states and 111 transitions. [2022-04-28 03:19:08,853 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 111 transitions. [2022-04-28 03:19:08,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:19:08,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:19:08,853 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 104 states have (on average 1.0288461538461537) internal successors, (107), 104 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 109 states. [2022-04-28 03:19:08,853 INFO L87 Difference]: Start difference. First operand has 109 states, 104 states have (on average 1.0288461538461537) internal successors, (107), 104 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 109 states. [2022-04-28 03:19:08,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:19:08,856 INFO L93 Difference]: Finished difference Result 109 states and 111 transitions. [2022-04-28 03:19:08,856 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 111 transitions. [2022-04-28 03:19:08,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:19:08,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:19:08,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:19:08,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:19:08,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 104 states have (on average 1.0288461538461537) internal successors, (107), 104 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:19:08,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 111 transitions. [2022-04-28 03:19:08,858 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 111 transitions. Word has length 105 [2022-04-28 03:19:08,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:19:08,858 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 111 transitions. [2022-04-28 03:19:08,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 52 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call 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:08,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 111 transitions. [2022-04-28 03:19:08,951 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:19:08,951 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 111 transitions. [2022-04-28 03:19:08,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-28 03:19:08,951 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:19:08,951 INFO L195 NwaCegarLoop]: trace histogram [48, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:19:08,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-04-28 03:19:09,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:19:09,152 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:19:09,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:19:09,153 INFO L85 PathProgramCache]: Analyzing trace with hash -900510104, now seen corresponding path program 47 times [2022-04-28 03:19:09,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:19:09,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [795553136] [2022-04-28 03:19:13,218 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:19:13,276 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:19:13,470 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:19:13,471 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:19:13,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1249943348, now seen corresponding path program 1 times [2022-04-28 03:19:13,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:19:13,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576459382] [2022-04-28 03:19:13,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:19:13,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:19:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:19:13,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:19:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:19:13,586 INFO L290 TraceCheckUtils]: 0: Hoare triple {26963#(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); {26952#true} is VALID [2022-04-28 03:19:13,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {26952#true} assume true; {26952#true} is VALID [2022-04-28 03:19:13,586 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26952#true} {26952#true} #56#return; {26952#true} is VALID [2022-04-28 03:19:13,587 INFO L272 TraceCheckUtils]: 0: Hoare triple {26952#true} call ULTIMATE.init(); {26963#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:19:13,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {26963#(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); {26952#true} is VALID [2022-04-28 03:19:13,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {26952#true} assume true; {26952#true} is VALID [2022-04-28 03:19:13,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26952#true} {26952#true} #56#return; {26952#true} is VALID [2022-04-28 03:19:13,587 INFO L272 TraceCheckUtils]: 4: Hoare triple {26952#true} call #t~ret1 := main(); {26952#true} is VALID [2022-04-28 03:19:13,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {26952#true} ~x~0 := 0;~y~0 := 50; {26957#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:19:13,588 INFO L290 TraceCheckUtils]: 6: Hoare triple {26957#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [246] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1925 v_main_~x~0_1924))) (or (and (not (< v_main_~x~0_1925 50)) .cse0) (and (< v_main_~x~0_1925 v_main_~x~0_1924) (< v_main_~x~0_1924 51)) .cse0)) InVars {main_~x~0=v_main_~x~0_1925} OutVars{main_~x~0=v_main_~x~0_1924} AuxVars[] AssignedVars[main_~x~0] {26958#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:19:13,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {26958#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [247] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26958#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:19:13,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {26958#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [248] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_1502 v_main_~y~0_1501)) (.cse1 (= v_main_~x~0_1927 v_main_~x~0_1926)) (.cse2 (<= 50 v_main_~x~0_1927))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_1927 100)) (not .cse2))) (and .cse0 .cse1) (and (= (+ v_main_~x~0_1927 v_main_~y~0_1501) (+ v_main_~x~0_1926 v_main_~y~0_1502)) (< v_main_~x~0_1927 v_main_~x~0_1926) (< v_main_~x~0_1926 101) .cse2))) InVars {main_~x~0=v_main_~x~0_1927, main_~y~0=v_main_~y~0_1502} OutVars{main_~x~0=v_main_~x~0_1926, main_~y~0=v_main_~y~0_1501} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {26959#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:19:13,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {26959#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} [245] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {26960#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:19:13,590 INFO L272 TraceCheckUtils]: 10: Hoare triple {26960#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {26961#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:19:13,591 INFO L290 TraceCheckUtils]: 11: Hoare triple {26961#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {26962#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:19:13,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {26962#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {26953#false} is VALID [2022-04-28 03:19:13,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {26953#false} assume !false; {26953#false} is VALID [2022-04-28 03:19:13,591 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:13,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:19:13,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576459382] [2022-04-28 03:19:13,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576459382] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:19:13,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756212262] [2022-04-28 03:19:13,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:19:13,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:19:13,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:19:13,593 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:19:13,593 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:19:13,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:19:13,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:19:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:19:13,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:19:13,920 INFO L272 TraceCheckUtils]: 0: Hoare triple {26952#true} call ULTIMATE.init(); {26952#true} is VALID [2022-04-28 03:19:13,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {26952#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); {26952#true} is VALID [2022-04-28 03:19:13,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {26952#true} assume true; {26952#true} is VALID [2022-04-28 03:19:13,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26952#true} {26952#true} #56#return; {26952#true} is VALID [2022-04-28 03:19:13,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {26952#true} call #t~ret1 := main(); {26952#true} is VALID [2022-04-28 03:19:13,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {26952#true} ~x~0 := 0;~y~0 := 50; {26982#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:19:13,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {26982#(and (<= main_~x~0 0) (= main_~y~0 50))} [246] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1925 v_main_~x~0_1924))) (or (and (not (< v_main_~x~0_1925 50)) .cse0) (and (< v_main_~x~0_1925 v_main_~x~0_1924) (< v_main_~x~0_1924 51)) .cse0)) InVars {main_~x~0=v_main_~x~0_1925} OutVars{main_~x~0=v_main_~x~0_1924} AuxVars[] AssignedVars[main_~x~0] {26986#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:19:13,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {26986#(and (= main_~y~0 50) (< main_~x~0 51))} [247] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26986#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:19:13,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {26986#(and (= main_~y~0 50) (< main_~x~0 51))} [248] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_1502 v_main_~y~0_1501)) (.cse1 (= v_main_~x~0_1927 v_main_~x~0_1926)) (.cse2 (<= 50 v_main_~x~0_1927))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_1927 100)) (not .cse2))) (and .cse0 .cse1) (and (= (+ v_main_~x~0_1927 v_main_~y~0_1501) (+ v_main_~x~0_1926 v_main_~y~0_1502)) (< v_main_~x~0_1927 v_main_~x~0_1926) (< v_main_~x~0_1926 101) .cse2))) InVars {main_~x~0=v_main_~x~0_1927, main_~y~0=v_main_~y~0_1502} OutVars{main_~x~0=v_main_~x~0_1926, main_~y~0=v_main_~y~0_1501} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {26993#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:19:13,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {26993#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [245] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {26960#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:19:13,924 INFO L272 TraceCheckUtils]: 10: Hoare triple {26960#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {27000#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:19:13,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {27000#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {27004#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:19:13,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {27004#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {26953#false} is VALID [2022-04-28 03:19:13,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {26953#false} assume !false; {26953#false} is VALID [2022-04-28 03:19:13,927 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:13,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:19:14,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {26953#false} assume !false; {26953#false} is VALID [2022-04-28 03:19:14,373 INFO L290 TraceCheckUtils]: 12: Hoare triple {27004#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {26953#false} is VALID [2022-04-28 03:19:14,373 INFO L290 TraceCheckUtils]: 11: Hoare triple {27000#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {27004#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:19:14,374 INFO L272 TraceCheckUtils]: 10: Hoare triple {26960#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {27000#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:19:14,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {27023#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [245] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {26960#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:19:14,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {27027#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [248] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_1502 v_main_~y~0_1501)) (.cse1 (= v_main_~x~0_1927 v_main_~x~0_1926)) (.cse2 (<= 50 v_main_~x~0_1927))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_1927 100)) (not .cse2))) (and .cse0 .cse1) (and (= (+ v_main_~x~0_1927 v_main_~y~0_1501) (+ v_main_~x~0_1926 v_main_~y~0_1502)) (< v_main_~x~0_1927 v_main_~x~0_1926) (< v_main_~x~0_1926 101) .cse2))) InVars {main_~x~0=v_main_~x~0_1927, main_~y~0=v_main_~y~0_1502} OutVars{main_~x~0=v_main_~x~0_1926, main_~y~0=v_main_~y~0_1501} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {27023#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:19:14,376 INFO L290 TraceCheckUtils]: 7: Hoare triple {27027#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [247] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27027#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:19:14,376 INFO L290 TraceCheckUtils]: 6: Hoare triple {27034#(and (<= 50 main_~y~0) (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [246] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1925 v_main_~x~0_1924))) (or (and (not (< v_main_~x~0_1925 50)) .cse0) (and (< v_main_~x~0_1925 v_main_~x~0_1924) (< v_main_~x~0_1924 51)) .cse0)) InVars {main_~x~0=v_main_~x~0_1925} OutVars{main_~x~0=v_main_~x~0_1924} AuxVars[] AssignedVars[main_~x~0] {27027#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:19:14,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {26952#true} ~x~0 := 0;~y~0 := 50; {27034#(and (<= 50 main_~y~0) (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:19:14,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {26952#true} call #t~ret1 := main(); {26952#true} is VALID [2022-04-28 03:19:14,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26952#true} {26952#true} #56#return; {26952#true} is VALID [2022-04-28 03:19:14,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {26952#true} assume true; {26952#true} is VALID [2022-04-28 03:19:14,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {26952#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); {26952#true} is VALID [2022-04-28 03:19:14,377 INFO L272 TraceCheckUtils]: 0: Hoare triple {26952#true} call ULTIMATE.init(); {26952#true} is VALID [2022-04-28 03:19:14,377 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:14,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756212262] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:19:14,378 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:19:14,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:19:16,809 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:19:16,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [795553136] [2022-04-28 03:19:16,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [795553136] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:19:16,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:19:16,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2022-04-28 03:19:16,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481398171] [2022-04-28 03:19:16,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:19:16,811 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 53 states have internal predecessors, (103), 2 states have call successors, (3), 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 107 [2022-04-28 03:19:16,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:19:16,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 55 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 53 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call 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:16,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:19:16,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-04-28 03:19:16,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:19:16,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-04-28 03:19:16,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=418, Invalid=3872, Unknown=0, NotChecked=0, Total=4290 [2022-04-28 03:19:16,910 INFO L87 Difference]: Start difference. First operand 109 states and 111 transitions. Second operand has 55 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 53 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call 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:26,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:19:26,608 INFO L93 Difference]: Finished difference Result 118 states and 123 transitions. [2022-04-28 03:19:26,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-28 03:19:26,608 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 53 states have internal predecessors, (103), 2 states have call successors, (3), 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 107 [2022-04-28 03:19:26,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:19:26,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 53 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call 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:26,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 123 transitions. [2022-04-28 03:19:26,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 53 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call 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:26,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 123 transitions. [2022-04-28 03:19:26,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 123 transitions. [2022-04-28 03:19:26,722 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:19:26,723 INFO L225 Difference]: With dead ends: 118 [2022-04-28 03:19:26,723 INFO L226 Difference]: Without dead ends: 111 [2022-04-28 03:19:26,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2436 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=865, Invalid=12245, Unknown=0, NotChecked=0, Total=13110 [2022-04-28 03:19:26,724 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 57 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 5460 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 5514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 5460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:19:26,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 273 Invalid, 5514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 5460 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-04-28 03:19:26,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-28 03:19:26,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-04-28 03:19:26,904 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:19:26,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 111 states, 106 states have (on average 1.028301886792453) internal successors, (109), 106 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call 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:26,904 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 111 states, 106 states have (on average 1.028301886792453) internal successors, (109), 106 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call 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:26,904 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 111 states, 106 states have (on average 1.028301886792453) internal successors, (109), 106 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call 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:26,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:19:26,905 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2022-04-28 03:19:26,905 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2022-04-28 03:19:26,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:19:26,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:19:26,906 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 106 states have (on average 1.028301886792453) internal successors, (109), 106 states have internal predecessors, (109), 3 states have call successors, (3), 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:19:26,906 INFO L87 Difference]: Start difference. First operand has 111 states, 106 states have (on average 1.028301886792453) internal successors, (109), 106 states have internal predecessors, (109), 3 states have call successors, (3), 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:19:26,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:19:26,907 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2022-04-28 03:19:26,907 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2022-04-28 03:19:26,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:19:26,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:19:26,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:19:26,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:19:26,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.028301886792453) internal successors, (109), 106 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call 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:26,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 113 transitions. [2022-04-28 03:19:26,908 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 113 transitions. Word has length 107 [2022-04-28 03:19:26,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:19:26,908 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 113 transitions. [2022-04-28 03:19:26,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 53 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call 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:26,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 113 transitions. [2022-04-28 03:19:27,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:19:27,004 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2022-04-28 03:19:27,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-28 03:19:27,005 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:19:27,005 INFO L195 NwaCegarLoop]: trace histogram [49, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:19:27,021 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:19:27,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-04-28 03:19:27,207 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:19:27,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:19:27,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1032111165, now seen corresponding path program 48 times [2022-04-28 03:19:27,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:19:27,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [796971437] [2022-04-28 03:19:27,307 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:19:27,513 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:19:27,514 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:19:27,517 INFO L85 PathProgramCache]: Analyzing trace with hash 799588812, now seen corresponding path program 1 times [2022-04-28 03:19:27,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:19:27,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852335010] [2022-04-28 03:19:27,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:19:27,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:19:27,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:19:27,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:19:27,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:19:27,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {27893#(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); {27882#true} is VALID [2022-04-28 03:19:27,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {27882#true} assume true; {27882#true} is VALID [2022-04-28 03:19:27,626 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27882#true} {27882#true} #56#return; {27882#true} is VALID [2022-04-28 03:19:27,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {27882#true} call ULTIMATE.init(); {27893#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:19:27,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {27893#(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); {27882#true} is VALID [2022-04-28 03:19:27,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {27882#true} assume true; {27882#true} is VALID [2022-04-28 03:19:27,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27882#true} {27882#true} #56#return; {27882#true} is VALID [2022-04-28 03:19:27,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {27882#true} call #t~ret1 := main(); {27882#true} is VALID [2022-04-28 03:19:27,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {27882#true} ~x~0 := 0;~y~0 := 50; {27887#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:19:27,628 INFO L290 TraceCheckUtils]: 6: Hoare triple {27887#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [250] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1990 v_main_~x~0_1989))) (or (and .cse0 (not (< v_main_~x~0_1990 50))) (and (< v_main_~x~0_1989 51) (< v_main_~x~0_1990 v_main_~x~0_1989)) .cse0)) InVars {main_~x~0=v_main_~x~0_1990} OutVars{main_~x~0=v_main_~x~0_1989} AuxVars[] AssignedVars[main_~x~0] {27888#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:19:27,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {27888#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [251] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27888#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:19:27,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {27888#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 50))} [252] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1992 v_main_~x~0_1991)) (.cse1 (= v_main_~y~0_1558 v_main_~y~0_1557)) (.cse2 (<= 50 v_main_~x~0_1992))) (or (and .cse0 .cse1) (and (or (not .cse2) (not (< v_main_~x~0_1992 100))) .cse0 .cse1) (and (< v_main_~x~0_1992 v_main_~x~0_1991) .cse2 (< v_main_~x~0_1991 101) (= (+ v_main_~x~0_1991 v_main_~y~0_1558) (+ v_main_~x~0_1992 v_main_~y~0_1557))))) InVars {main_~x~0=v_main_~x~0_1992, main_~y~0=v_main_~y~0_1558} OutVars{main_~x~0=v_main_~x~0_1991, main_~y~0=v_main_~y~0_1557} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {27889#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:19:27,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {27889#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} [249] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {27890#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:19:27,631 INFO L272 TraceCheckUtils]: 10: Hoare triple {27890#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {27891#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:19:27,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {27891#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {27892#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:19:27,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {27892#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {27883#false} is VALID [2022-04-28 03:19:27,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {27883#false} assume !false; {27883#false} is VALID [2022-04-28 03:19:27,632 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:27,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:19:27,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852335010] [2022-04-28 03:19:27,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852335010] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:19:27,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388937196] [2022-04-28 03:19:27,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:19:27,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:19:27,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:19:27,636 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:19:27,659 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:19:27,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:19:27,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:19:27,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:19:27,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:19:27,946 INFO L272 TraceCheckUtils]: 0: Hoare triple {27882#true} call ULTIMATE.init(); {27882#true} is VALID [2022-04-28 03:19:27,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {27882#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); {27882#true} is VALID [2022-04-28 03:19:27,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {27882#true} assume true; {27882#true} is VALID [2022-04-28 03:19:27,946 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27882#true} {27882#true} #56#return; {27882#true} is VALID [2022-04-28 03:19:27,946 INFO L272 TraceCheckUtils]: 4: Hoare triple {27882#true} call #t~ret1 := main(); {27882#true} is VALID [2022-04-28 03:19:27,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {27882#true} ~x~0 := 0;~y~0 := 50; {27912#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:19:27,947 INFO L290 TraceCheckUtils]: 6: Hoare triple {27912#(and (<= main_~x~0 0) (= main_~y~0 50))} [250] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1990 v_main_~x~0_1989))) (or (and .cse0 (not (< v_main_~x~0_1990 50))) (and (< v_main_~x~0_1989 51) (< v_main_~x~0_1990 v_main_~x~0_1989)) .cse0)) InVars {main_~x~0=v_main_~x~0_1990} OutVars{main_~x~0=v_main_~x~0_1989} AuxVars[] AssignedVars[main_~x~0] {27916#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:19:27,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {27916#(and (= main_~y~0 50) (< main_~x~0 51))} [251] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27916#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:19:27,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {27916#(and (= main_~y~0 50) (< main_~x~0 51))} [252] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1992 v_main_~x~0_1991)) (.cse1 (= v_main_~y~0_1558 v_main_~y~0_1557)) (.cse2 (<= 50 v_main_~x~0_1992))) (or (and .cse0 .cse1) (and (or (not .cse2) (not (< v_main_~x~0_1992 100))) .cse0 .cse1) (and (< v_main_~x~0_1992 v_main_~x~0_1991) .cse2 (< v_main_~x~0_1991 101) (= (+ v_main_~x~0_1991 v_main_~y~0_1558) (+ v_main_~x~0_1992 v_main_~y~0_1557))))) InVars {main_~x~0=v_main_~x~0_1992, main_~y~0=v_main_~y~0_1558} OutVars{main_~x~0=v_main_~x~0_1991, main_~y~0=v_main_~y~0_1557} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {27923#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:19:27,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {27923#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [249] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {27890#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:19:27,950 INFO L272 TraceCheckUtils]: 10: Hoare triple {27890#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {27930#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:19:27,950 INFO L290 TraceCheckUtils]: 11: Hoare triple {27930#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {27934#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:19:27,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {27934#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {27883#false} is VALID [2022-04-28 03:19:27,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {27883#false} assume !false; {27883#false} is VALID [2022-04-28 03:19:27,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:19:27,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:19:28,394 INFO L290 TraceCheckUtils]: 13: Hoare triple {27883#false} assume !false; {27883#false} is VALID [2022-04-28 03:19:28,394 INFO L290 TraceCheckUtils]: 12: Hoare triple {27934#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {27883#false} is VALID [2022-04-28 03:19:28,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {27930#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {27934#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:19:28,395 INFO L272 TraceCheckUtils]: 10: Hoare triple {27890#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {27930#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:19:28,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {27953#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [249] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {27890#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:19:28,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {27957#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [252] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1992 v_main_~x~0_1991)) (.cse1 (= v_main_~y~0_1558 v_main_~y~0_1557)) (.cse2 (<= 50 v_main_~x~0_1992))) (or (and .cse0 .cse1) (and (or (not .cse2) (not (< v_main_~x~0_1992 100))) .cse0 .cse1) (and (< v_main_~x~0_1992 v_main_~x~0_1991) .cse2 (< v_main_~x~0_1991 101) (= (+ v_main_~x~0_1991 v_main_~y~0_1558) (+ v_main_~x~0_1992 v_main_~y~0_1557))))) InVars {main_~x~0=v_main_~x~0_1992, main_~y~0=v_main_~y~0_1558} OutVars{main_~x~0=v_main_~x~0_1991, main_~y~0=v_main_~y~0_1557} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {27953#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:19:28,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {27957#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [251] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27957#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:19:28,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {27964#(and (<= 50 main_~y~0) (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [250] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1990 v_main_~x~0_1989))) (or (and .cse0 (not (< v_main_~x~0_1990 50))) (and (< v_main_~x~0_1989 51) (< v_main_~x~0_1990 v_main_~x~0_1989)) .cse0)) InVars {main_~x~0=v_main_~x~0_1990} OutVars{main_~x~0=v_main_~x~0_1989} AuxVars[] AssignedVars[main_~x~0] {27957#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:19:28,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {27882#true} ~x~0 := 0;~y~0 := 50; {27964#(and (<= 50 main_~y~0) (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (<= main_~y~0 main_~x~0))) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:19:28,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {27882#true} call #t~ret1 := main(); {27882#true} is VALID [2022-04-28 03:19:28,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27882#true} {27882#true} #56#return; {27882#true} is VALID [2022-04-28 03:19:28,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {27882#true} assume true; {27882#true} is VALID [2022-04-28 03:19:28,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {27882#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); {27882#true} is VALID [2022-04-28 03:19:28,399 INFO L272 TraceCheckUtils]: 0: Hoare triple {27882#true} call ULTIMATE.init(); {27882#true} is VALID [2022-04-28 03:19:28,399 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:28,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388937196] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:19:28,399 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:19:28,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:19:30,832 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:19:30,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [796971437] [2022-04-28 03:19:30,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [796971437] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:19:30,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:19:30,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2022-04-28 03:19:30,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693464495] [2022-04-28 03:19:30,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:19:30,833 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 54 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:19:30,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:19:30,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 56 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 54 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:19:30,917 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:19:30,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-04-28 03:19:30,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:19:30,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-04-28 03:19:30,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=425, Invalid=3997, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 03:19:30,918 INFO L87 Difference]: Start difference. First operand 111 states and 113 transitions. Second operand has 56 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 54 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:19:40,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:19:40,806 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2022-04-28 03:19:40,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-04-28 03:19:40,807 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 54 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:19:40,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:19:40,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 54 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:19:40,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 125 transitions. [2022-04-28 03:19:40,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 54 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:19:40,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 125 transitions. [2022-04-28 03:19:40,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 125 transitions. [2022-04-28 03:19:40,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:19:40,915 INFO L225 Difference]: With dead ends: 120 [2022-04-28 03:19:40,915 INFO L226 Difference]: Without dead ends: 113 [2022-04-28 03:19:40,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2509 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=881, Invalid=12691, Unknown=0, NotChecked=0, Total=13572 [2022-04-28 03:19:40,916 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 58 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 5568 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 5623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 5568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:19:40,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 273 Invalid, 5623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 5568 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-04-28 03:19:40,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-28 03:19:41,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-04-28 03:19:41,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:19:41,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 113 states, 108 states have (on average 1.0277777777777777) internal successors, (111), 108 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call 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:41,099 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 113 states, 108 states have (on average 1.0277777777777777) internal successors, (111), 108 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call 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:41,099 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 113 states, 108 states have (on average 1.0277777777777777) internal successors, (111), 108 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call 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:41,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:19:41,100 INFO L93 Difference]: Finished difference Result 113 states and 115 transitions. [2022-04-28 03:19:41,100 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 115 transitions. [2022-04-28 03:19:41,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:19:41,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:19:41,101 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 108 states have (on average 1.0277777777777777) internal successors, (111), 108 states have internal predecessors, (111), 3 states have call successors, (3), 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 113 states. [2022-04-28 03:19:41,101 INFO L87 Difference]: Start difference. First operand has 113 states, 108 states have (on average 1.0277777777777777) internal successors, (111), 108 states have internal predecessors, (111), 3 states have call successors, (3), 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 113 states. [2022-04-28 03:19:41,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:19:41,102 INFO L93 Difference]: Finished difference Result 113 states and 115 transitions. [2022-04-28 03:19:41,102 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 115 transitions. [2022-04-28 03:19:41,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:19:41,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:19:41,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:19:41,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:19:41,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 108 states have (on average 1.0277777777777777) internal successors, (111), 108 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call 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:41,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 115 transitions. [2022-04-28 03:19:41,103 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 115 transitions. Word has length 109 [2022-04-28 03:19:41,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:19:41,104 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 115 transitions. [2022-04-28 03:19:41,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 54 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:19:41,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 113 states and 115 transitions. [2022-04-28 03:19:41,192 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:19:41,192 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 115 transitions. [2022-04-28 03:19:41,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-28 03:19:41,193 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:19:41,193 INFO L195 NwaCegarLoop]: trace histogram [50, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:19:41,209 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:19:41,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:19:41,393 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:19:41,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:19:41,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1348288094, now seen corresponding path program 49 times [2022-04-28 03:19:41,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:19:41,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2125050729] [2022-04-28 03:19:45,461 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:19:45,513 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:19:45,735 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:19:45,736 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:19:45,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1445846324, now seen corresponding path program 1 times [2022-04-28 03:19:45,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:19:45,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495031909] [2022-04-28 03:19:45,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:19:45,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:19:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:19:45,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:19:45,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:19:45,842 INFO L290 TraceCheckUtils]: 0: Hoare triple {28838#(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); {28827#true} is VALID [2022-04-28 03:19:45,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {28827#true} assume true; {28827#true} is VALID [2022-04-28 03:19:45,842 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28827#true} {28827#true} #56#return; {28827#true} is VALID [2022-04-28 03:19:45,842 INFO L272 TraceCheckUtils]: 0: Hoare triple {28827#true} call ULTIMATE.init(); {28838#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:19:45,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {28838#(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); {28827#true} is VALID [2022-04-28 03:19:45,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {28827#true} assume true; {28827#true} is VALID [2022-04-28 03:19:45,842 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28827#true} {28827#true} #56#return; {28827#true} is VALID [2022-04-28 03:19:45,843 INFO L272 TraceCheckUtils]: 4: Hoare triple {28827#true} call #t~ret1 := main(); {28827#true} is VALID [2022-04-28 03:19:45,843 INFO L290 TraceCheckUtils]: 5: Hoare triple {28827#true} ~x~0 := 0;~y~0 := 50; {28832#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:19:45,844 INFO L290 TraceCheckUtils]: 6: Hoare triple {28832#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [254] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2056 v_main_~x~0_2055))) (or (and (<= 50 v_main_~x~0_2056) .cse0) .cse0 (and (< v_main_~x~0_2055 51) (< v_main_~x~0_2056 v_main_~x~0_2055)))) InVars {main_~x~0=v_main_~x~0_2056} OutVars{main_~x~0=v_main_~x~0_2055} AuxVars[] AssignedVars[main_~x~0] {28833#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:19:45,844 INFO L290 TraceCheckUtils]: 7: Hoare triple {28833#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [255] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28833#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:19:45,845 INFO L290 TraceCheckUtils]: 8: Hoare triple {28833#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [256] L28-2-->L27-2_primed: Formula: (let ((.cse1 (<= 50 v_main_~x~0_2058)) (.cse0 (= v_main_~x~0_2058 v_main_~x~0_2057)) (.cse2 (= v_main_~y~0_1615 v_main_~y~0_1614))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_2058 100))) .cse2) (let ((.cse3 (+ v_main_~x~0_2058 v_main_~y~0_1614))) (and (< v_main_~y~0_1615 v_main_~y~0_1614) (< .cse3 (+ 101 v_main_~y~0_1615)) .cse1 (= (+ v_main_~x~0_2057 v_main_~y~0_1615) .cse3))) (and .cse0 .cse2))) InVars {main_~x~0=v_main_~x~0_2058, main_~y~0=v_main_~y~0_1615} OutVars{main_~x~0=v_main_~x~0_2057, main_~y~0=v_main_~y~0_1614} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {28834#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:19:45,845 INFO L290 TraceCheckUtils]: 9: Hoare triple {28834#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} [253] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {28835#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:19:45,846 INFO L272 TraceCheckUtils]: 10: Hoare triple {28835#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {28836#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:19:45,846 INFO L290 TraceCheckUtils]: 11: Hoare triple {28836#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {28837#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:19:45,847 INFO L290 TraceCheckUtils]: 12: Hoare triple {28837#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {28828#false} is VALID [2022-04-28 03:19:45,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {28828#false} assume !false; {28828#false} is VALID [2022-04-28 03:19:45,847 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:45,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:19:45,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495031909] [2022-04-28 03:19:45,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495031909] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:19:45,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349863832] [2022-04-28 03:19:45,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:19:45,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:19:45,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:19:45,849 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:19:45,851 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:19:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:19:45,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:19:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:19:45,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:19:46,160 INFO L272 TraceCheckUtils]: 0: Hoare triple {28827#true} call ULTIMATE.init(); {28827#true} is VALID [2022-04-28 03:19:46,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {28827#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); {28827#true} is VALID [2022-04-28 03:19:46,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {28827#true} assume true; {28827#true} is VALID [2022-04-28 03:19:46,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28827#true} {28827#true} #56#return; {28827#true} is VALID [2022-04-28 03:19:46,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {28827#true} call #t~ret1 := main(); {28827#true} is VALID [2022-04-28 03:19:46,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {28827#true} ~x~0 := 0;~y~0 := 50; {28857#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:19:46,162 INFO L290 TraceCheckUtils]: 6: Hoare triple {28857#(and (<= main_~x~0 0) (= main_~y~0 50))} [254] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2056 v_main_~x~0_2055))) (or (and (<= 50 v_main_~x~0_2056) .cse0) .cse0 (and (< v_main_~x~0_2055 51) (< v_main_~x~0_2056 v_main_~x~0_2055)))) InVars {main_~x~0=v_main_~x~0_2056} OutVars{main_~x~0=v_main_~x~0_2055} AuxVars[] AssignedVars[main_~x~0] {28861#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:19:46,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {28861#(and (= main_~y~0 50) (< main_~x~0 51))} [255] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28861#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:19:46,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {28861#(and (= main_~y~0 50) (< main_~x~0 51))} [256] L28-2-->L27-2_primed: Formula: (let ((.cse1 (<= 50 v_main_~x~0_2058)) (.cse0 (= v_main_~x~0_2058 v_main_~x~0_2057)) (.cse2 (= v_main_~y~0_1615 v_main_~y~0_1614))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_2058 100))) .cse2) (let ((.cse3 (+ v_main_~x~0_2058 v_main_~y~0_1614))) (and (< v_main_~y~0_1615 v_main_~y~0_1614) (< .cse3 (+ 101 v_main_~y~0_1615)) .cse1 (= (+ v_main_~x~0_2057 v_main_~y~0_1615) .cse3))) (and .cse0 .cse2))) InVars {main_~x~0=v_main_~x~0_2058, main_~y~0=v_main_~y~0_1615} OutVars{main_~x~0=v_main_~x~0_2057, main_~y~0=v_main_~y~0_1614} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {28868#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:19:46,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {28868#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [253] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {28835#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:19:46,164 INFO L272 TraceCheckUtils]: 10: Hoare triple {28835#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {28875#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:19:46,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {28875#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {28879#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:19:46,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {28879#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {28828#false} is VALID [2022-04-28 03:19:46,165 INFO L290 TraceCheckUtils]: 13: Hoare triple {28828#false} assume !false; {28828#false} is VALID [2022-04-28 03:19:46,165 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:46,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:19:46,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {28828#false} assume !false; {28828#false} is VALID [2022-04-28 03:19:46,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {28879#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {28828#false} is VALID [2022-04-28 03:19:46,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {28875#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {28879#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:19:46,617 INFO L272 TraceCheckUtils]: 10: Hoare triple {28835#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {28875#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:19:46,618 INFO L290 TraceCheckUtils]: 9: Hoare triple {28898#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [253] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {28835#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:19:46,619 INFO L290 TraceCheckUtils]: 8: Hoare triple {28902#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [256] L28-2-->L27-2_primed: Formula: (let ((.cse1 (<= 50 v_main_~x~0_2058)) (.cse0 (= v_main_~x~0_2058 v_main_~x~0_2057)) (.cse2 (= v_main_~y~0_1615 v_main_~y~0_1614))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_2058 100))) .cse2) (let ((.cse3 (+ v_main_~x~0_2058 v_main_~y~0_1614))) (and (< v_main_~y~0_1615 v_main_~y~0_1614) (< .cse3 (+ 101 v_main_~y~0_1615)) .cse1 (= (+ v_main_~x~0_2057 v_main_~y~0_1615) .cse3))) (and .cse0 .cse2))) InVars {main_~x~0=v_main_~x~0_2058, main_~y~0=v_main_~y~0_1615} OutVars{main_~x~0=v_main_~x~0_2057, main_~y~0=v_main_~y~0_1614} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {28898#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:19:46,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {28902#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [255] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28902#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:19:46,620 INFO L290 TraceCheckUtils]: 6: Hoare triple {28909#(and (<= 50 main_~y~0) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} [254] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2056 v_main_~x~0_2055))) (or (and (<= 50 v_main_~x~0_2056) .cse0) .cse0 (and (< v_main_~x~0_2055 51) (< v_main_~x~0_2056 v_main_~x~0_2055)))) InVars {main_~x~0=v_main_~x~0_2056} OutVars{main_~x~0=v_main_~x~0_2055} AuxVars[] AssignedVars[main_~x~0] {28902#(and (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:19:46,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {28827#true} ~x~0 := 0;~y~0 := 50; {28909#(and (<= 50 main_~y~0) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (not (<= 50 main_~x~0)) (and (or (< main_~x~0 (+ main_~y~0 1)) (<= 100 main_~x~0)) (<= main_~y~0 main_~x~0))) (or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100))))} is VALID [2022-04-28 03:19:46,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {28827#true} call #t~ret1 := main(); {28827#true} is VALID [2022-04-28 03:19:46,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28827#true} {28827#true} #56#return; {28827#true} is VALID [2022-04-28 03:19:46,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {28827#true} assume true; {28827#true} is VALID [2022-04-28 03:19:46,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {28827#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); {28827#true} is VALID [2022-04-28 03:19:46,621 INFO L272 TraceCheckUtils]: 0: Hoare triple {28827#true} call ULTIMATE.init(); {28827#true} is VALID [2022-04-28 03:19:46,621 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:46,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349863832] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:19:46,621 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:19:46,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:19:49,089 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:19:49,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2125050729] [2022-04-28 03:19:49,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2125050729] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:19:49,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:19:49,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2022-04-28 03:19:49,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766867539] [2022-04-28 03:19:49,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:19:49,090 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.9107142857142858) internal successors, (107), 55 states have internal predecessors, (107), 2 states have call successors, (3), 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 111 [2022-04-28 03:19:49,090 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:19:49,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 57 states, 56 states have (on average 1.9107142857142858) internal successors, (107), 55 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call 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:49,174 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:19:49,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-04-28 03:19:49,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:19:49,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-04-28 03:19:49,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=432, Invalid=4124, Unknown=0, NotChecked=0, Total=4556 [2022-04-28 03:19:49,175 INFO L87 Difference]: Start difference. First operand 113 states and 115 transitions. Second operand has 57 states, 56 states have (on average 1.9107142857142858) internal successors, (107), 55 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call 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,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:19:59,631 INFO L93 Difference]: Finished difference Result 127 states and 134 transitions. [2022-04-28 03:19:59,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-04-28 03:19:59,631 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.9107142857142858) internal successors, (107), 55 states have internal predecessors, (107), 2 states have call successors, (3), 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 111 [2022-04-28 03:19:59,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:19:59,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.9107142857142858) internal successors, (107), 55 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call 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,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 134 transitions. [2022-04-28 03:19:59,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.9107142857142858) internal successors, (107), 55 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call 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,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 134 transitions. [2022-04-28 03:19:59,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 134 transitions. [2022-04-28 03:19:59,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:19:59,747 INFO L225 Difference]: With dead ends: 127 [2022-04-28 03:19:59,747 INFO L226 Difference]: Without dead ends: 117 [2022-04-28 03:19:59,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2909 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=913, Invalid=13849, Unknown=0, NotChecked=0, Total=14762 [2022-04-28 03:19:59,750 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 67 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 5938 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 5997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 5938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:19:59,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 279 Invalid, 5997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 5938 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-04-28 03:19:59,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-04-28 03:19:59,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-04-28 03:19:59,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:19:59,926 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 117 states, 112 states have (on average 1.0357142857142858) internal successors, (116), 112 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:19:59,926 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 117 states, 112 states have (on average 1.0357142857142858) internal successors, (116), 112 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:19:59,926 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 117 states, 112 states have (on average 1.0357142857142858) internal successors, (116), 112 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:19:59,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:19:59,927 INFO L93 Difference]: Finished difference Result 117 states and 120 transitions. [2022-04-28 03:19:59,927 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 120 transitions. [2022-04-28 03:19:59,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:19:59,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:19:59,928 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 112 states have (on average 1.0357142857142858) internal successors, (116), 112 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:19:59,928 INFO L87 Difference]: Start difference. First operand has 117 states, 112 states have (on average 1.0357142857142858) internal successors, (116), 112 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:19:59,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:19:59,929 INFO L93 Difference]: Finished difference Result 117 states and 120 transitions. [2022-04-28 03:19:59,929 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 120 transitions. [2022-04-28 03:19:59,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:19:59,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:19:59,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:19:59,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:19:59,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 112 states have (on average 1.0357142857142858) internal successors, (116), 112 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:19:59,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 120 transitions. [2022-04-28 03:19:59,931 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 120 transitions. Word has length 111 [2022-04-28 03:19:59,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:19:59,931 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 120 transitions. [2022-04-28 03:19:59,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.9107142857142858) internal successors, (107), 55 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call 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,931 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 117 states and 120 transitions. [2022-04-28 03:20:00,035 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:20:00,036 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 120 transitions. [2022-04-28 03:20:00,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-28 03:20:00,036 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:20:00,036 INFO L195 NwaCegarLoop]: trace histogram [52, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:20:00,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2022-04-28 03:20:00,236 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,SelfDestructingSolverStorable51 [2022-04-28 03:20:00,237 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:20:00,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:20:00,237 INFO L85 PathProgramCache]: Analyzing trace with hash -547208364, now seen corresponding path program 50 times [2022-04-28 03:20:00,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:20:00,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [375299196] [2022-04-28 03:20:00,323 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:20:03,162 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:20:03,163 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:20:03,165 INFO L85 PathProgramCache]: Analyzing trace with hash 603685836, now seen corresponding path program 1 times [2022-04-28 03:20:03,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:20:03,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547095249] [2022-04-28 03:20:03,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:20:03,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:20:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:20:03,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:20:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:20:03,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {29822#(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); {29811#true} is VALID [2022-04-28 03:20:03,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {29811#true} assume true; {29811#true} is VALID [2022-04-28 03:20:03,282 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29811#true} {29811#true} #56#return; {29811#true} is VALID [2022-04-28 03:20:03,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {29811#true} call ULTIMATE.init(); {29822#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:20:03,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {29822#(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); {29811#true} is VALID [2022-04-28 03:20:03,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {29811#true} assume true; {29811#true} is VALID [2022-04-28 03:20:03,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29811#true} {29811#true} #56#return; {29811#true} is VALID [2022-04-28 03:20:03,284 INFO L272 TraceCheckUtils]: 4: Hoare triple {29811#true} call #t~ret1 := main(); {29811#true} is VALID [2022-04-28 03:20:03,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {29811#true} ~x~0 := 0;~y~0 := 50; {29816#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:20:03,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {29816#(and (= main_~x~0 0) (<= 50 main_~y~0) (<= main_~y~0 50))} [258] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2123 v_main_~x~0_2122))) (or .cse0 (and (< v_main_~x~0_2123 v_main_~x~0_2122) (< v_main_~x~0_2122 51)) (and .cse0 (<= 50 v_main_~x~0_2123)))) InVars {main_~x~0=v_main_~x~0_2123} OutVars{main_~x~0=v_main_~x~0_2122} AuxVars[] AssignedVars[main_~x~0] {29817#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:20:03,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {29817#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [259] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29817#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} is VALID [2022-04-28 03:20:03,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {29817#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 50)))} [260] L28-2-->L27-2_primed: Formula: (let ((.cse2 (= v_main_~x~0_2125 v_main_~x~0_2124)) (.cse0 (<= 50 v_main_~x~0_2125)) (.cse3 (= v_main_~y~0_1673 v_main_~y~0_1672))) (or (let ((.cse1 (+ v_main_~x~0_2125 v_main_~y~0_1672))) (and (< v_main_~y~0_1673 v_main_~y~0_1672) .cse0 (< .cse1 (+ 101 v_main_~y~0_1673)) (= .cse1 (+ v_main_~x~0_2124 v_main_~y~0_1673)))) (and .cse2 .cse3) (and .cse2 (or (not (< v_main_~x~0_2125 100)) (not .cse0)) .cse3))) InVars {main_~x~0=v_main_~x~0_2125, main_~y~0=v_main_~y~0_1673} OutVars{main_~x~0=v_main_~x~0_2124, main_~y~0=v_main_~y~0_1672} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {29818#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} is VALID [2022-04-28 03:20:03,287 INFO L290 TraceCheckUtils]: 9: Hoare triple {29818#(or (and (or (<= main_~x~0 main_~y~0) (not (<= main_~y~0 99))) (<= main_~y~0 100)) (<= main_~x~0 50))} [257] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {29819#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:20:03,288 INFO L272 TraceCheckUtils]: 10: Hoare triple {29819#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {29820#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:20:03,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {29820#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {29821#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:20:03,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {29821#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {29812#false} is VALID [2022-04-28 03:20:03,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {29812#false} assume !false; {29812#false} is VALID [2022-04-28 03:20:03,289 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:03,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:20:03,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547095249] [2022-04-28 03:20:03,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547095249] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:20:03,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381901716] [2022-04-28 03:20:03,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:20:03,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:20:03,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:20:03,290 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:20:03,291 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:20:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:20:03,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:20:03,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:20:03,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:20:03,583 INFO L272 TraceCheckUtils]: 0: Hoare triple {29811#true} call ULTIMATE.init(); {29811#true} is VALID [2022-04-28 03:20:03,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {29811#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); {29811#true} is VALID [2022-04-28 03:20:03,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {29811#true} assume true; {29811#true} is VALID [2022-04-28 03:20:03,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29811#true} {29811#true} #56#return; {29811#true} is VALID [2022-04-28 03:20:03,583 INFO L272 TraceCheckUtils]: 4: Hoare triple {29811#true} call #t~ret1 := main(); {29811#true} is VALID [2022-04-28 03:20:03,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {29811#true} ~x~0 := 0;~y~0 := 50; {29841#(and (<= main_~x~0 0) (= main_~y~0 50))} is VALID [2022-04-28 03:20:03,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {29841#(and (<= main_~x~0 0) (= main_~y~0 50))} [258] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2123 v_main_~x~0_2122))) (or .cse0 (and (< v_main_~x~0_2123 v_main_~x~0_2122) (< v_main_~x~0_2122 51)) (and .cse0 (<= 50 v_main_~x~0_2123)))) InVars {main_~x~0=v_main_~x~0_2123} OutVars{main_~x~0=v_main_~x~0_2122} AuxVars[] AssignedVars[main_~x~0] {29845#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:20:03,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {29845#(and (= main_~y~0 50) (< main_~x~0 51))} [259] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29845#(and (= main_~y~0 50) (< main_~x~0 51))} is VALID [2022-04-28 03:20:03,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {29845#(and (= main_~y~0 50) (< main_~x~0 51))} [260] L28-2-->L27-2_primed: Formula: (let ((.cse2 (= v_main_~x~0_2125 v_main_~x~0_2124)) (.cse0 (<= 50 v_main_~x~0_2125)) (.cse3 (= v_main_~y~0_1673 v_main_~y~0_1672))) (or (let ((.cse1 (+ v_main_~x~0_2125 v_main_~y~0_1672))) (and (< v_main_~y~0_1673 v_main_~y~0_1672) .cse0 (< .cse1 (+ 101 v_main_~y~0_1673)) (= .cse1 (+ v_main_~x~0_2124 v_main_~y~0_1673)))) (and .cse2 .cse3) (and .cse2 (or (not (< v_main_~x~0_2125 100)) (not .cse0)) .cse3))) InVars {main_~x~0=v_main_~x~0_2125, main_~y~0=v_main_~y~0_1673} OutVars{main_~x~0=v_main_~x~0_2124, main_~y~0=v_main_~y~0_1672} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {29852#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:20:03,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {29852#(or (and (= main_~y~0 50) (< main_~x~0 51)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 101) (< 50 main_~y~0) (<= main_~y~0 main_~x~0)))} [257] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {29819#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:20:03,586 INFO L272 TraceCheckUtils]: 10: Hoare triple {29819#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {29859#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:20:03,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {29859#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {29863#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:20:03,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {29863#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29812#false} is VALID [2022-04-28 03:20:03,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {29812#false} assume !false; {29812#false} is VALID [2022-04-28 03:20:03,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:20:03,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:20:04,021 INFO L290 TraceCheckUtils]: 13: Hoare triple {29812#false} assume !false; {29812#false} is VALID [2022-04-28 03:20:04,022 INFO L290 TraceCheckUtils]: 12: Hoare triple {29863#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29812#false} is VALID [2022-04-28 03:20:04,022 INFO L290 TraceCheckUtils]: 11: Hoare triple {29859#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {29863#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:20:04,023 INFO L272 TraceCheckUtils]: 10: Hoare triple {29819#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {29859#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:20:04,023 INFO L290 TraceCheckUtils]: 9: Hoare triple {29882#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} [257] L27-2_primed-->L27-2: Formula: (not (< v_main_~x~0_1 100)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {29819#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 03:20:04,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {29886#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (< main_~x~0 (+ main_~y~0 1)) (not (<= 50 main_~x~0)) (<= 99 main_~y~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [260] L28-2-->L27-2_primed: Formula: (let ((.cse2 (= v_main_~x~0_2125 v_main_~x~0_2124)) (.cse0 (<= 50 v_main_~x~0_2125)) (.cse3 (= v_main_~y~0_1673 v_main_~y~0_1672))) (or (let ((.cse1 (+ v_main_~x~0_2125 v_main_~y~0_1672))) (and (< v_main_~y~0_1673 v_main_~y~0_1672) .cse0 (< .cse1 (+ 101 v_main_~y~0_1673)) (= .cse1 (+ v_main_~x~0_2124 v_main_~y~0_1673)))) (and .cse2 .cse3) (and .cse2 (or (not (< v_main_~x~0_2125 100)) (not .cse0)) .cse3))) InVars {main_~x~0=v_main_~x~0_2125, main_~y~0=v_main_~y~0_1673} OutVars{main_~x~0=v_main_~x~0_2124, main_~y~0=v_main_~y~0_1672} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {29882#(or (< main_~x~0 100) (and (< 99 main_~y~0) (<= main_~y~0 100)))} is VALID [2022-04-28 03:20:04,025 INFO L290 TraceCheckUtils]: 7: Hoare triple {29886#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (< main_~x~0 (+ main_~y~0 1)) (not (<= 50 main_~x~0)) (<= 99 main_~y~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [259] L27-2_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29886#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (< main_~x~0 (+ main_~y~0 1)) (not (<= 50 main_~x~0)) (<= 99 main_~y~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:20:04,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {29893#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (<= 50 main_~y~0) (<= main_~y~0 100) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} [258] L28-2-->L27-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2123 v_main_~x~0_2122))) (or .cse0 (and (< v_main_~x~0_2123 v_main_~x~0_2122) (< v_main_~x~0_2122 51)) (and .cse0 (<= 50 v_main_~x~0_2123)))) InVars {main_~x~0=v_main_~x~0_2123} OutVars{main_~x~0=v_main_~x~0_2122} AuxVars[] AssignedVars[main_~x~0] {29886#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (or (< main_~x~0 100) (<= main_~y~0 100)) (or (< main_~x~0 (+ main_~y~0 1)) (not (<= 50 main_~x~0)) (<= 99 main_~y~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:20:04,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {29811#true} ~x~0 := 0;~y~0 := 50; {29893#(and (or (< main_~x~0 100) (< 99 main_~y~0)) (<= 50 main_~y~0) (<= main_~y~0 100) (or (<= 50 main_~x~0) (<= main_~y~0 50)) (or (< main_~x~0 (+ main_~y~0 1)) (<= 99 main_~y~0)) (or (not (<= 50 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:20:04,026 INFO L272 TraceCheckUtils]: 4: Hoare triple {29811#true} call #t~ret1 := main(); {29811#true} is VALID [2022-04-28 03:20:04,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29811#true} {29811#true} #56#return; {29811#true} is VALID [2022-04-28 03:20:04,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {29811#true} assume true; {29811#true} is VALID [2022-04-28 03:20:04,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {29811#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); {29811#true} is VALID [2022-04-28 03:20:04,026 INFO L272 TraceCheckUtils]: 0: Hoare triple {29811#true} call ULTIMATE.init(); {29811#true} is VALID [2022-04-28 03:20:04,027 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:04,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381901716] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:20:04,027 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:20:04,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:20:06,594 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:20:06,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [375299196] [2022-04-28 03:20:06,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [375299196] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:20:06,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:20:06,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2022-04-28 03:20:06,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539677425] [2022-04-28 03:20:06,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:20:06,595 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 1.9473684210526316) internal successors, (111), 56 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:20:06,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:20:06,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 58 states, 57 states have (on average 1.9473684210526316) internal successors, (111), 56 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:20:06,681 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:20:06,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-04-28 03:20:06,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:20:06,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-04-28 03:20:06,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=4252, Unknown=0, NotChecked=0, Total=4692 [2022-04-28 03:20:06,683 INFO L87 Difference]: Start difference. First operand 117 states and 120 transitions. Second operand has 58 states, 57 states have (on average 1.9473684210526316) internal successors, (111), 56 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:20:16,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:20:16,747 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2022-04-28 03:20:16,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-04-28 03:20:16,747 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 1.9473684210526316) internal successors, (111), 56 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:20:16,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:20:16,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.9473684210526316) internal successors, (111), 56 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:20:16,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 118 transitions. [2022-04-28 03:20:16,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.9473684210526316) internal successors, (111), 56 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:20:16,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 118 transitions. [2022-04-28 03:20:16,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 118 transitions. [2022-04-28 03:20:16,884 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:20:16,884 INFO L225 Difference]: With dead ends: 118 [2022-04-28 03:20:16,884 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 03:20:16,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 72 SyntacticMatches, 4 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2709 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=915, Invalid=13605, Unknown=0, NotChecked=0, Total=14520 [2022-04-28 03:20:16,886 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 51 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 5613 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 5667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 5613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:20:16,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 278 Invalid, 5667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 5613 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-04-28 03:20:16,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 03:20:16,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 03:20:16,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:20:16,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 03:20:16,887 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 03:20:16,887 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 03:20:16,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:20:16,887 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 03:20:16,887 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:20:16,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:20:16,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:20:16,887 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 03:20:16,887 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 03:20:16,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:20:16,888 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 03:20:16,888 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:20:16,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:20:16,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:20:16,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:20:16,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:20:16,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 03:20:16,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 03:20:16,888 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 115 [2022-04-28 03:20:16,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:20:16,888 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 03:20:16,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 1.9473684210526316) internal successors, (111), 56 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:20:16,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 03:20:16,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:20:16,889 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:20:16,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:20:16,891 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 03:20:16,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-04-28 03:20:17,103 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,SelfDestructingSolverStorable52 [2022-04-28 03:20:17,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 03:20:18,590 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-28 03:20:18,590 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-28 03:20:18,590 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-28 03:20:18,590 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-28 03:20:18,590 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-28 03:20:18,590 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-28 03:20:18,590 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-28 03:20:18,591 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 37) the Hoare annotation is: true [2022-04-28 03:20:18,591 INFO L895 garLoopResultBuilder]: At program point L28(lines 28 33) the Hoare annotation is: (let ((.cse0 (<= 50 main_~y~0)) (.cse1 (<= main_~y~0 50))) (or (and (<= main_~y~0 69) (<= 69 main_~y~0) (< main_~x~0 70) (<= 69 main_~x~0)) (and (= main_~x~0 0) .cse0 .cse1) (and (< main_~x~0 76) (<= 75 main_~y~0) (<= 75 main_~x~0) (<= main_~y~0 75)) (and (<= 80 main_~x~0) (<= main_~y~0 80) (< main_~x~0 81) (<= 80 main_~y~0)) (and (< main_~x~0 89) (<= main_~y~0 88) (<= 88 main_~y~0) (<= 88 main_~x~0)) (and (< main_~x~0 85) (<= 84 main_~x~0) (<= main_~y~0 84) (<= 84 main_~y~0)) (and (<= 77 main_~y~0) (< main_~x~0 78) (<= main_~y~0 77) (<= 77 main_~x~0)) (and (<= 63 main_~x~0) (<= 63 main_~y~0) (< main_~x~0 64) (<= main_~y~0 63)) (and (<= 66 main_~y~0) (<= main_~y~0 66) (<= 66 main_~x~0) (< main_~x~0 67)) (and (< main_~x~0 97) (<= 96 main_~y~0) (<= 96 main_~x~0) (<= main_~y~0 96)) (and (<= 74 main_~x~0) (<= 74 main_~y~0) (<= main_~y~0 74) (< main_~x~0 75)) (and (< main_~x~0 77) (<= 76 main_~x~0) (<= main_~y~0 76) (<= 76 main_~y~0)) (and (< main_~x~0 94) (<= 93 main_~y~0) (<= main_~y~0 93) (<= 93 main_~x~0)) (and (<= main_~y~0 57) (<= 57 main_~x~0) (<= 57 main_~y~0) (< main_~x~0 58)) (and (<= 78 main_~y~0) (<= 78 main_~x~0) (< main_~x~0 79) (<= main_~y~0 78)) (and (<= 92 main_~y~0) (<= 92 main_~x~0) (<= main_~y~0 92) (< main_~x~0 93)) (and (< main_~x~0 57) (<= main_~y~0 56) (<= 56 main_~x~0) (<= 56 main_~y~0)) (and .cse0 (or (= main_~x~0 1) (< 1 main_~x~0)) (< main_~x~0 51) .cse1) (and (< main_~x~0 61) (<= 60 main_~y~0) (<= main_~y~0 60) (<= 60 main_~x~0)) (and (<= 90 main_~y~0) (<= main_~y~0 90) (<= 90 main_~x~0) (< main_~x~0 91)) (and (<= 70 main_~x~0) (<= 70 main_~y~0) (<= main_~y~0 70) (< main_~x~0 71)) (and (<= main_~y~0 68) (<= 68 main_~y~0) (<= 68 main_~x~0) (< main_~x~0 69)) (and (<= 81 main_~x~0) (<= main_~y~0 81) (< main_~x~0 82) (<= 81 main_~y~0)) (and (<= 65 main_~y~0) (<= main_~y~0 65) (<= 65 main_~x~0) (< main_~x~0 66)) (and (<= 97 main_~y~0) (< main_~x~0 98) (<= 97 main_~x~0) (<= main_~y~0 97)) (and (<= main_~y~0 61) (<= 61 main_~x~0) (<= 61 main_~y~0) (< main_~x~0 62)) (and (<= main_~y~0 85) (<= 85 main_~x~0) (<= 85 main_~y~0) (< main_~x~0 86)) (and (<= 86 main_~y~0) (< main_~x~0 87) (<= 86 main_~x~0) (<= main_~y~0 86)) (and (<= 51 main_~y~0) (<= 51 main_~x~0) (< main_~x~0 52) (<= main_~y~0 51)) (and (<= main_~y~0 53) (<= 53 main_~x~0) (<= 53 main_~y~0) (< main_~x~0 54)) (and (<= main_~y~0 72) (< main_~x~0 73) (<= 72 main_~x~0) (<= 72 main_~y~0)) (and (<= 91 main_~y~0) (<= main_~y~0 91) (<= 91 main_~x~0) (< main_~x~0 92)) (and (<= 62 main_~x~0) (< main_~x~0 63) (<= main_~y~0 62) (<= 62 main_~y~0)) (and (<= main_~y~0 52) (<= 52 main_~x~0) (<= 52 main_~y~0) (< main_~x~0 53)) (and (<= main_~y~0 71) (<= 71 main_~y~0) (< main_~x~0 72) (<= 71 main_~x~0)) (and (< main_~x~0 55) (<= 54 main_~y~0) (<= 54 main_~x~0) (<= main_~y~0 54)) (and (<= 79 main_~x~0) (< main_~x~0 80) (<= main_~y~0 79) (<= 79 main_~y~0)) (and (< main_~x~0 100) (<= 99 main_~x~0) (<= main_~y~0 99) (<= 99 main_~y~0)) (and (<= main_~y~0 73) (<= 73 main_~x~0) (< main_~x~0 74) (<= 73 main_~y~0)) (and (<= 82 main_~x~0) (<= 82 main_~y~0) (<= main_~y~0 82) (< main_~x~0 83)) (and (<= main_~y~0 94) (<= 94 main_~x~0) (<= 94 main_~y~0) (< main_~x~0 95)) (and (< main_~x~0 99) (<= 98 main_~y~0) (<= 98 main_~x~0) (<= main_~y~0 98)) (and (<= 83 main_~x~0) (< main_~x~0 84) (<= 83 main_~y~0) (<= main_~y~0 83)) (and (<= main_~y~0 59) (<= 59 main_~x~0) (<= 59 main_~y~0) (< main_~x~0 60)) (and (< main_~x~0 88) (<= main_~y~0 87) (<= 87 main_~x~0) (<= 87 main_~y~0)) (and (<= main_~y~0 67) (<= 67 main_~x~0) (<= 67 main_~y~0) (< main_~x~0 68)) (and (< main_~x~0 56) (<= 55 main_~y~0) (<= main_~y~0 55) (<= 55 main_~x~0)) (and (<= 95 main_~x~0) (< main_~x~0 96) (<= 95 main_~y~0) (<= main_~y~0 95)) (and (<= 58 main_~x~0) (<= 58 main_~y~0) (<= main_~y~0 58) (< main_~x~0 59)) (and (<= 64 main_~y~0) (<= main_~y~0 64) (< main_~x~0 65) (<= 64 main_~x~0)) (and (<= main_~y~0 89) (<= 89 main_~y~0) (<= 89 main_~x~0) (< main_~x~0 90)))) [2022-04-28 03:20:18,591 INFO L895 garLoopResultBuilder]: At program point L28-2(lines 27 34) the Hoare annotation is: (let ((.cse0 (<= 50 main_~y~0)) (.cse1 (<= main_~y~0 50))) (or (and (<= main_~y~0 69) (<= 69 main_~y~0) (< main_~x~0 70) (<= 69 main_~x~0)) (and (= main_~x~0 0) .cse0 .cse1) (and (< main_~x~0 76) (<= 75 main_~y~0) (<= 75 main_~x~0) (<= main_~y~0 75)) (and (<= 80 main_~x~0) (<= main_~y~0 80) (< main_~x~0 81) (<= 80 main_~y~0)) (and (< main_~x~0 89) (<= main_~y~0 88) (<= 88 main_~y~0) (<= 88 main_~x~0)) (and (< main_~x~0 85) (<= 84 main_~x~0) (<= main_~y~0 84) (<= 84 main_~y~0)) (and (<= 77 main_~y~0) (< main_~x~0 78) (<= main_~y~0 77) (<= 77 main_~x~0)) (and (<= 63 main_~x~0) (<= 63 main_~y~0) (< main_~x~0 64) (<= main_~y~0 63)) (and (<= 66 main_~y~0) (<= main_~y~0 66) (<= 66 main_~x~0) (< main_~x~0 67)) (and (< main_~x~0 97) (<= 96 main_~y~0) (<= 96 main_~x~0) (<= main_~y~0 96)) (and (<= 74 main_~x~0) (<= 74 main_~y~0) (<= main_~y~0 74) (< main_~x~0 75)) (and (< main_~x~0 77) (<= 76 main_~x~0) (<= main_~y~0 76) (<= 76 main_~y~0)) (and (< main_~x~0 94) (<= 93 main_~y~0) (<= main_~y~0 93) (<= 93 main_~x~0)) (and (<= main_~y~0 57) (<= 57 main_~x~0) (<= 57 main_~y~0) (< main_~x~0 58)) (and (<= 78 main_~y~0) (<= 78 main_~x~0) (< main_~x~0 79) (<= main_~y~0 78)) (and (<= 92 main_~y~0) (<= 92 main_~x~0) (<= main_~y~0 92) (< main_~x~0 93)) (and (< main_~x~0 57) (<= main_~y~0 56) (<= 56 main_~x~0) (<= 56 main_~y~0)) (and .cse0 (or (= main_~x~0 1) (< 1 main_~x~0)) (< main_~x~0 51) .cse1) (and (< main_~x~0 61) (<= 60 main_~y~0) (<= main_~y~0 60) (<= 60 main_~x~0)) (and (<= 90 main_~y~0) (<= main_~y~0 90) (<= 90 main_~x~0) (< main_~x~0 91)) (and (<= 70 main_~x~0) (<= 70 main_~y~0) (<= main_~y~0 70) (< main_~x~0 71)) (and (<= main_~y~0 68) (<= 68 main_~y~0) (<= 68 main_~x~0) (< main_~x~0 69)) (and (<= 81 main_~x~0) (<= main_~y~0 81) (< main_~x~0 82) (<= 81 main_~y~0)) (and (<= 65 main_~y~0) (<= main_~y~0 65) (<= 65 main_~x~0) (< main_~x~0 66)) (and (<= 97 main_~y~0) (< main_~x~0 98) (<= 97 main_~x~0) (<= main_~y~0 97)) (and (<= main_~y~0 61) (<= 61 main_~x~0) (<= 61 main_~y~0) (< main_~x~0 62)) (and (<= main_~y~0 85) (<= 85 main_~x~0) (<= 85 main_~y~0) (< main_~x~0 86)) (and (<= 86 main_~y~0) (< main_~x~0 87) (<= 86 main_~x~0) (<= main_~y~0 86)) (and (<= 51 main_~y~0) (<= 51 main_~x~0) (< main_~x~0 52) (<= main_~y~0 51)) (and (<= main_~y~0 53) (<= 53 main_~x~0) (<= 53 main_~y~0) (< main_~x~0 54)) (and (<= main_~y~0 72) (< main_~x~0 73) (<= 72 main_~x~0) (<= 72 main_~y~0)) (and (<= 91 main_~y~0) (<= main_~y~0 91) (<= 91 main_~x~0) (< main_~x~0 92)) (and (<= 62 main_~x~0) (< main_~x~0 63) (<= main_~y~0 62) (<= 62 main_~y~0)) (and (<= main_~y~0 52) (<= 52 main_~x~0) (<= 52 main_~y~0) (< main_~x~0 53)) (and (<= main_~y~0 71) (<= 71 main_~y~0) (< main_~x~0 72) (<= 71 main_~x~0)) (and (<= 100 main_~x~0) (<= 100 main_~y~0) (< main_~x~0 101) (<= main_~y~0 100)) (and (< main_~x~0 55) (<= 54 main_~y~0) (<= 54 main_~x~0) (<= main_~y~0 54)) (and (<= 79 main_~x~0) (< main_~x~0 80) (<= main_~y~0 79) (<= 79 main_~y~0)) (and (< main_~x~0 100) (<= 99 main_~x~0) (<= main_~y~0 99) (<= 99 main_~y~0)) (and (<= main_~y~0 73) (<= 73 main_~x~0) (< main_~x~0 74) (<= 73 main_~y~0)) (and (<= 82 main_~x~0) (<= 82 main_~y~0) (<= main_~y~0 82) (< main_~x~0 83)) (and (<= main_~y~0 94) (<= 94 main_~x~0) (<= 94 main_~y~0) (< main_~x~0 95)) (and (< main_~x~0 99) (<= 98 main_~y~0) (<= 98 main_~x~0) (<= main_~y~0 98)) (and (<= 83 main_~x~0) (< main_~x~0 84) (<= 83 main_~y~0) (<= main_~y~0 83)) (and (<= main_~y~0 59) (<= 59 main_~x~0) (<= 59 main_~y~0) (< main_~x~0 60)) (and (< main_~x~0 88) (<= main_~y~0 87) (<= 87 main_~x~0) (<= 87 main_~y~0)) (and (<= main_~y~0 67) (<= 67 main_~x~0) (<= 67 main_~y~0) (< main_~x~0 68)) (and (< main_~x~0 56) (<= 55 main_~y~0) (<= main_~y~0 55) (<= 55 main_~x~0)) (and (<= 95 main_~x~0) (< main_~x~0 96) (<= 95 main_~y~0) (<= main_~y~0 95)) (and (<= 58 main_~x~0) (<= 58 main_~y~0) (<= main_~y~0 58) (< main_~x~0 59)) (and (<= 64 main_~y~0) (<= main_~y~0 64) (< main_~x~0 65) (<= 64 main_~x~0)) (and (<= main_~y~0 89) (<= 89 main_~y~0) (<= 89 main_~x~0) (< main_~x~0 90)))) [2022-04-28 03:20:18,591 INFO L895 garLoopResultBuilder]: At program point L27-2(lines 27 34) the Hoare annotation is: (and (< 99 main_~y~0) (<= main_~y~0 100)) [2022-04-28 03:20:18,591 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 24 37) the Hoare annotation is: true [2022-04-28 03:20:18,591 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 24 37) the Hoare annotation is: true [2022-04-28 03:20:18,591 INFO L902 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: true [2022-04-28 03:20:18,592 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 03:20:18,592 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 03:20:18,592 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 03:20:18,592 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 03:20:18,592 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 03:20:18,592 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 03:20:18,592 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 03:20:18,592 INFO L902 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: true [2022-04-28 03:20:18,592 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-28 03:20:18,592 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: true [2022-04-28 03:20:18,592 INFO L895 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 03:20:18,592 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 03:20:18,592 INFO L895 garLoopResultBuilder]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 03:20:18,594 INFO L356 BasicCegarLoop]: Path program histogram: [50, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:20:18,600 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 03:20:18,606 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 03:20:18,606 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 03:20:18,607 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 03:20:18,610 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-28 03:20:18,610 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 03:20:18,610 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 03:20:18,756 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-28 03:20:18,876 INFO L163 areAnnotationChecker]: CFG has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 03:20:18,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 03:20:18 BoogieIcfgContainer [2022-04-28 03:20:18,905 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 03:20:18,906 INFO L158 Benchmark]: Toolchain (without parser) took 473397.73ms. Allocated memory was 188.7MB in the beginning and 247.5MB in the end (delta: 58.7MB). Free memory was 140.3MB in the beginning and 144.5MB in the end (delta: -4.2MB). Peak memory consumption was 122.1MB. Max. memory is 8.0GB. [2022-04-28 03:20:18,906 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 188.7MB. Free memory is still 156.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 03:20:18,907 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.87ms. Allocated memory is still 188.7MB. Free memory was 140.1MB in the beginning and 167.8MB in the end (delta: -27.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 03:20:18,907 INFO L158 Benchmark]: Boogie Preprocessor took 44.31ms. Allocated memory is still 188.7MB. Free memory was 167.8MB in the beginning and 166.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 03:20:18,907 INFO L158 Benchmark]: RCFGBuilder took 317.22ms. Allocated memory is still 188.7MB. Free memory was 166.0MB in the beginning and 156.3MB in the end (delta: 9.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-28 03:20:18,907 INFO L158 Benchmark]: TraceAbstraction took 472835.83ms. Allocated memory was 188.7MB in the beginning and 247.5MB in the end (delta: 58.7MB). Free memory was 155.6MB in the beginning and 144.5MB in the end (delta: 11.1MB). Peak memory consumption was 137.1MB. Max. memory is 8.0GB. [2022-04-28 03:20:18,910 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 188.7MB. Free memory is still 156.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 194.87ms. Allocated memory is still 188.7MB. Free memory was 140.1MB in the beginning and 167.8MB in the end (delta: -27.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.31ms. Allocated memory is still 188.7MB. Free memory was 167.8MB in the beginning and 166.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 317.22ms. Allocated memory is still 188.7MB. Free memory was 166.0MB in the beginning and 156.3MB in the end (delta: 9.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 472835.83ms. Allocated memory was 188.7MB in the beginning and 247.5MB in the end (delta: 58.7MB). Free memory was 155.6MB in the beginning and 144.5MB in the end (delta: 11.1MB). Peak memory consumption was 137.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 472.5s, OverallIterations: 53, TraceHistogramMax: 52, PathProgramHistogramMax: 50, EmptinessCheckTime: 0.0s, AutomataDifference: 212.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1807 SdHoareTripleChecker+Valid, 90.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1806 mSDsluCounter, 8221 SdHoareTripleChecker+Invalid, 89.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7632 mSDsCounter, 1636 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 113649 IncrementalHoareTripleChecker+Invalid, 115285 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1636 mSolverCounterUnsat, 589 mSDtfsCounter, 113649 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6005 GetRequests, 2290 SyntacticMatches, 204 SemanticMatches, 3511 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60767 ImplicationChecksByTransitivity, 82.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=52, InterpolantAutomatonStates: 1540, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.3s AutomataMinimizationTime, 53 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 338 PreInvPairs, 553 NumberOfFragments, 1384 HoareAnnotationTreeSize, 338 FomulaSimplifications, 29 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 20 FomulaSimplificationsInter, 5 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((y <= 69 && 69 <= y) && x < 70) && 69 <= x) || ((x == 0 && 50 <= y) && y <= 50)) || (((x < 76 && 75 <= y) && 75 <= x) && y <= 75)) || (((80 <= x && y <= 80) && x < 81) && 80 <= y)) || (((x < 89 && y <= 88) && 88 <= y) && 88 <= x)) || (((x < 85 && 84 <= x) && y <= 84) && 84 <= y)) || (((77 <= y && x < 78) && y <= 77) && 77 <= x)) || (((63 <= x && 63 <= y) && x < 64) && y <= 63)) || (((66 <= y && y <= 66) && 66 <= x) && x < 67)) || (((x < 97 && 96 <= y) && 96 <= x) && y <= 96)) || (((74 <= x && 74 <= y) && y <= 74) && x < 75)) || (((x < 77 && 76 <= x) && y <= 76) && 76 <= y)) || (((x < 94 && 93 <= y) && y <= 93) && 93 <= x)) || (((y <= 57 && 57 <= x) && 57 <= y) && x < 58)) || (((78 <= y && 78 <= x) && x < 79) && y <= 78)) || (((92 <= y && 92 <= x) && y <= 92) && x < 93)) || (((x < 57 && y <= 56) && 56 <= x) && 56 <= y)) || (((50 <= y && (x == 1 || 1 < x)) && x < 51) && y <= 50)) || (((x < 61 && 60 <= y) && y <= 60) && 60 <= x)) || (((90 <= y && y <= 90) && 90 <= x) && x < 91)) || (((70 <= x && 70 <= y) && y <= 70) && x < 71)) || (((y <= 68 && 68 <= y) && 68 <= x) && x < 69)) || (((81 <= x && y <= 81) && x < 82) && 81 <= y)) || (((65 <= y && y <= 65) && 65 <= x) && x < 66)) || (((97 <= y && x < 98) && 97 <= x) && y <= 97)) || (((y <= 61 && 61 <= x) && 61 <= y) && x < 62)) || (((y <= 85 && 85 <= x) && 85 <= y) && x < 86)) || (((86 <= y && x < 87) && 86 <= x) && y <= 86)) || (((51 <= y && 51 <= x) && x < 52) && y <= 51)) || (((y <= 53 && 53 <= x) && 53 <= y) && x < 54)) || (((y <= 72 && x < 73) && 72 <= x) && 72 <= y)) || (((91 <= y && y <= 91) && 91 <= x) && x < 92)) || (((62 <= x && x < 63) && y <= 62) && 62 <= y)) || (((y <= 52 && 52 <= x) && 52 <= y) && x < 53)) || (((y <= 71 && 71 <= y) && x < 72) && 71 <= x)) || (((100 <= x && 100 <= y) && x < 101) && y <= 100)) || (((x < 55 && 54 <= y) && 54 <= x) && y <= 54)) || (((79 <= x && x < 80) && y <= 79) && 79 <= y)) || (((x < 100 && 99 <= x) && y <= 99) && 99 <= y)) || (((y <= 73 && 73 <= x) && x < 74) && 73 <= y)) || (((82 <= x && 82 <= y) && y <= 82) && x < 83)) || (((y <= 94 && 94 <= x) && 94 <= y) && x < 95)) || (((x < 99 && 98 <= y) && 98 <= x) && y <= 98)) || (((83 <= x && x < 84) && 83 <= y) && y <= 83)) || (((y <= 59 && 59 <= x) && 59 <= y) && x < 60)) || (((x < 88 && y <= 87) && 87 <= x) && 87 <= y)) || (((y <= 67 && 67 <= x) && 67 <= y) && x < 68)) || (((x < 56 && 55 <= y) && y <= 55) && 55 <= x)) || (((95 <= x && x < 96) && 95 <= y) && y <= 95)) || (((58 <= x && 58 <= y) && y <= 58) && x < 59)) || (((64 <= y && y <= 64) && x < 65) && 64 <= x)) || (((y <= 89 && 89 <= y) && 89 <= x) && x < 90) - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-28 03:20:18,953 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...