/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/loops-crafted-1/mono-crafted_9.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:53:45,265 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:53:45,267 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:53:45,294 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:53:45,295 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:53:45,307 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:53:45,308 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:53:45,309 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:53:45,310 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:53:45,311 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:53:45,311 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:53:45,312 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:53:45,312 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:53:45,313 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:53:45,313 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:53:45,314 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:53:45,314 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:53:45,315 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:53:45,316 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:53:45,317 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:53:45,318 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:53:45,324 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:53:45,324 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:53:45,325 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:53:45,325 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:53:45,327 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:53:45,327 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:53:45,328 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:53:45,328 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:53:45,328 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:53:45,329 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:53:45,329 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:53:45,329 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:53:45,330 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:53:45,330 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:53:45,331 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:53:45,331 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:53:45,331 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:53:45,331 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:53:45,332 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:53:45,332 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:53:45,333 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:53:45,334 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:53:45,340 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:53:45,340 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:53:45,341 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:53:45,341 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:53:45,341 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:53:45,341 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:53:45,341 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:53:45,341 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:53:45,341 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:53:45,341 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:53:45,342 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:53:45,342 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:53:45,342 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:53:45,342 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:53:45,342 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:53:45,342 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:53:45,342 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:53:45,342 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:53:45,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:53:45,343 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:53:45,343 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:53:45,343 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:53:45,343 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:53:45,343 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:53:45,343 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:53:45,343 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:53:45,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:53:45,509 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:53:45,511 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:53:45,512 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:53:45,513 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:53:45,514 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_9.c [2022-04-28 03:53:45,562 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a76f6d3ad/de1b2851e219451c82cc48e70e9d559c/FLAG23ac08ac6 [2022-04-28 03:53:45,911 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:53:45,911 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_9.c [2022-04-28 03:53:45,917 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a76f6d3ad/de1b2851e219451c82cc48e70e9d559c/FLAG23ac08ac6 [2022-04-28 03:53:45,927 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a76f6d3ad/de1b2851e219451c82cc48e70e9d559c [2022-04-28 03:53:45,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:53:45,931 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:53:45,932 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:53:45,932 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:53:45,935 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:53:45,938 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:53:45" (1/1) ... [2022-04-28 03:53:45,939 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ff97033 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:53:45, skipping insertion in model container [2022-04-28 03:53:45,939 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:53:45" (1/1) ... [2022-04-28 03:53:45,943 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:53:45,951 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:53:46,091 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_9.c[318,331] [2022-04-28 03:53:46,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:53:46,118 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:53:46,126 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_9.c[318,331] [2022-04-28 03:53:46,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:53:46,141 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:53:46,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:53:46 WrapperNode [2022-04-28 03:53:46,142 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:53:46,142 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:53:46,142 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:53:46,143 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:53:46,149 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:53:46" (1/1) ... [2022-04-28 03:53:46,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:53:46" (1/1) ... [2022-04-28 03:53:46,155 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:53:46" (1/1) ... [2022-04-28 03:53:46,155 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:53:46" (1/1) ... [2022-04-28 03:53:46,161 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:53:46" (1/1) ... [2022-04-28 03:53:46,165 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:53:46" (1/1) ... [2022-04-28 03:53:46,168 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:53:46" (1/1) ... [2022-04-28 03:53:46,169 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:53:46,170 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:53:46,170 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:53:46,170 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:53:46,171 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:53:46" (1/1) ... [2022-04-28 03:53:46,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:53:46,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:53:46,193 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:53:46,212 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:53:46,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:53:46,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:53:46,223 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:53:46,224 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:53:46,224 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:53:46,224 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:53:46,224 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:53:46,224 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:53:46,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:53:46,225 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:53:46,225 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:53:46,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:53:46,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:53:46,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:53:46,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:53:46,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:53:46,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:53:46,271 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:53:46,273 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:53:46,372 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:53:46,376 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:53:46,376 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 03:53:46,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:53:46 BoogieIcfgContainer [2022-04-28 03:53:46,377 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:53:46,378 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:53:46,378 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:53:46,397 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:53:46,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:53:45" (1/3) ... [2022-04-28 03:53:46,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@793afb56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:53:46, skipping insertion in model container [2022-04-28 03:53:46,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:53:46" (2/3) ... [2022-04-28 03:53:46,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@793afb56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:53:46, skipping insertion in model container [2022-04-28 03:53:46,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:53:46" (3/3) ... [2022-04-28 03:53:46,399 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_9.c [2022-04-28 03:53:46,416 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:53:46,416 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:53:46,462 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:53:46,466 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@250b3c8c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@42e939fa [2022-04-28 03:53:46,466 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:53:46,471 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:53:46,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 03:53:46,475 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:53:46,475 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:53:46,475 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:53:46,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:53:46,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1325153485, now seen corresponding path program 1 times [2022-04-28 03:53:46,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:53:46,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [350698195] [2022-04-28 03:53:46,492 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:53:46,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1325153485, now seen corresponding path program 2 times [2022-04-28 03:53:46,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:53:46,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331303348] [2022-04-28 03:53:46,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:53:46,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:53:46,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:46,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:53:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:46,650 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(17, 2);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-04-28 03:53:46,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 03:53:46,651 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #41#return; {23#true} is VALID [2022-04-28 03:53:46,654 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:53:46,654 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(17, 2);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-04-28 03:53:46,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 03:53:46,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #41#return; {23#true} is VALID [2022-04-28 03:53:46,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret4 := main(); {23#true} is VALID [2022-04-28 03:53:46,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} ~x~0 := 0;~y~0 := 500000; {23#true} is VALID [2022-04-28 03:53:46,655 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !true; {24#false} is VALID [2022-04-28 03:53:46,655 INFO L272 TraceCheckUtils]: 7: Hoare triple {24#false} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {24#false} is VALID [2022-04-28 03:53:46,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-28 03:53:46,656 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-28 03:53:46,656 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-28 03:53:46,656 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:53:46,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:53:46,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331303348] [2022-04-28 03:53:46,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331303348] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:53:46,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:53:46,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:53:46,661 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:53:46,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [350698195] [2022-04-28 03:53:46,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [350698195] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:53:46,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:53:46,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:53:46,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991834657] [2022-04-28 03:53:46,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:53:46,665 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:53:46,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:53:46,669 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:53:46,689 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:53:46,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 03:53:46,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:53:46,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 03:53:46,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 03:53:46,708 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:53:46,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:46,778 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-28 03:53:46,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 03:53:46,779 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:53:46,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:53:46,780 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:53:46,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-28 03:53:46,787 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:53:46,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-28 03:53:46,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2022-04-28 03:53:46,843 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:53:46,848 INFO L225 Difference]: With dead ends: 32 [2022-04-28 03:53:46,848 INFO L226 Difference]: Without dead ends: 13 [2022-04-28 03:53:46,850 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:53:46,852 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:53:46,852 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:53:46,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-28 03:53:46,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-28 03:53:46,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:53:46,892 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:53:46,892 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:53:46,893 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:53:46,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:46,898 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-28 03:53:46,898 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-28 03:53:46,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:53:46,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:53:46,898 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:53:46,898 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:53:46,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:46,901 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-28 03:53:46,901 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-28 03:53:46,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:53:46,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:53:46,902 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:53:46,902 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:53:46,902 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:53:46,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-04-28 03:53:46,904 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-04-28 03:53:46,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:53:46,906 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-04-28 03:53:46,906 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:53:46,906 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 14 transitions. [2022-04-28 03:53:46,922 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:53:46,922 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-28 03:53:46,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 03:53:46,923 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:53:46,923 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:53:46,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:53:46,923 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:53:46,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:53:46,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1315918275, now seen corresponding path program 1 times [2022-04-28 03:53:46,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:53:46,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [917785187] [2022-04-28 03:53:46,924 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:53:46,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1315918275, now seen corresponding path program 2 times [2022-04-28 03:53:46,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:53:46,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009879724] [2022-04-28 03:53:46,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:53:46,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:53:46,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:46,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:53:46,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:46,978 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(17, 2);call #Ultimate.allocInit(12, 3); {147#true} is VALID [2022-04-28 03:53:46,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {147#true} assume true; {147#true} is VALID [2022-04-28 03:53:46,978 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {147#true} {147#true} #41#return; {147#true} is VALID [2022-04-28 03:53:46,979 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:53:46,979 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(17, 2);call #Ultimate.allocInit(12, 3); {147#true} is VALID [2022-04-28 03:53:46,979 INFO L290 TraceCheckUtils]: 2: Hoare triple {147#true} assume true; {147#true} is VALID [2022-04-28 03:53:46,979 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {147#true} {147#true} #41#return; {147#true} is VALID [2022-04-28 03:53:46,980 INFO L272 TraceCheckUtils]: 4: Hoare triple {147#true} call #t~ret4 := main(); {147#true} is VALID [2022-04-28 03:53:46,980 INFO L290 TraceCheckUtils]: 5: Hoare triple {147#true} ~x~0 := 0;~y~0 := 500000; {152#(= main_~x~0 0)} is VALID [2022-04-28 03:53:46,981 INFO L290 TraceCheckUtils]: 6: Hoare triple {152#(= main_~x~0 0)} assume !(~x~0 < 1000000); {148#false} is VALID [2022-04-28 03:53:46,981 INFO L272 TraceCheckUtils]: 7: Hoare triple {148#false} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {148#false} is VALID [2022-04-28 03:53:46,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {148#false} ~cond := #in~cond; {148#false} is VALID [2022-04-28 03:53:46,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {148#false} assume 0 == ~cond; {148#false} is VALID [2022-04-28 03:53:46,981 INFO L290 TraceCheckUtils]: 10: Hoare triple {148#false} assume !false; {148#false} is VALID [2022-04-28 03:53:46,981 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:53:46,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:53:46,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009879724] [2022-04-28 03:53:46,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009879724] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:53:46,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:53:46,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:53:46,982 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:53:46,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [917785187] [2022-04-28 03:53:46,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [917785187] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:53:46,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:53:46,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:53:46,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774300200] [2022-04-28 03:53:46,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:53:46,984 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:53:46,984 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:53:46,984 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:53:46,992 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:53:46,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 03:53:46,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:53:46,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 03:53:46,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 03:53:46,994 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:53:47,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:47,034 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-28 03:53:47,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 03:53:47,035 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:53:47,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:53:47,035 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:53:47,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-28 03:53:47,036 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:53:47,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-28 03:53:47,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2022-04-28 03:53:47,058 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:53:47,059 INFO L225 Difference]: With dead ends: 22 [2022-04-28 03:53:47,059 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 03:53:47,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 03:53:47,060 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:53:47,061 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:53:47,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 03:53:47,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 03:53:47,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:53:47,064 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:53:47,064 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:53:47,064 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:53:47,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:47,065 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-28 03:53:47,065 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 03:53:47,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:53:47,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:53:47,065 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:53:47,066 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:53:47,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:47,079 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-28 03:53:47,079 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 03:53:47,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:53:47,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:53:47,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:53:47,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:53:47,080 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:53:47,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-28 03:53:47,081 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-04-28 03:53:47,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:53:47,081 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-28 03:53:47,081 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:53:47,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-28 03:53:47,107 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:53:47,107 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 03:53:47,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 03:53:47,107 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:53:47,107 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:53:47,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:53:47,108 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:53:47,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:53:47,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1372110560, now seen corresponding path program 1 times [2022-04-28 03:53:47,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:53:47,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [112231844] [2022-04-28 03:53:51,249 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:53:51,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:53:51,354 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:53:51,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1209153456, now seen corresponding path program 1 times [2022-04-28 03:53:51,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:53:51,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665150343] [2022-04-28 03:53:51,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:53:51,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:53:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:51,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:53:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:51,452 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(17, 2);call #Ultimate.allocInit(12, 3); {262#true} is VALID [2022-04-28 03:53:51,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-28 03:53:51,453 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {262#true} {262#true} #41#return; {262#true} is VALID [2022-04-28 03:53:51,453 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:53:51,453 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(17, 2);call #Ultimate.allocInit(12, 3); {262#true} is VALID [2022-04-28 03:53:51,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-28 03:53:51,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {262#true} {262#true} #41#return; {262#true} is VALID [2022-04-28 03:53:51,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {262#true} call #t~ret4 := main(); {262#true} is VALID [2022-04-28 03:53:51,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {262#true} ~x~0 := 0;~y~0 := 500000; {267#(= main_~x~0 0)} is VALID [2022-04-28 03:53:51,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {267#(= main_~x~0 0)} [47] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_11 v_main_~x~0_10))) (or .cse0 (and (< v_main_~x~0_10 500001) (< v_main_~x~0_11 v_main_~x~0_10)) (and .cse0 (<= 500000 v_main_~x~0_11)))) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_10} AuxVars[] AssignedVars[main_~x~0] {268#(<= main_~x~0 500000)} is VALID [2022-04-28 03:53:51,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {268#(<= main_~x~0 500000)} [46] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {263#false} is VALID [2022-04-28 03:53:51,457 INFO L272 TraceCheckUtils]: 8: Hoare triple {263#false} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {263#false} is VALID [2022-04-28 03:53:51,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {263#false} ~cond := #in~cond; {263#false} is VALID [2022-04-28 03:53:51,457 INFO L290 TraceCheckUtils]: 10: Hoare triple {263#false} assume 0 == ~cond; {263#false} is VALID [2022-04-28 03:53:51,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-04-28 03:53:51,457 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:53:51,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:53:51,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665150343] [2022-04-28 03:53:51,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665150343] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:53:51,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:53:51,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:53:51,521 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:53:51,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [112231844] [2022-04-28 03:53:51,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [112231844] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:53:51,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:53:51,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:53:51,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290174558] [2022-04-28 03:53:51,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:53:51,522 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:53:51,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:53:51,523 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:53:51,550 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:53:51,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 03:53:51,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:53:51,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 03:53:51,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:53:51,551 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:53:51,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:51,644 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-28 03:53:51,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 03:53:51,644 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:53:51,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:53:51,644 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:53:51,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-28 03:53:51,645 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:53:51,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-28 03:53:51,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 24 transitions. [2022-04-28 03:53:51,686 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:53:51,688 INFO L225 Difference]: With dead ends: 22 [2022-04-28 03:53:51,689 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 03:53:51,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 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:53:51,693 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:53:51,696 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:53:51,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 03:53:51,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 03:53:51,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:53:51,709 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:53:51,710 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:53:51,710 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:53:51,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:51,711 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 03:53:51,711 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 03:53:51,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:53:51,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:53:51,711 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:53:51,711 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:53:51,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:51,712 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 03:53:51,712 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 03:53:51,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:53:51,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:53:51,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:53:51,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:53:51,713 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:53:51,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-28 03:53:51,714 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2022-04-28 03:53:51,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:53:51,714 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-28 03:53:51,714 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:53:51,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-28 03:53:51,739 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:53:51,739 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 03:53:51,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 03:53:51,740 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:53:51,740 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:53:51,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 03:53:51,743 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:53:51,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:53:51,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1059749499, now seen corresponding path program 1 times [2022-04-28 03:53:51,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:53:51,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2035657331] [2022-04-28 03:53:51,903 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:53:52,200 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:53:52,202 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:53:52,204 INFO L85 PathProgramCache]: Analyzing trace with hash 603671471, now seen corresponding path program 1 times [2022-04-28 03:53:52,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:53:52,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713535124] [2022-04-28 03:53:52,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:53:52,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:53:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:52,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:53:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:52,327 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(17, 2);call #Ultimate.allocInit(12, 3); {390#true} is VALID [2022-04-28 03:53:52,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {390#true} assume true; {390#true} is VALID [2022-04-28 03:53:52,328 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {390#true} {390#true} #41#return; {390#true} is VALID [2022-04-28 03:53:52,328 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:53:52,328 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(17, 2);call #Ultimate.allocInit(12, 3); {390#true} is VALID [2022-04-28 03:53:52,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {390#true} assume true; {390#true} is VALID [2022-04-28 03:53:52,331 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {390#true} {390#true} #41#return; {390#true} is VALID [2022-04-28 03:53:52,331 INFO L272 TraceCheckUtils]: 4: Hoare triple {390#true} call #t~ret4 := main(); {390#true} is VALID [2022-04-28 03:53:52,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {390#true} ~x~0 := 0;~y~0 := 500000; {395#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:53:52,333 INFO L290 TraceCheckUtils]: 6: Hoare triple {395#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [49] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_18 v_main_~x~0_17))) (or (and .cse0 (<= 500000 v_main_~x~0_18)) .cse0 (and (< v_main_~x~0_17 500001) (< v_main_~x~0_18 v_main_~x~0_17)))) InVars {main_~x~0=v_main_~x~0_18} OutVars{main_~x~0=v_main_~x~0_17} AuxVars[] AssignedVars[main_~x~0] {396#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:53:52,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {396#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [50] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {396#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:53:52,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {396#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [51] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_20)) (.cse1 (= v_main_~y~0_7 v_main_~y~0_6)) (.cse2 (= v_main_~x~0_20 v_main_~x~0_19))) (or (and (or (not .cse0) (not (< v_main_~x~0_20 1000000))) .cse1 .cse2) (and (< v_main_~x~0_20 v_main_~x~0_19) (= (+ v_main_~x~0_20 v_main_~y~0_6) (+ v_main_~x~0_19 v_main_~y~0_7)) (< v_main_~x~0_19 1000001) .cse0) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_20, main_~y~0=v_main_~y~0_7} OutVars{main_~x~0=v_main_~x~0_19, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {397#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:53:52,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {397#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [48] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {398#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:53:52,337 INFO L272 TraceCheckUtils]: 10: Hoare triple {398#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {399#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:53:52,338 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:53:52,338 INFO L290 TraceCheckUtils]: 12: Hoare triple {400#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {391#false} is VALID [2022-04-28 03:53:52,338 INFO L290 TraceCheckUtils]: 13: Hoare triple {391#false} assume !false; {391#false} is VALID [2022-04-28 03:53:52,339 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:53:52,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:53:52,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713535124] [2022-04-28 03:53:52,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713535124] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:53:52,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961672461] [2022-04-28 03:53:52,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:53:52,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:53:52,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:53:52,342 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:53:52,364 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:53:52,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:52,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:53:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:52,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:53:52,851 INFO L272 TraceCheckUtils]: 0: Hoare triple {390#true} call ULTIMATE.init(); {390#true} is VALID [2022-04-28 03:53:52,851 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(17, 2);call #Ultimate.allocInit(12, 3); {390#true} is VALID [2022-04-28 03:53:52,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {390#true} assume true; {390#true} is VALID [2022-04-28 03:53:52,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {390#true} {390#true} #41#return; {390#true} is VALID [2022-04-28 03:53:52,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {390#true} call #t~ret4 := main(); {390#true} is VALID [2022-04-28 03:53:52,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {390#true} ~x~0 := 0;~y~0 := 500000; {420#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:53:52,856 INFO L290 TraceCheckUtils]: 6: Hoare triple {420#(and (<= main_~x~0 0) (= main_~y~0 500000))} [49] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_18 v_main_~x~0_17))) (or (and .cse0 (<= 500000 v_main_~x~0_18)) .cse0 (and (< v_main_~x~0_17 500001) (< v_main_~x~0_18 v_main_~x~0_17)))) InVars {main_~x~0=v_main_~x~0_18} OutVars{main_~x~0=v_main_~x~0_17} AuxVars[] AssignedVars[main_~x~0] {424#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:53:52,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {424#(and (= main_~y~0 500000) (< main_~x~0 500001))} [50] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {424#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:53:52,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {424#(and (= main_~y~0 500000) (< main_~x~0 500001))} [51] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_20)) (.cse1 (= v_main_~y~0_7 v_main_~y~0_6)) (.cse2 (= v_main_~x~0_20 v_main_~x~0_19))) (or (and (or (not .cse0) (not (< v_main_~x~0_20 1000000))) .cse1 .cse2) (and (< v_main_~x~0_20 v_main_~x~0_19) (= (+ v_main_~x~0_20 v_main_~y~0_6) (+ v_main_~x~0_19 v_main_~y~0_7)) (< v_main_~x~0_19 1000001) .cse0) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_20, main_~y~0=v_main_~y~0_7} OutVars{main_~x~0=v_main_~x~0_19, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {431#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:53:52,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {431#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [48] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {435#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:53:52,861 INFO L272 TraceCheckUtils]: 10: Hoare triple {435#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {439#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:53:52,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {439#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {443#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:53:52,862 INFO L290 TraceCheckUtils]: 12: Hoare triple {443#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {391#false} is VALID [2022-04-28 03:53:52,862 INFO L290 TraceCheckUtils]: 13: Hoare triple {391#false} assume !false; {391#false} is VALID [2022-04-28 03:53:52,862 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:53:52,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:53:53,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {391#false} assume !false; {391#false} is VALID [2022-04-28 03:53:53,252 INFO L290 TraceCheckUtils]: 12: Hoare triple {443#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {391#false} is VALID [2022-04-28 03:53:53,252 INFO L290 TraceCheckUtils]: 11: Hoare triple {439#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {443#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:53:53,253 INFO L272 TraceCheckUtils]: 10: Hoare triple {398#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {439#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:53:53,253 INFO L290 TraceCheckUtils]: 9: Hoare triple {462#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [48] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {398#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:53:53,255 INFO L290 TraceCheckUtils]: 8: Hoare triple {466#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [51] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_20)) (.cse1 (= v_main_~y~0_7 v_main_~y~0_6)) (.cse2 (= v_main_~x~0_20 v_main_~x~0_19))) (or (and (or (not .cse0) (not (< v_main_~x~0_20 1000000))) .cse1 .cse2) (and (< v_main_~x~0_20 v_main_~x~0_19) (= (+ v_main_~x~0_20 v_main_~y~0_6) (+ v_main_~x~0_19 v_main_~y~0_7)) (< v_main_~x~0_19 1000001) .cse0) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_20, main_~y~0=v_main_~y~0_7} OutVars{main_~x~0=v_main_~x~0_19, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {462#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:53:53,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {466#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [50] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {466#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:53:53,256 INFO L290 TraceCheckUtils]: 6: Hoare triple {473#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [49] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_18 v_main_~x~0_17))) (or (and .cse0 (<= 500000 v_main_~x~0_18)) .cse0 (and (< v_main_~x~0_17 500001) (< v_main_~x~0_18 v_main_~x~0_17)))) InVars {main_~x~0=v_main_~x~0_18} OutVars{main_~x~0=v_main_~x~0_17} AuxVars[] AssignedVars[main_~x~0] {466#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:53:53,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {390#true} ~x~0 := 0;~y~0 := 500000; {473#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:53:53,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {390#true} call #t~ret4 := main(); {390#true} is VALID [2022-04-28 03:53:53,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {390#true} {390#true} #41#return; {390#true} is VALID [2022-04-28 03:53:53,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {390#true} assume true; {390#true} is VALID [2022-04-28 03:53:53,257 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(17, 2);call #Ultimate.allocInit(12, 3); {390#true} is VALID [2022-04-28 03:53:53,257 INFO L272 TraceCheckUtils]: 0: Hoare triple {390#true} call ULTIMATE.init(); {390#true} is VALID [2022-04-28 03:53:53,258 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:53:53,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961672461] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:53:53,258 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:53:53,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 03:53:53,389 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:53:53,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2035657331] [2022-04-28 03:53:53,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2035657331] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:53:53,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:53:53,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:53:53,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907598113] [2022-04-28 03:53:53,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:53:53,390 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:53:53,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:53:53,391 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:53:53,402 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:53:53,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 03:53:53,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:53:53,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 03:53:53,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2022-04-28 03:53:53,403 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:53:53,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:53,676 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-04-28 03:53:53,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:53:53,676 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:53:53,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:53:53,677 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:53:53,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2022-04-28 03:53:53,678 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:53:53,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2022-04-28 03:53:53,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 38 transitions. [2022-04-28 03:53:53,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:53:53,710 INFO L225 Difference]: With dead ends: 31 [2022-04-28 03:53:53,710 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 03:53:53,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702 [2022-04-28 03:53:53,711 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 18 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:53:53,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 36 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:53:53,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 03:53:53,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-28 03:53:53,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:53:53,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:53,727 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:53,727 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:53,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:53,728 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-28 03:53:53,728 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-28 03:53:53,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:53:53,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:53:53,729 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 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:53:53,729 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 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:53:53,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:53,730 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-28 03:53:53,730 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-28 03:53:53,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:53:53,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:53:53,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:53:53,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:53:53,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:53,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-04-28 03:53:53,731 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 15 [2022-04-28 03:53:53,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:53:53,731 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-04-28 03:53:53,731 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:53:53,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 24 transitions. [2022-04-28 03:53:53,751 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:53:53,751 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-28 03:53:53,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 03:53:53,751 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:53:53,752 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:53:53,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 03:53:53,968 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:53:53,968 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:53:53,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:53:53,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1662437453, now seen corresponding path program 2 times [2022-04-28 03:53:53,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:53:53,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [329436411] [2022-04-28 03:53:54,074 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:53:54,303 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:53:54,305 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:53:54,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1641763665, now seen corresponding path program 1 times [2022-04-28 03:53:54,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:53:54,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470330976] [2022-04-28 03:53:54,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:53:54,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:53:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:54,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:53:54,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:54,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {666#(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(17, 2);call #Ultimate.allocInit(12, 3); {655#true} is VALID [2022-04-28 03:53:54,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {655#true} assume true; {655#true} is VALID [2022-04-28 03:53:54,428 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {655#true} {655#true} #41#return; {655#true} is VALID [2022-04-28 03:53:54,429 INFO L272 TraceCheckUtils]: 0: Hoare triple {655#true} call ULTIMATE.init(); {666#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:53:54,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {666#(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(17, 2);call #Ultimate.allocInit(12, 3); {655#true} is VALID [2022-04-28 03:53:54,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {655#true} assume true; {655#true} is VALID [2022-04-28 03:53:54,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {655#true} {655#true} #41#return; {655#true} is VALID [2022-04-28 03:53:54,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {655#true} call #t~ret4 := main(); {655#true} is VALID [2022-04-28 03:53:54,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {655#true} ~x~0 := 0;~y~0 := 500000; {660#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:53:54,430 INFO L290 TraceCheckUtils]: 6: Hoare triple {660#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [53] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_37 v_main_~x~0_36))) (or (and .cse0 (not (< v_main_~x~0_37 500000))) .cse0 (and (< v_main_~x~0_36 500001) (< v_main_~x~0_37 v_main_~x~0_36)))) InVars {main_~x~0=v_main_~x~0_37} OutVars{main_~x~0=v_main_~x~0_36} AuxVars[] AssignedVars[main_~x~0] {661#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:53:54,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {661#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [54] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {661#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:53:54,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {661#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [55] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_39)) (.cse2 (= v_main_~y~0_17 v_main_~y~0_16)) (.cse3 (= v_main_~x~0_39 v_main_~x~0_38))) (or (let ((.cse0 (+ v_main_~x~0_39 v_main_~y~0_16))) (and (< .cse0 (+ v_main_~y~0_17 1000001)) (< v_main_~y~0_17 v_main_~y~0_16) .cse1 (= (+ v_main_~x~0_38 v_main_~y~0_17) .cse0))) (and .cse2 .cse3) (and (or (not (< v_main_~x~0_39 1000000)) (not .cse1)) .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_39, main_~y~0=v_main_~y~0_17} OutVars{main_~x~0=v_main_~x~0_38, main_~y~0=v_main_~y~0_16} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {662#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:53:54,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {662#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [52] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {663#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-28 03:53:54,433 INFO L272 TraceCheckUtils]: 10: Hoare triple {663#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {664#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:53:54,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {664#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {665#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:53:54,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {665#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {656#false} is VALID [2022-04-28 03:53:54,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {656#false} assume !false; {656#false} is VALID [2022-04-28 03:53:54,438 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:53:54,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:53:54,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470330976] [2022-04-28 03:53:54,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470330976] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:53:54,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596895446] [2022-04-28 03:53:54,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:53:54,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:53:54,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:53:54,439 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:53:54,440 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:53:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:54,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:53:54,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:54,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:53:54,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {655#true} call ULTIMATE.init(); {655#true} is VALID [2022-04-28 03:53:54,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {655#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(17, 2);call #Ultimate.allocInit(12, 3); {655#true} is VALID [2022-04-28 03:53:54,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {655#true} assume true; {655#true} is VALID [2022-04-28 03:53:54,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {655#true} {655#true} #41#return; {655#true} is VALID [2022-04-28 03:53:54,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {655#true} call #t~ret4 := main(); {655#true} is VALID [2022-04-28 03:53:54,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {655#true} ~x~0 := 0;~y~0 := 500000; {685#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:53:54,865 INFO L290 TraceCheckUtils]: 6: Hoare triple {685#(and (<= main_~x~0 0) (= main_~y~0 500000))} [53] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_37 v_main_~x~0_36))) (or (and .cse0 (not (< v_main_~x~0_37 500000))) .cse0 (and (< v_main_~x~0_36 500001) (< v_main_~x~0_37 v_main_~x~0_36)))) InVars {main_~x~0=v_main_~x~0_37} OutVars{main_~x~0=v_main_~x~0_36} AuxVars[] AssignedVars[main_~x~0] {689#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:53:54,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {689#(and (= main_~y~0 500000) (< main_~x~0 500001))} [54] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {689#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:53:54,866 INFO L290 TraceCheckUtils]: 8: Hoare triple {689#(and (= main_~y~0 500000) (< main_~x~0 500001))} [55] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_39)) (.cse2 (= v_main_~y~0_17 v_main_~y~0_16)) (.cse3 (= v_main_~x~0_39 v_main_~x~0_38))) (or (let ((.cse0 (+ v_main_~x~0_39 v_main_~y~0_16))) (and (< .cse0 (+ v_main_~y~0_17 1000001)) (< v_main_~y~0_17 v_main_~y~0_16) .cse1 (= (+ v_main_~x~0_38 v_main_~y~0_17) .cse0))) (and .cse2 .cse3) (and (or (not (< v_main_~x~0_39 1000000)) (not .cse1)) .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_39, main_~y~0=v_main_~y~0_17} OutVars{main_~x~0=v_main_~x~0_38, main_~y~0=v_main_~y~0_16} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {696#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:53:54,867 INFO L290 TraceCheckUtils]: 9: Hoare triple {696#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [52] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {700#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:53:54,868 INFO L272 TraceCheckUtils]: 10: Hoare triple {700#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {704#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:53:54,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {704#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {708#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:53:54,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {708#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {656#false} is VALID [2022-04-28 03:53:54,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {656#false} assume !false; {656#false} is VALID [2022-04-28 03:53:54,869 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:53:54,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:53:55,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {656#false} assume !false; {656#false} is VALID [2022-04-28 03:53:55,255 INFO L290 TraceCheckUtils]: 12: Hoare triple {708#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {656#false} is VALID [2022-04-28 03:53:55,255 INFO L290 TraceCheckUtils]: 11: Hoare triple {704#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {708#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:53:55,256 INFO L272 TraceCheckUtils]: 10: Hoare triple {663#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {704#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:53:55,256 INFO L290 TraceCheckUtils]: 9: Hoare triple {727#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [52] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {663#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-28 03:53:55,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {731#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [55] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_39)) (.cse2 (= v_main_~y~0_17 v_main_~y~0_16)) (.cse3 (= v_main_~x~0_39 v_main_~x~0_38))) (or (let ((.cse0 (+ v_main_~x~0_39 v_main_~y~0_16))) (and (< .cse0 (+ v_main_~y~0_17 1000001)) (< v_main_~y~0_17 v_main_~y~0_16) .cse1 (= (+ v_main_~x~0_38 v_main_~y~0_17) .cse0))) (and .cse2 .cse3) (and (or (not (< v_main_~x~0_39 1000000)) (not .cse1)) .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_39, main_~y~0=v_main_~y~0_17} OutVars{main_~x~0=v_main_~x~0_38, main_~y~0=v_main_~y~0_16} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {727#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:53:55,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {731#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [54] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {731#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:53:55,259 INFO L290 TraceCheckUtils]: 6: Hoare triple {738#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} [53] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_37 v_main_~x~0_36))) (or (and .cse0 (not (< v_main_~x~0_37 500000))) .cse0 (and (< v_main_~x~0_36 500001) (< v_main_~x~0_37 v_main_~x~0_36)))) InVars {main_~x~0=v_main_~x~0_37} OutVars{main_~x~0=v_main_~x~0_36} AuxVars[] AssignedVars[main_~x~0] {731#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:53:55,259 INFO L290 TraceCheckUtils]: 5: Hoare triple {655#true} ~x~0 := 0;~y~0 := 500000; {738#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:53:55,259 INFO L272 TraceCheckUtils]: 4: Hoare triple {655#true} call #t~ret4 := main(); {655#true} is VALID [2022-04-28 03:53:55,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {655#true} {655#true} #41#return; {655#true} is VALID [2022-04-28 03:53:55,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {655#true} assume true; {655#true} is VALID [2022-04-28 03:53:55,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {655#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(17, 2);call #Ultimate.allocInit(12, 3); {655#true} is VALID [2022-04-28 03:53:55,260 INFO L272 TraceCheckUtils]: 0: Hoare triple {655#true} call ULTIMATE.init(); {655#true} is VALID [2022-04-28 03:53:55,260 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:53:55,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596895446] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:53:55,260 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:53:55,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 03:53:55,423 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:53:55,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [329436411] [2022-04-28 03:53:55,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [329436411] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:53:55,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:53:55,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:53:55,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311260279] [2022-04-28 03:53:55,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:53:55,425 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 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:53:55,425 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:53:55,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 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:53:55,445 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:53:55,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 03:53:55,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:53:55,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 03:53:55,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2022-04-28 03:53:55,446 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 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:53:55,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:55,708 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-28 03:53:55,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:53:55,708 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 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:53:55,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:53:55,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 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:53:55,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-28 03:53:55,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 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:53:55,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-28 03:53:55,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2022-04-28 03:53:55,733 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:53:55,734 INFO L225 Difference]: With dead ends: 30 [2022-04-28 03:53:55,734 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 03:53:55,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2022-04-28 03:53:55,735 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:53:55,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 43 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:53:55,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 03:53:55,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 03:53:55,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:53:55,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:55,761 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:55,761 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:55,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:55,762 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-28 03:53:55,762 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-28 03:53:55,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:53:55,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:53:55,762 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 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:53:55,763 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 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:53:55,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:55,763 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-28 03:53:55,763 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-28 03:53:55,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:53:55,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:53:55,764 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:53:55,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:53:55,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:55,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-04-28 03:53:55,765 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 19 [2022-04-28 03:53:55,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:53:55,765 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-04-28 03:53:55,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 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:53:55,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 26 transitions. [2022-04-28 03:53:55,793 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:53:55,793 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-28 03:53:55,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 03:53:55,793 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:53:55,793 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:53:55,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 03:53:56,003 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:53:56,004 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:53:56,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:53:56,004 INFO L85 PathProgramCache]: Analyzing trace with hash 361874638, now seen corresponding path program 3 times [2022-04-28 03:53:56,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:53:56,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [115204499] [2022-04-28 03:54:00,069 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:54:00,119 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:54:04,220 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:54:04,334 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:54:04,335 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:54:04,337 INFO L85 PathProgramCache]: Analyzing trace with hash 407768495, now seen corresponding path program 1 times [2022-04-28 03:54:04,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:54:04,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770981388] [2022-04-28 03:54:04,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:04,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:54:04,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:04,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:54:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:04,447 INFO L290 TraceCheckUtils]: 0: Hoare triple {936#(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(17, 2);call #Ultimate.allocInit(12, 3); {925#true} is VALID [2022-04-28 03:54:04,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {925#true} assume true; {925#true} is VALID [2022-04-28 03:54:04,448 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {925#true} {925#true} #41#return; {925#true} is VALID [2022-04-28 03:54:04,448 INFO L272 TraceCheckUtils]: 0: Hoare triple {925#true} call ULTIMATE.init(); {936#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:54:04,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {936#(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(17, 2);call #Ultimate.allocInit(12, 3); {925#true} is VALID [2022-04-28 03:54:04,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {925#true} assume true; {925#true} is VALID [2022-04-28 03:54:04,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {925#true} {925#true} #41#return; {925#true} is VALID [2022-04-28 03:54:04,449 INFO L272 TraceCheckUtils]: 4: Hoare triple {925#true} call #t~ret4 := main(); {925#true} is VALID [2022-04-28 03:54:04,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {925#true} ~x~0 := 0;~y~0 := 500000; {930#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:54:04,450 INFO L290 TraceCheckUtils]: 6: Hoare triple {930#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [57] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_58 v_main_~x~0_57))) (or .cse0 (and (< v_main_~x~0_58 v_main_~x~0_57) (< v_main_~x~0_57 500001)) (and .cse0 (not (< v_main_~x~0_58 500000))))) InVars {main_~x~0=v_main_~x~0_58} OutVars{main_~x~0=v_main_~x~0_57} AuxVars[] AssignedVars[main_~x~0] {931#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:54:04,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {931#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [58] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {931#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:54:04,451 INFO L290 TraceCheckUtils]: 8: Hoare triple {931#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [59] L11-2-->L10-2_primed: Formula: (let ((.cse2 (= v_main_~y~0_28 v_main_~y~0_27)) (.cse0 (<= 500000 v_main_~x~0_60)) (.cse3 (= v_main_~x~0_60 v_main_~x~0_59))) (or (let ((.cse1 (+ v_main_~x~0_60 v_main_~y~0_27))) (and .cse0 (= .cse1 (+ v_main_~x~0_59 v_main_~y~0_28)) (< .cse1 (+ v_main_~y~0_28 1000001)) (< v_main_~y~0_28 v_main_~y~0_27))) (and .cse2 .cse3) (and .cse2 (or (not (< v_main_~x~0_60 1000000)) (not .cse0)) .cse3))) InVars {main_~x~0=v_main_~x~0_60, main_~y~0=v_main_~y~0_28} OutVars{main_~x~0=v_main_~x~0_59, main_~y~0=v_main_~y~0_27} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {932#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} is VALID [2022-04-28 03:54:04,451 INFO L290 TraceCheckUtils]: 9: Hoare triple {932#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} [56] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {933#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:54:04,452 INFO L272 TraceCheckUtils]: 10: Hoare triple {933#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {934#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:54:04,452 INFO L290 TraceCheckUtils]: 11: Hoare triple {934#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {935#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:54:04,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {935#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {926#false} is VALID [2022-04-28 03:54:04,453 INFO L290 TraceCheckUtils]: 13: Hoare triple {926#false} assume !false; {926#false} is VALID [2022-04-28 03:54:04,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:54:04,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:54:04,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770981388] [2022-04-28 03:54:04,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770981388] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:54:04,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355091422] [2022-04-28 03:54:04,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:04,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:54:04,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:54:04,464 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:54:04,465 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:54:04,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:04,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:54:04,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:04,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:54:04,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {925#true} call ULTIMATE.init(); {925#true} is VALID [2022-04-28 03:54:04,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {925#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(17, 2);call #Ultimate.allocInit(12, 3); {925#true} is VALID [2022-04-28 03:54:04,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {925#true} assume true; {925#true} is VALID [2022-04-28 03:54:04,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {925#true} {925#true} #41#return; {925#true} is VALID [2022-04-28 03:54:04,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {925#true} call #t~ret4 := main(); {925#true} is VALID [2022-04-28 03:54:04,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {925#true} ~x~0 := 0;~y~0 := 500000; {955#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:54:04,946 INFO L290 TraceCheckUtils]: 6: Hoare triple {955#(and (<= main_~x~0 0) (= main_~y~0 500000))} [57] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_58 v_main_~x~0_57))) (or .cse0 (and (< v_main_~x~0_58 v_main_~x~0_57) (< v_main_~x~0_57 500001)) (and .cse0 (not (< v_main_~x~0_58 500000))))) InVars {main_~x~0=v_main_~x~0_58} OutVars{main_~x~0=v_main_~x~0_57} AuxVars[] AssignedVars[main_~x~0] {959#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:54:04,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {959#(and (= main_~y~0 500000) (< main_~x~0 500001))} [58] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {959#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:54:04,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {959#(and (= main_~y~0 500000) (< main_~x~0 500001))} [59] L11-2-->L10-2_primed: Formula: (let ((.cse2 (= v_main_~y~0_28 v_main_~y~0_27)) (.cse0 (<= 500000 v_main_~x~0_60)) (.cse3 (= v_main_~x~0_60 v_main_~x~0_59))) (or (let ((.cse1 (+ v_main_~x~0_60 v_main_~y~0_27))) (and .cse0 (= .cse1 (+ v_main_~x~0_59 v_main_~y~0_28)) (< .cse1 (+ v_main_~y~0_28 1000001)) (< v_main_~y~0_28 v_main_~y~0_27))) (and .cse2 .cse3) (and .cse2 (or (not (< v_main_~x~0_60 1000000)) (not .cse0)) .cse3))) InVars {main_~x~0=v_main_~x~0_60, main_~y~0=v_main_~y~0_28} OutVars{main_~x~0=v_main_~x~0_59, main_~y~0=v_main_~y~0_27} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {966#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:04,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {966#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [56] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {970#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:54:04,949 INFO L272 TraceCheckUtils]: 10: Hoare triple {970#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {974#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:54:04,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {974#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {978#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:54:04,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {978#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {926#false} is VALID [2022-04-28 03:54:04,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {926#false} assume !false; {926#false} is VALID [2022-04-28 03:54:04,950 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:54:04,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:54:05,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {926#false} assume !false; {926#false} is VALID [2022-04-28 03:54:05,326 INFO L290 TraceCheckUtils]: 12: Hoare triple {978#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {926#false} is VALID [2022-04-28 03:54:05,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {974#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {978#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:54:05,327 INFO L272 TraceCheckUtils]: 10: Hoare triple {933#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {974#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:54:05,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {997#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [56] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {933#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:54:05,329 INFO L290 TraceCheckUtils]: 8: Hoare triple {1001#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [59] L11-2-->L10-2_primed: Formula: (let ((.cse2 (= v_main_~y~0_28 v_main_~y~0_27)) (.cse0 (<= 500000 v_main_~x~0_60)) (.cse3 (= v_main_~x~0_60 v_main_~x~0_59))) (or (let ((.cse1 (+ v_main_~x~0_60 v_main_~y~0_27))) (and .cse0 (= .cse1 (+ v_main_~x~0_59 v_main_~y~0_28)) (< .cse1 (+ v_main_~y~0_28 1000001)) (< v_main_~y~0_28 v_main_~y~0_27))) (and .cse2 .cse3) (and .cse2 (or (not (< v_main_~x~0_60 1000000)) (not .cse0)) .cse3))) InVars {main_~x~0=v_main_~x~0_60, main_~y~0=v_main_~y~0_28} OutVars{main_~x~0=v_main_~x~0_59, main_~y~0=v_main_~y~0_27} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {997#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:05,329 INFO L290 TraceCheckUtils]: 7: Hoare triple {1001#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [58] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1001#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:05,331 INFO L290 TraceCheckUtils]: 6: Hoare triple {1008#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [57] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_58 v_main_~x~0_57))) (or .cse0 (and (< v_main_~x~0_58 v_main_~x~0_57) (< v_main_~x~0_57 500001)) (and .cse0 (not (< v_main_~x~0_58 500000))))) InVars {main_~x~0=v_main_~x~0_58} OutVars{main_~x~0=v_main_~x~0_57} AuxVars[] AssignedVars[main_~x~0] {1001#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:05,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {925#true} ~x~0 := 0;~y~0 := 500000; {1008#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:05,331 INFO L272 TraceCheckUtils]: 4: Hoare triple {925#true} call #t~ret4 := main(); {925#true} is VALID [2022-04-28 03:54:05,331 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {925#true} {925#true} #41#return; {925#true} is VALID [2022-04-28 03:54:05,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {925#true} assume true; {925#true} is VALID [2022-04-28 03:54:05,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {925#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(17, 2);call #Ultimate.allocInit(12, 3); {925#true} is VALID [2022-04-28 03:54:05,332 INFO L272 TraceCheckUtils]: 0: Hoare triple {925#true} call ULTIMATE.init(); {925#true} is VALID [2022-04-28 03:54:05,332 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:54:05,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355091422] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:54:05,332 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:54:05,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 03:54:05,533 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:54:05,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [115204499] [2022-04-28 03:54:05,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [115204499] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:54:05,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:54:05,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 03:54:05,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018657152] [2022-04-28 03:54:05,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:54:05,534 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 9 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:54:05,534 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:54:05,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.7) internal successors, (17), 9 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:54:05,548 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:54:05,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 03:54:05,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:05,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 03:54:05,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2022-04-28 03:54:05,549 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 9 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:54:05,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:05,869 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-28 03:54:05,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:54:05,869 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 9 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:54:05,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:54:05,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 9 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:54:05,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2022-04-28 03:54:05,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 9 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:54:05,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2022-04-28 03:54:05,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 37 transitions. [2022-04-28 03:54:05,897 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:54:05,897 INFO L225 Difference]: With dead ends: 32 [2022-04-28 03:54:05,897 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 03:54:05,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=626, Unknown=0, NotChecked=0, Total=812 [2022-04-28 03:54:05,898 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 17 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:54:05,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 43 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:54:05,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 03:54:05,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-28 03:54:05,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:54:05,936 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:05,937 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:05,937 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:05,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:05,938 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-28 03:54:05,938 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-28 03:54:05,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:05,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:05,939 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 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:54:05,940 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 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:54:05,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:05,942 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-28 03:54:05,942 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-28 03:54:05,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:05,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:05,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:54:05,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:54:05,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:05,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-28 03:54:05,947 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 21 [2022-04-28 03:54:05,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:54:05,947 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-28 03:54:05,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 9 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:54:05,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 28 transitions. [2022-04-28 03:54:05,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:54:05,966 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-28 03:54:05,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 03:54:05,967 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:54:05,967 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:54:05,983 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:54:06,183 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:54:06,183 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:54:06,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:54:06,184 INFO L85 PathProgramCache]: Analyzing trace with hash 105609001, now seen corresponding path program 4 times [2022-04-28 03:54:06,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:06,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [509080080] [2022-04-28 03:54:06,274 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:54:06,511 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:54:06,512 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:54:06,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1837666641, now seen corresponding path program 1 times [2022-04-28 03:54:06,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:54:06,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024366046] [2022-04-28 03:54:06,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:06,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:54:06,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:06,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:54:06,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:06,605 INFO L290 TraceCheckUtils]: 0: Hoare triple {1221#(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(17, 2);call #Ultimate.allocInit(12, 3); {1210#true} is VALID [2022-04-28 03:54:06,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {1210#true} assume true; {1210#true} is VALID [2022-04-28 03:54:06,605 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1210#true} {1210#true} #41#return; {1210#true} is VALID [2022-04-28 03:54:06,606 INFO L272 TraceCheckUtils]: 0: Hoare triple {1210#true} call ULTIMATE.init(); {1221#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:54:06,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {1221#(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(17, 2);call #Ultimate.allocInit(12, 3); {1210#true} is VALID [2022-04-28 03:54:06,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {1210#true} assume true; {1210#true} is VALID [2022-04-28 03:54:06,606 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1210#true} {1210#true} #41#return; {1210#true} is VALID [2022-04-28 03:54:06,606 INFO L272 TraceCheckUtils]: 4: Hoare triple {1210#true} call #t~ret4 := main(); {1210#true} is VALID [2022-04-28 03:54:06,606 INFO L290 TraceCheckUtils]: 5: Hoare triple {1210#true} ~x~0 := 0;~y~0 := 500000; {1215#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:54:06,607 INFO L290 TraceCheckUtils]: 6: Hoare triple {1215#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [61] L11-2-->L10-2_primed: Formula: (or (and (not (< v_main_~x~0_80 500000)) (= v_main_~x~0_79 v_main_~x~0_80)) (= v_main_~x~0_80 v_main_~x~0_79) (and (< v_main_~x~0_79 500001) (< v_main_~x~0_80 v_main_~x~0_79))) InVars {main_~x~0=v_main_~x~0_80} OutVars{main_~x~0=v_main_~x~0_79} AuxVars[] AssignedVars[main_~x~0] {1216#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:54:06,607 INFO L290 TraceCheckUtils]: 7: Hoare triple {1216#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [62] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1216#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:54:06,608 INFO L290 TraceCheckUtils]: 8: Hoare triple {1216#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [63] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_82))) (or (and (= v_main_~y~0_39 v_main_~y~0_40) (= v_main_~x~0_81 v_main_~x~0_82) (or (not .cse0) (not (< v_main_~x~0_82 1000000)))) (and (< v_main_~x~0_81 1000001) .cse0 (= (+ v_main_~x~0_82 v_main_~y~0_39) (+ v_main_~x~0_81 v_main_~y~0_40)) (< v_main_~x~0_82 v_main_~x~0_81)) (and (= v_main_~y~0_40 v_main_~y~0_39) (= v_main_~x~0_82 v_main_~x~0_81)))) InVars {main_~x~0=v_main_~x~0_82, main_~y~0=v_main_~y~0_40} OutVars{main_~x~0=v_main_~x~0_81, main_~y~0=v_main_~y~0_39} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1217#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:06,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {1217#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [60] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1218#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:54:06,609 INFO L272 TraceCheckUtils]: 10: Hoare triple {1218#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {1219#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:54:06,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {1219#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1220#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:54:06,610 INFO L290 TraceCheckUtils]: 12: Hoare triple {1220#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1211#false} is VALID [2022-04-28 03:54:06,610 INFO L290 TraceCheckUtils]: 13: Hoare triple {1211#false} assume !false; {1211#false} is VALID [2022-04-28 03:54:06,610 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:54:06,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:54:06,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024366046] [2022-04-28 03:54:06,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024366046] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:54:06,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930464628] [2022-04-28 03:54:06,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:06,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:54:06,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:54:06,612 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:54:06,612 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:54:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:06,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:54:06,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:06,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:54:07,032 INFO L272 TraceCheckUtils]: 0: Hoare triple {1210#true} call ULTIMATE.init(); {1210#true} is VALID [2022-04-28 03:54:07,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {1210#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(17, 2);call #Ultimate.allocInit(12, 3); {1210#true} is VALID [2022-04-28 03:54:07,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {1210#true} assume true; {1210#true} is VALID [2022-04-28 03:54:07,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1210#true} {1210#true} #41#return; {1210#true} is VALID [2022-04-28 03:54:07,033 INFO L272 TraceCheckUtils]: 4: Hoare triple {1210#true} call #t~ret4 := main(); {1210#true} is VALID [2022-04-28 03:54:07,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {1210#true} ~x~0 := 0;~y~0 := 500000; {1240#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:54:07,036 INFO L290 TraceCheckUtils]: 6: Hoare triple {1240#(and (<= main_~x~0 0) (= main_~y~0 500000))} [61] L11-2-->L10-2_primed: Formula: (or (and (not (< v_main_~x~0_80 500000)) (= v_main_~x~0_79 v_main_~x~0_80)) (= v_main_~x~0_80 v_main_~x~0_79) (and (< v_main_~x~0_79 500001) (< v_main_~x~0_80 v_main_~x~0_79))) InVars {main_~x~0=v_main_~x~0_80} OutVars{main_~x~0=v_main_~x~0_79} AuxVars[] AssignedVars[main_~x~0] {1244#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:54:07,037 INFO L290 TraceCheckUtils]: 7: Hoare triple {1244#(and (= main_~y~0 500000) (< main_~x~0 500001))} [62] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1244#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:54:07,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {1244#(and (= main_~y~0 500000) (< main_~x~0 500001))} [63] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_82))) (or (and (= v_main_~y~0_39 v_main_~y~0_40) (= v_main_~x~0_81 v_main_~x~0_82) (or (not .cse0) (not (< v_main_~x~0_82 1000000)))) (and (< v_main_~x~0_81 1000001) .cse0 (= (+ v_main_~x~0_82 v_main_~y~0_39) (+ v_main_~x~0_81 v_main_~y~0_40)) (< v_main_~x~0_82 v_main_~x~0_81)) (and (= v_main_~y~0_40 v_main_~y~0_39) (= v_main_~x~0_82 v_main_~x~0_81)))) InVars {main_~x~0=v_main_~x~0_82, main_~y~0=v_main_~y~0_40} OutVars{main_~x~0=v_main_~x~0_81, main_~y~0=v_main_~y~0_39} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1251#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:07,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {1251#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [60] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1255#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:54:07,039 INFO L272 TraceCheckUtils]: 10: Hoare triple {1255#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {1259#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:54:07,039 INFO L290 TraceCheckUtils]: 11: Hoare triple {1259#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1263#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:54:07,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {1263#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1211#false} is VALID [2022-04-28 03:54:07,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {1211#false} assume !false; {1211#false} is VALID [2022-04-28 03:54:07,040 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:54:07,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:54:07,405 INFO L290 TraceCheckUtils]: 13: Hoare triple {1211#false} assume !false; {1211#false} is VALID [2022-04-28 03:54:07,405 INFO L290 TraceCheckUtils]: 12: Hoare triple {1263#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1211#false} is VALID [2022-04-28 03:54:07,406 INFO L290 TraceCheckUtils]: 11: Hoare triple {1259#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1263#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:54:07,406 INFO L272 TraceCheckUtils]: 10: Hoare triple {1218#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {1259#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:54:07,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {1282#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [60] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1218#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:54:07,408 INFO L290 TraceCheckUtils]: 8: Hoare triple {1286#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [63] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_82))) (or (and (= v_main_~y~0_39 v_main_~y~0_40) (= v_main_~x~0_81 v_main_~x~0_82) (or (not .cse0) (not (< v_main_~x~0_82 1000000)))) (and (< v_main_~x~0_81 1000001) .cse0 (= (+ v_main_~x~0_82 v_main_~y~0_39) (+ v_main_~x~0_81 v_main_~y~0_40)) (< v_main_~x~0_82 v_main_~x~0_81)) (and (= v_main_~y~0_40 v_main_~y~0_39) (= v_main_~x~0_82 v_main_~x~0_81)))) InVars {main_~x~0=v_main_~x~0_82, main_~y~0=v_main_~y~0_40} OutVars{main_~x~0=v_main_~x~0_81, main_~y~0=v_main_~y~0_39} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1282#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:07,408 INFO L290 TraceCheckUtils]: 7: Hoare triple {1286#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [62] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1286#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:07,409 INFO L290 TraceCheckUtils]: 6: Hoare triple {1293#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [61] L11-2-->L10-2_primed: Formula: (or (and (not (< v_main_~x~0_80 500000)) (= v_main_~x~0_79 v_main_~x~0_80)) (= v_main_~x~0_80 v_main_~x~0_79) (and (< v_main_~x~0_79 500001) (< v_main_~x~0_80 v_main_~x~0_79))) InVars {main_~x~0=v_main_~x~0_80} OutVars{main_~x~0=v_main_~x~0_79} AuxVars[] AssignedVars[main_~x~0] {1286#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:07,409 INFO L290 TraceCheckUtils]: 5: Hoare triple {1210#true} ~x~0 := 0;~y~0 := 500000; {1293#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:54:07,409 INFO L272 TraceCheckUtils]: 4: Hoare triple {1210#true} call #t~ret4 := main(); {1210#true} is VALID [2022-04-28 03:54:07,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1210#true} {1210#true} #41#return; {1210#true} is VALID [2022-04-28 03:54:07,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {1210#true} assume true; {1210#true} is VALID [2022-04-28 03:54:07,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {1210#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(17, 2);call #Ultimate.allocInit(12, 3); {1210#true} is VALID [2022-04-28 03:54:07,410 INFO L272 TraceCheckUtils]: 0: Hoare triple {1210#true} call ULTIMATE.init(); {1210#true} is VALID [2022-04-28 03:54:07,410 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:54:07,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930464628] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:54:07,410 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:54:07,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 03:54:07,645 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:54:07,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [509080080] [2022-04-28 03:54:07,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [509080080] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:54:07,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:54:07,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 03:54:07,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259514414] [2022-04-28 03:54:07,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:54:07,646 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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:54:07,647 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:54:07,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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:54:07,663 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:54:07,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 03:54:07,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:07,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 03:54:07,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2022-04-28 03:54:07,664 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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:54:08,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:08,007 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-28 03:54:08,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 03:54:08,007 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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:54:08,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:54:08,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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:54:08,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 39 transitions. [2022-04-28 03:54:08,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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:54:08,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 39 transitions. [2022-04-28 03:54:08,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 39 transitions. [2022-04-28 03:54:08,043 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:54:08,044 INFO L225 Difference]: With dead ends: 34 [2022-04-28 03:54:08,044 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 03:54:08,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=725, Unknown=0, NotChecked=0, Total=930 [2022-04-28 03:54:08,045 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 19 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:54:08,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 33 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:54:08,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 03:54:08,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-28 03:54:08,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:54:08,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:08,079 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:08,079 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:08,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:08,080 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-28 03:54:08,080 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-28 03:54:08,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:08,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:08,080 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-28 03:54:08,081 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-28 03:54:08,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:08,081 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-28 03:54:08,081 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-28 03:54:08,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:08,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:08,082 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:54:08,082 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:54:08,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:08,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-28 03:54:08,082 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 23 [2022-04-28 03:54:08,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:54:08,083 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-28 03:54:08,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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:54:08,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 30 transitions. [2022-04-28 03:54:08,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:54:08,106 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-28 03:54:08,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 03:54:08,107 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:54:08,107 INFO L195 NwaCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:54:08,122 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:54:08,321 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:54:08,321 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:54:08,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:54:08,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1352532284, now seen corresponding path program 5 times [2022-04-28 03:54:08,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:08,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1381493241] [2022-04-28 03:54:12,385 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:54:12,448 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:54:12,667 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:54:12,668 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:54:12,670 INFO L85 PathProgramCache]: Analyzing trace with hash 211865519, now seen corresponding path program 1 times [2022-04-28 03:54:12,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:54:12,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925017737] [2022-04-28 03:54:12,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:12,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:54:12,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:12,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:54:12,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:12,779 INFO L290 TraceCheckUtils]: 0: Hoare triple {1521#(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(17, 2);call #Ultimate.allocInit(12, 3); {1510#true} is VALID [2022-04-28 03:54:12,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {1510#true} assume true; {1510#true} is VALID [2022-04-28 03:54:12,779 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1510#true} {1510#true} #41#return; {1510#true} is VALID [2022-04-28 03:54:12,780 INFO L272 TraceCheckUtils]: 0: Hoare triple {1510#true} call ULTIMATE.init(); {1521#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:54:12,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {1521#(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(17, 2);call #Ultimate.allocInit(12, 3); {1510#true} is VALID [2022-04-28 03:54:12,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {1510#true} assume true; {1510#true} is VALID [2022-04-28 03:54:12,780 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1510#true} {1510#true} #41#return; {1510#true} is VALID [2022-04-28 03:54:12,780 INFO L272 TraceCheckUtils]: 4: Hoare triple {1510#true} call #t~ret4 := main(); {1510#true} is VALID [2022-04-28 03:54:12,780 INFO L290 TraceCheckUtils]: 5: Hoare triple {1510#true} ~x~0 := 0;~y~0 := 500000; {1515#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:54:12,781 INFO L290 TraceCheckUtils]: 6: Hoare triple {1515#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [65] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_103 v_main_~x~0_102))) (or (and (<= 500000 v_main_~x~0_103) .cse0) (and (< v_main_~x~0_103 v_main_~x~0_102) (< v_main_~x~0_102 500001)) .cse0)) InVars {main_~x~0=v_main_~x~0_103} OutVars{main_~x~0=v_main_~x~0_102} AuxVars[] AssignedVars[main_~x~0] {1516#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:54:12,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {1516#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [66] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1516#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:54:12,782 INFO L290 TraceCheckUtils]: 8: Hoare triple {1516#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [67] L11-2-->L10-2_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_105)) (.cse0 (= v_main_~y~0_53 v_main_~y~0_52))) (or (and .cse0 (= v_main_~x~0_105 v_main_~x~0_104)) (let ((.cse1 (+ v_main_~x~0_105 v_main_~y~0_52))) (and (= .cse1 (+ v_main_~x~0_104 v_main_~y~0_53)) (< v_main_~y~0_53 v_main_~y~0_52) (< .cse1 (+ v_main_~y~0_53 1000001)) .cse2)) (and (= v_main_~x~0_104 v_main_~x~0_105) (or (not .cse2) (not (< v_main_~x~0_105 1000000))) .cse0))) InVars {main_~x~0=v_main_~x~0_105, main_~y~0=v_main_~y~0_53} OutVars{main_~x~0=v_main_~x~0_104, main_~y~0=v_main_~y~0_52} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1517#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} is VALID [2022-04-28 03:54:12,783 INFO L290 TraceCheckUtils]: 9: Hoare triple {1517#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} [64] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1518#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:54:12,784 INFO L272 TraceCheckUtils]: 10: Hoare triple {1518#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {1519#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:54:12,784 INFO L290 TraceCheckUtils]: 11: Hoare triple {1519#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1520#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:54:12,784 INFO L290 TraceCheckUtils]: 12: Hoare triple {1520#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1511#false} is VALID [2022-04-28 03:54:12,784 INFO L290 TraceCheckUtils]: 13: Hoare triple {1511#false} assume !false; {1511#false} is VALID [2022-04-28 03:54:12,785 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:54:12,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:54:12,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925017737] [2022-04-28 03:54:12,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925017737] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:54:12,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785002570] [2022-04-28 03:54:12,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:12,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:54:12,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:54:12,786 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:54:12,787 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:54:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:12,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:54:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:12,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:54:13,166 INFO L272 TraceCheckUtils]: 0: Hoare triple {1510#true} call ULTIMATE.init(); {1510#true} is VALID [2022-04-28 03:54:13,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {1510#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(17, 2);call #Ultimate.allocInit(12, 3); {1510#true} is VALID [2022-04-28 03:54:13,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {1510#true} assume true; {1510#true} is VALID [2022-04-28 03:54:13,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1510#true} {1510#true} #41#return; {1510#true} is VALID [2022-04-28 03:54:13,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {1510#true} call #t~ret4 := main(); {1510#true} is VALID [2022-04-28 03:54:13,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {1510#true} ~x~0 := 0;~y~0 := 500000; {1540#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:54:13,184 INFO L290 TraceCheckUtils]: 6: Hoare triple {1540#(and (<= main_~x~0 0) (= main_~y~0 500000))} [65] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_103 v_main_~x~0_102))) (or (and (<= 500000 v_main_~x~0_103) .cse0) (and (< v_main_~x~0_103 v_main_~x~0_102) (< v_main_~x~0_102 500001)) .cse0)) InVars {main_~x~0=v_main_~x~0_103} OutVars{main_~x~0=v_main_~x~0_102} AuxVars[] AssignedVars[main_~x~0] {1544#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:54:13,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {1544#(and (= main_~y~0 500000) (< main_~x~0 500001))} [66] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1544#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:54:13,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {1544#(and (= main_~y~0 500000) (< main_~x~0 500001))} [67] L11-2-->L10-2_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_105)) (.cse0 (= v_main_~y~0_53 v_main_~y~0_52))) (or (and .cse0 (= v_main_~x~0_105 v_main_~x~0_104)) (let ((.cse1 (+ v_main_~x~0_105 v_main_~y~0_52))) (and (= .cse1 (+ v_main_~x~0_104 v_main_~y~0_53)) (< v_main_~y~0_53 v_main_~y~0_52) (< .cse1 (+ v_main_~y~0_53 1000001)) .cse2)) (and (= v_main_~x~0_104 v_main_~x~0_105) (or (not .cse2) (not (< v_main_~x~0_105 1000000))) .cse0))) InVars {main_~x~0=v_main_~x~0_105, main_~y~0=v_main_~y~0_53} OutVars{main_~x~0=v_main_~x~0_104, main_~y~0=v_main_~y~0_52} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1551#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:13,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {1551#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [64] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1555#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:54:13,187 INFO L272 TraceCheckUtils]: 10: Hoare triple {1555#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {1559#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:54:13,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {1559#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1563#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:54:13,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {1563#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1511#false} is VALID [2022-04-28 03:54:13,188 INFO L290 TraceCheckUtils]: 13: Hoare triple {1511#false} assume !false; {1511#false} is VALID [2022-04-28 03:54:13,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:54:13,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:54:13,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {1511#false} assume !false; {1511#false} is VALID [2022-04-28 03:54:13,546 INFO L290 TraceCheckUtils]: 12: Hoare triple {1563#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1511#false} is VALID [2022-04-28 03:54:13,546 INFO L290 TraceCheckUtils]: 11: Hoare triple {1559#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1563#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:54:13,547 INFO L272 TraceCheckUtils]: 10: Hoare triple {1518#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {1559#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:54:13,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {1582#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [64] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1518#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:54:13,548 INFO L290 TraceCheckUtils]: 8: Hoare triple {1586#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [67] L11-2-->L10-2_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_105)) (.cse0 (= v_main_~y~0_53 v_main_~y~0_52))) (or (and .cse0 (= v_main_~x~0_105 v_main_~x~0_104)) (let ((.cse1 (+ v_main_~x~0_105 v_main_~y~0_52))) (and (= .cse1 (+ v_main_~x~0_104 v_main_~y~0_53)) (< v_main_~y~0_53 v_main_~y~0_52) (< .cse1 (+ v_main_~y~0_53 1000001)) .cse2)) (and (= v_main_~x~0_104 v_main_~x~0_105) (or (not .cse2) (not (< v_main_~x~0_105 1000000))) .cse0))) InVars {main_~x~0=v_main_~x~0_105, main_~y~0=v_main_~y~0_53} OutVars{main_~x~0=v_main_~x~0_104, main_~y~0=v_main_~y~0_52} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1582#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:13,549 INFO L290 TraceCheckUtils]: 7: Hoare triple {1586#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [66] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1586#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:13,550 INFO L290 TraceCheckUtils]: 6: Hoare triple {1593#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [65] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_103 v_main_~x~0_102))) (or (and (<= 500000 v_main_~x~0_103) .cse0) (and (< v_main_~x~0_103 v_main_~x~0_102) (< v_main_~x~0_102 500001)) .cse0)) InVars {main_~x~0=v_main_~x~0_103} OutVars{main_~x~0=v_main_~x~0_102} AuxVars[] AssignedVars[main_~x~0] {1586#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:13,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {1510#true} ~x~0 := 0;~y~0 := 500000; {1593#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:54:13,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {1510#true} call #t~ret4 := main(); {1510#true} is VALID [2022-04-28 03:54:13,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1510#true} {1510#true} #41#return; {1510#true} is VALID [2022-04-28 03:54:13,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {1510#true} assume true; {1510#true} is VALID [2022-04-28 03:54:13,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {1510#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(17, 2);call #Ultimate.allocInit(12, 3); {1510#true} is VALID [2022-04-28 03:54:13,551 INFO L272 TraceCheckUtils]: 0: Hoare triple {1510#true} call ULTIMATE.init(); {1510#true} is VALID [2022-04-28 03:54:13,551 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:54:13,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785002570] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:54:13,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:54:13,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 03:54:13,779 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:54:13,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1381493241] [2022-04-28 03:54:13,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1381493241] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:54:13,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:54:13,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 03:54:13,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407127244] [2022-04-28 03:54:13,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:54:13,779 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 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:54:13,780 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:54:13,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 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:54:13,796 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:54:13,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 03:54:13,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:13,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 03:54:13,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2022-04-28 03:54:13,796 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 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:54:14,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:14,242 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-28 03:54:14,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 03:54:14,242 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 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:54:14,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:54:14,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 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:54:14,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 41 transitions. [2022-04-28 03:54:14,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 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:54:14,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 41 transitions. [2022-04-28 03:54:14,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 41 transitions. [2022-04-28 03:54:14,283 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:54:14,283 INFO L225 Difference]: With dead ends: 36 [2022-04-28 03:54:14,283 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 03:54:14,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=224, Invalid=832, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 03:54:14,284 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 21 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:54:14,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 43 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:54:14,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 03:54:14,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-28 03:54:14,354 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:54:14,354 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:14,354 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:14,354 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:14,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:14,355 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-28 03:54:14,355 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-04-28 03:54:14,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:14,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:14,356 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 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:54:14,356 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 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:54:14,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:14,356 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-28 03:54:14,356 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-04-28 03:54:14,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:14,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:14,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:54:14,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:54:14,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:14,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-04-28 03:54:14,357 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 25 [2022-04-28 03:54:14,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:54:14,358 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-04-28 03:54:14,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 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:54:14,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 32 transitions. [2022-04-28 03:54:14,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:54:14,382 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-04-28 03:54:14,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 03:54:14,382 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:54:14,382 INFO L195 NwaCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:54:14,400 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:54:14,592 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:54:14,592 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:54:14,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:54:14,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1827998623, now seen corresponding path program 6 times [2022-04-28 03:54:14,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:14,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1632537622] [2022-04-28 03:54:14,689 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:54:14,881 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:54:14,882 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:54:14,884 INFO L85 PathProgramCache]: Analyzing trace with hash -2033569617, now seen corresponding path program 1 times [2022-04-28 03:54:14,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:54:14,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864784201] [2022-04-28 03:54:14,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:14,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:54:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:14,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:54:14,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:14,982 INFO L290 TraceCheckUtils]: 0: Hoare triple {1836#(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(17, 2);call #Ultimate.allocInit(12, 3); {1825#true} is VALID [2022-04-28 03:54:14,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {1825#true} assume true; {1825#true} is VALID [2022-04-28 03:54:14,983 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1825#true} {1825#true} #41#return; {1825#true} is VALID [2022-04-28 03:54:14,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {1825#true} call ULTIMATE.init(); {1836#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:54:14,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {1836#(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(17, 2);call #Ultimate.allocInit(12, 3); {1825#true} is VALID [2022-04-28 03:54:14,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {1825#true} assume true; {1825#true} is VALID [2022-04-28 03:54:14,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1825#true} {1825#true} #41#return; {1825#true} is VALID [2022-04-28 03:54:14,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {1825#true} call #t~ret4 := main(); {1825#true} is VALID [2022-04-28 03:54:14,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {1825#true} ~x~0 := 0;~y~0 := 500000; {1830#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:54:14,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {1830#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [69] L11-2-->L10-2_primed: Formula: (or (and (<= 500000 v_main_~x~0_127) (= v_main_~x~0_126 v_main_~x~0_127)) (= v_main_~x~0_127 v_main_~x~0_126) (and (< v_main_~x~0_126 500001) (< v_main_~x~0_127 v_main_~x~0_126))) InVars {main_~x~0=v_main_~x~0_127} OutVars{main_~x~0=v_main_~x~0_126} AuxVars[] AssignedVars[main_~x~0] {1831#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:54:14,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {1831#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [70] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1831#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:54:14,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {1831#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [71] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_129 v_main_~x~0_128)) (.cse1 (= v_main_~y~0_67 v_main_~y~0_66)) (.cse2 (<= 500000 v_main_~x~0_129))) (or (and .cse0 .cse1) (and (or (not (< v_main_~x~0_129 1000000)) (not .cse2)) .cse0 .cse1) (and (< v_main_~x~0_128 1000001) .cse2 (= (+ v_main_~x~0_128 v_main_~y~0_67) (+ v_main_~x~0_129 v_main_~y~0_66)) (< v_main_~x~0_129 v_main_~x~0_128)))) InVars {main_~x~0=v_main_~x~0_129, main_~y~0=v_main_~y~0_67} OutVars{main_~x~0=v_main_~x~0_128, main_~y~0=v_main_~y~0_66} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1832#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:14,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {1832#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [68] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1833#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:54:14,990 INFO L272 TraceCheckUtils]: 10: Hoare triple {1833#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {1834#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:54:15,014 INFO L290 TraceCheckUtils]: 11: Hoare triple {1834#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1835#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:54:15,015 INFO L290 TraceCheckUtils]: 12: Hoare triple {1835#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1826#false} is VALID [2022-04-28 03:54:15,015 INFO L290 TraceCheckUtils]: 13: Hoare triple {1826#false} assume !false; {1826#false} is VALID [2022-04-28 03:54:15,017 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:54:15,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:54:15,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864784201] [2022-04-28 03:54:15,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864784201] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:54:15,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898847182] [2022-04-28 03:54:15,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:15,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:54:15,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:54:15,018 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:54:15,020 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:54:15,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:15,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:54:15,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:15,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:54:15,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {1825#true} call ULTIMATE.init(); {1825#true} is VALID [2022-04-28 03:54:15,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {1825#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(17, 2);call #Ultimate.allocInit(12, 3); {1825#true} is VALID [2022-04-28 03:54:15,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {1825#true} assume true; {1825#true} is VALID [2022-04-28 03:54:15,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1825#true} {1825#true} #41#return; {1825#true} is VALID [2022-04-28 03:54:15,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {1825#true} call #t~ret4 := main(); {1825#true} is VALID [2022-04-28 03:54:15,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {1825#true} ~x~0 := 0;~y~0 := 500000; {1855#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:54:15,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {1855#(and (<= main_~x~0 0) (= main_~y~0 500000))} [69] L11-2-->L10-2_primed: Formula: (or (and (<= 500000 v_main_~x~0_127) (= v_main_~x~0_126 v_main_~x~0_127)) (= v_main_~x~0_127 v_main_~x~0_126) (and (< v_main_~x~0_126 500001) (< v_main_~x~0_127 v_main_~x~0_126))) InVars {main_~x~0=v_main_~x~0_127} OutVars{main_~x~0=v_main_~x~0_126} AuxVars[] AssignedVars[main_~x~0] {1859#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:54:15,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {1859#(and (= main_~y~0 500000) (< main_~x~0 500001))} [70] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1859#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:54:15,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {1859#(and (= main_~y~0 500000) (< main_~x~0 500001))} [71] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_129 v_main_~x~0_128)) (.cse1 (= v_main_~y~0_67 v_main_~y~0_66)) (.cse2 (<= 500000 v_main_~x~0_129))) (or (and .cse0 .cse1) (and (or (not (< v_main_~x~0_129 1000000)) (not .cse2)) .cse0 .cse1) (and (< v_main_~x~0_128 1000001) .cse2 (= (+ v_main_~x~0_128 v_main_~y~0_67) (+ v_main_~x~0_129 v_main_~y~0_66)) (< v_main_~x~0_129 v_main_~x~0_128)))) InVars {main_~x~0=v_main_~x~0_129, main_~y~0=v_main_~y~0_67} OutVars{main_~x~0=v_main_~x~0_128, main_~y~0=v_main_~y~0_66} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1866#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:15,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {1866#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [68] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1870#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:54:15,396 INFO L272 TraceCheckUtils]: 10: Hoare triple {1870#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {1874#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:54:15,396 INFO L290 TraceCheckUtils]: 11: Hoare triple {1874#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1878#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:54:15,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {1878#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1826#false} is VALID [2022-04-28 03:54:15,396 INFO L290 TraceCheckUtils]: 13: Hoare triple {1826#false} assume !false; {1826#false} is VALID [2022-04-28 03:54:15,397 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:54:15,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:54:15,721 INFO L290 TraceCheckUtils]: 13: Hoare triple {1826#false} assume !false; {1826#false} is VALID [2022-04-28 03:54:15,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {1878#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1826#false} is VALID [2022-04-28 03:54:15,722 INFO L290 TraceCheckUtils]: 11: Hoare triple {1874#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1878#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:54:15,724 INFO L272 TraceCheckUtils]: 10: Hoare triple {1833#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {1874#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:54:15,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {1897#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [68] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1833#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:54:15,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {1901#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [71] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_129 v_main_~x~0_128)) (.cse1 (= v_main_~y~0_67 v_main_~y~0_66)) (.cse2 (<= 500000 v_main_~x~0_129))) (or (and .cse0 .cse1) (and (or (not (< v_main_~x~0_129 1000000)) (not .cse2)) .cse0 .cse1) (and (< v_main_~x~0_128 1000001) .cse2 (= (+ v_main_~x~0_128 v_main_~y~0_67) (+ v_main_~x~0_129 v_main_~y~0_66)) (< v_main_~x~0_129 v_main_~x~0_128)))) InVars {main_~x~0=v_main_~x~0_129, main_~y~0=v_main_~y~0_67} OutVars{main_~x~0=v_main_~x~0_128, main_~y~0=v_main_~y~0_66} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1897#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:15,726 INFO L290 TraceCheckUtils]: 7: Hoare triple {1901#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [70] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1901#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:15,727 INFO L290 TraceCheckUtils]: 6: Hoare triple {1908#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [69] L11-2-->L10-2_primed: Formula: (or (and (<= 500000 v_main_~x~0_127) (= v_main_~x~0_126 v_main_~x~0_127)) (= v_main_~x~0_127 v_main_~x~0_126) (and (< v_main_~x~0_126 500001) (< v_main_~x~0_127 v_main_~x~0_126))) InVars {main_~x~0=v_main_~x~0_127} OutVars{main_~x~0=v_main_~x~0_126} AuxVars[] AssignedVars[main_~x~0] {1901#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:15,728 INFO L290 TraceCheckUtils]: 5: Hoare triple {1825#true} ~x~0 := 0;~y~0 := 500000; {1908#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:54:15,728 INFO L272 TraceCheckUtils]: 4: Hoare triple {1825#true} call #t~ret4 := main(); {1825#true} is VALID [2022-04-28 03:54:15,728 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1825#true} {1825#true} #41#return; {1825#true} is VALID [2022-04-28 03:54:15,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {1825#true} assume true; {1825#true} is VALID [2022-04-28 03:54:15,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {1825#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(17, 2);call #Ultimate.allocInit(12, 3); {1825#true} is VALID [2022-04-28 03:54:15,728 INFO L272 TraceCheckUtils]: 0: Hoare triple {1825#true} call ULTIMATE.init(); {1825#true} is VALID [2022-04-28 03:54:15,728 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:54:15,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898847182] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:54:15,728 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:54:15,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 03:54:15,989 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:54:15,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1632537622] [2022-04-28 03:54:15,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1632537622] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:54:15,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:54:15,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 03:54:15,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497442450] [2022-04-28 03:54:15,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:54:15,990 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 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:54:15,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:54:15,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 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:54:16,021 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:54:16,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 03:54:16,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:16,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 03:54:16,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=504, Unknown=0, NotChecked=0, Total=650 [2022-04-28 03:54:16,023 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 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:54:16,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:16,621 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-04-28 03:54:16,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 03:54:16,622 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 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:54:16,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:54:16,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 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:54:16,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 43 transitions. [2022-04-28 03:54:16,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 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:54:16,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 43 transitions. [2022-04-28 03:54:16,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 43 transitions. [2022-04-28 03:54:16,656 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:54:16,657 INFO L225 Difference]: With dead ends: 38 [2022-04-28 03:54:16,657 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 03:54:16,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=947, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 03:54:16,658 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 23 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:54:16,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 68 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:54:16,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 03:54:16,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-28 03:54:16,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:54:16,707 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:16,708 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:16,708 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:16,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:16,713 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-28 03:54:16,713 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-28 03:54:16,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:16,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:16,713 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 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:54:16,714 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 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:54:16,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:16,715 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-28 03:54:16,715 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-28 03:54:16,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:16,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:16,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:54:16,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:54:16,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:16,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-28 03:54:16,716 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 27 [2022-04-28 03:54:16,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:54:16,716 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-28 03:54:16,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 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:54:16,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 34 transitions. [2022-04-28 03:54:16,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:54:16,743 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-28 03:54:16,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 03:54:16,744 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:54:16,744 INFO L195 NwaCegarLoop]: trace histogram [9, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:54:16,760 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:54:16,947 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:54:16,947 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:54:16,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:54:16,948 INFO L85 PathProgramCache]: Analyzing trace with hash 301485498, now seen corresponding path program 7 times [2022-04-28 03:54:16,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:16,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1759936050] [2022-04-28 03:54:21,000 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:54:21,045 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:54:21,256 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:54:21,257 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:54:21,259 INFO L85 PathProgramCache]: Analyzing trace with hash 15962543, now seen corresponding path program 1 times [2022-04-28 03:54:21,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:54:21,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286317722] [2022-04-28 03:54:21,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:21,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:54:21,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:21,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:54:21,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:21,354 INFO L290 TraceCheckUtils]: 0: Hoare triple {2166#(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(17, 2);call #Ultimate.allocInit(12, 3); {2155#true} is VALID [2022-04-28 03:54:21,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-28 03:54:21,354 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2155#true} {2155#true} #41#return; {2155#true} is VALID [2022-04-28 03:54:21,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {2155#true} call ULTIMATE.init(); {2166#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:54:21,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {2166#(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(17, 2);call #Ultimate.allocInit(12, 3); {2155#true} is VALID [2022-04-28 03:54:21,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-28 03:54:21,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2155#true} {2155#true} #41#return; {2155#true} is VALID [2022-04-28 03:54:21,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {2155#true} call #t~ret4 := main(); {2155#true} is VALID [2022-04-28 03:54:21,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {2155#true} ~x~0 := 0;~y~0 := 500000; {2160#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:54:21,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {2160#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [73] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_152 v_main_~x~0_151))) (or (and (< v_main_~x~0_152 v_main_~x~0_151) (< v_main_~x~0_151 500001)) (and (<= 500000 v_main_~x~0_152) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_152} OutVars{main_~x~0=v_main_~x~0_151} AuxVars[] AssignedVars[main_~x~0] {2161#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:54:21,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {2161#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [74] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2161#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:54:21,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {2161#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [75] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_154)) (.cse1 (= v_main_~x~0_154 v_main_~x~0_153)) (.cse2 (= v_main_~y~0_82 v_main_~y~0_81))) (or (and .cse0 (< v_main_~x~0_154 v_main_~x~0_153) (< v_main_~x~0_153 1000001) (= (+ v_main_~x~0_154 v_main_~y~0_81) (+ v_main_~x~0_153 v_main_~y~0_82))) (and .cse1 .cse2) (and (or (not .cse0) (not (< v_main_~x~0_154 1000000))) .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_154, main_~y~0=v_main_~y~0_82} OutVars{main_~x~0=v_main_~x~0_153, main_~y~0=v_main_~y~0_81} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {2162#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:21,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {2162#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [72] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2163#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:54:21,358 INFO L272 TraceCheckUtils]: 10: Hoare triple {2163#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {2164#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:54:21,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {2164#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2165#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:54:21,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {2165#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2156#false} is VALID [2022-04-28 03:54:21,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {2156#false} assume !false; {2156#false} is VALID [2022-04-28 03:54:21,359 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:54:21,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:54:21,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286317722] [2022-04-28 03:54:21,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286317722] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:54:21,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382841718] [2022-04-28 03:54:21,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:21,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:54:21,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:54:21,360 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:54:21,361 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:54:21,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:21,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:54:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:21,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:54:21,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {2155#true} call ULTIMATE.init(); {2155#true} is VALID [2022-04-28 03:54:21,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {2155#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(17, 2);call #Ultimate.allocInit(12, 3); {2155#true} is VALID [2022-04-28 03:54:21,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-28 03:54:21,730 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2155#true} {2155#true} #41#return; {2155#true} is VALID [2022-04-28 03:54:21,730 INFO L272 TraceCheckUtils]: 4: Hoare triple {2155#true} call #t~ret4 := main(); {2155#true} is VALID [2022-04-28 03:54:21,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {2155#true} ~x~0 := 0;~y~0 := 500000; {2185#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:54:21,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {2185#(and (<= main_~x~0 0) (= main_~y~0 500000))} [73] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_152 v_main_~x~0_151))) (or (and (< v_main_~x~0_152 v_main_~x~0_151) (< v_main_~x~0_151 500001)) (and (<= 500000 v_main_~x~0_152) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_152} OutVars{main_~x~0=v_main_~x~0_151} AuxVars[] AssignedVars[main_~x~0] {2189#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:54:21,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {2189#(and (= main_~y~0 500000) (< main_~x~0 500001))} [74] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2189#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:54:21,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {2189#(and (= main_~y~0 500000) (< main_~x~0 500001))} [75] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_154)) (.cse1 (= v_main_~x~0_154 v_main_~x~0_153)) (.cse2 (= v_main_~y~0_82 v_main_~y~0_81))) (or (and .cse0 (< v_main_~x~0_154 v_main_~x~0_153) (< v_main_~x~0_153 1000001) (= (+ v_main_~x~0_154 v_main_~y~0_81) (+ v_main_~x~0_153 v_main_~y~0_82))) (and .cse1 .cse2) (and (or (not .cse0) (not (< v_main_~x~0_154 1000000))) .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_154, main_~y~0=v_main_~y~0_82} OutVars{main_~x~0=v_main_~x~0_153, main_~y~0=v_main_~y~0_81} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {2196#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:21,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {2196#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [72] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2200#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:54:21,733 INFO L272 TraceCheckUtils]: 10: Hoare triple {2200#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {2204#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:54:21,734 INFO L290 TraceCheckUtils]: 11: Hoare triple {2204#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2208#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:54:21,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {2208#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2156#false} is VALID [2022-04-28 03:54:21,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {2156#false} assume !false; {2156#false} is VALID [2022-04-28 03:54:21,734 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:54:21,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:54:22,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {2156#false} assume !false; {2156#false} is VALID [2022-04-28 03:54:22,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {2208#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2156#false} is VALID [2022-04-28 03:54:22,054 INFO L290 TraceCheckUtils]: 11: Hoare triple {2204#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2208#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:54:22,055 INFO L272 TraceCheckUtils]: 10: Hoare triple {2163#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {2204#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:54:22,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {2227#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [72] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2163#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:54:22,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {2231#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [75] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_154)) (.cse1 (= v_main_~x~0_154 v_main_~x~0_153)) (.cse2 (= v_main_~y~0_82 v_main_~y~0_81))) (or (and .cse0 (< v_main_~x~0_154 v_main_~x~0_153) (< v_main_~x~0_153 1000001) (= (+ v_main_~x~0_154 v_main_~y~0_81) (+ v_main_~x~0_153 v_main_~y~0_82))) (and .cse1 .cse2) (and (or (not .cse0) (not (< v_main_~x~0_154 1000000))) .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_154, main_~y~0=v_main_~y~0_82} OutVars{main_~x~0=v_main_~x~0_153, main_~y~0=v_main_~y~0_81} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {2227#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:22,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {2231#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [74] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2231#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:22,058 INFO L290 TraceCheckUtils]: 6: Hoare triple {2238#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [73] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_152 v_main_~x~0_151))) (or (and (< v_main_~x~0_152 v_main_~x~0_151) (< v_main_~x~0_151 500001)) (and (<= 500000 v_main_~x~0_152) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_152} OutVars{main_~x~0=v_main_~x~0_151} AuxVars[] AssignedVars[main_~x~0] {2231#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:22,058 INFO L290 TraceCheckUtils]: 5: Hoare triple {2155#true} ~x~0 := 0;~y~0 := 500000; {2238#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:54:22,058 INFO L272 TraceCheckUtils]: 4: Hoare triple {2155#true} call #t~ret4 := main(); {2155#true} is VALID [2022-04-28 03:54:22,058 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2155#true} {2155#true} #41#return; {2155#true} is VALID [2022-04-28 03:54:22,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-28 03:54:22,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {2155#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(17, 2);call #Ultimate.allocInit(12, 3); {2155#true} is VALID [2022-04-28 03:54:22,058 INFO L272 TraceCheckUtils]: 0: Hoare triple {2155#true} call ULTIMATE.init(); {2155#true} is VALID [2022-04-28 03:54:22,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:54:22,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382841718] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:54:22,059 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:54:22,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 03:54:22,354 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:54:22,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1759936050] [2022-04-28 03:54:22,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1759936050] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:54:22,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:54:22,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 03:54:22,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182326418] [2022-04-28 03:54:22,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:54:22,355 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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:54:22,355 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:54:22,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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:54:22,375 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:54:22,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 03:54:22,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:22,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 03:54:22,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2022-04-28 03:54:22,375 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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:54:22,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:22,985 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-04-28 03:54:22,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 03:54:22,985 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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:54:22,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:54:22,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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:54:22,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 45 transitions. [2022-04-28 03:54:22,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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:54:22,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 45 transitions. [2022-04-28 03:54:22,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 45 transitions. [2022-04-28 03:54:23,021 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:54:23,022 INFO L225 Difference]: With dead ends: 40 [2022-04-28 03:54:23,022 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 03:54:23,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=262, Invalid=1070, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 03:54:23,023 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 25 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:54:23,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 68 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:54:23,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 03:54:23,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-28 03:54:23,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:54:23,076 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:23,077 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:23,077 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:23,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:23,077 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-28 03:54:23,077 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-28 03:54:23,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:23,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:23,078 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-28 03:54:23,078 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-28 03:54:23,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:23,078 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-28 03:54:23,078 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-28 03:54:23,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:23,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:23,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:54:23,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:54:23,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:23,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-04-28 03:54:23,079 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 29 [2022-04-28 03:54:23,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:54:23,079 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-04-28 03:54:23,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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:54:23,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 36 transitions. [2022-04-28 03:54:23,109 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:54:23,109 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-28 03:54:23,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 03:54:23,110 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:54:23,110 INFO L195 NwaCegarLoop]: trace histogram [10, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:54:23,125 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:54:23,319 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:54:23,319 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:54:23,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:54:23,320 INFO L85 PathProgramCache]: Analyzing trace with hash -2093779691, now seen corresponding path program 8 times [2022-04-28 03:54:23,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:23,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1209786235] [2022-04-28 03:54:23,419 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:54:27,526 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:54:27,622 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:54:27,623 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:54:27,625 INFO L85 PathProgramCache]: Analyzing trace with hash 2065494703, now seen corresponding path program 1 times [2022-04-28 03:54:27,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:54:27,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137357155] [2022-04-28 03:54:27,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:27,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:54:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:27,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:54:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:27,727 INFO L290 TraceCheckUtils]: 0: Hoare triple {2511#(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(17, 2);call #Ultimate.allocInit(12, 3); {2500#true} is VALID [2022-04-28 03:54:27,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {2500#true} assume true; {2500#true} is VALID [2022-04-28 03:54:27,728 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2500#true} {2500#true} #41#return; {2500#true} is VALID [2022-04-28 03:54:27,728 INFO L272 TraceCheckUtils]: 0: Hoare triple {2500#true} call ULTIMATE.init(); {2511#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:54:27,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {2511#(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(17, 2);call #Ultimate.allocInit(12, 3); {2500#true} is VALID [2022-04-28 03:54:27,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {2500#true} assume true; {2500#true} is VALID [2022-04-28 03:54:27,728 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2500#true} {2500#true} #41#return; {2500#true} is VALID [2022-04-28 03:54:27,728 INFO L272 TraceCheckUtils]: 4: Hoare triple {2500#true} call #t~ret4 := main(); {2500#true} is VALID [2022-04-28 03:54:27,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {2500#true} ~x~0 := 0;~y~0 := 500000; {2505#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:54:27,729 INFO L290 TraceCheckUtils]: 6: Hoare triple {2505#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [77] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_178 v_main_~x~0_177))) (or .cse0 (and (<= 500000 v_main_~x~0_178) .cse0) (and (< v_main_~x~0_177 500001) (< v_main_~x~0_178 v_main_~x~0_177)))) InVars {main_~x~0=v_main_~x~0_178} OutVars{main_~x~0=v_main_~x~0_177} AuxVars[] AssignedVars[main_~x~0] {2506#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:54:27,730 INFO L290 TraceCheckUtils]: 7: Hoare triple {2506#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [78] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2506#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:54:27,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {2506#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [79] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_180)) (.cse1 (= v_main_~x~0_180 v_main_~x~0_179)) (.cse2 (= v_main_~y~0_98 v_main_~y~0_97))) (or (and (< v_main_~x~0_180 v_main_~x~0_179) (= (+ v_main_~x~0_179 v_main_~y~0_98) (+ v_main_~x~0_180 v_main_~y~0_97)) (< v_main_~x~0_179 1000001) .cse0) (and .cse1 .cse2 (or (not (< v_main_~x~0_180 1000000)) (not .cse0))) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_180, main_~y~0=v_main_~y~0_98} OutVars{main_~x~0=v_main_~x~0_179, main_~y~0=v_main_~y~0_97} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {2507#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:54:27,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {2507#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [76] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2508#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-28 03:54:27,731 INFO L272 TraceCheckUtils]: 10: Hoare triple {2508#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {2509#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:54:27,732 INFO L290 TraceCheckUtils]: 11: Hoare triple {2509#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2510#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:54:27,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {2510#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2501#false} is VALID [2022-04-28 03:54:27,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {2501#false} assume !false; {2501#false} is VALID [2022-04-28 03:54:27,732 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:54:27,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:54:27,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137357155] [2022-04-28 03:54:27,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137357155] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:54:27,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502203784] [2022-04-28 03:54:27,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:27,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:54:27,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:54:27,734 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:54:27,735 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:54:27,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:27,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:54:27,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:27,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:54:28,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {2500#true} call ULTIMATE.init(); {2500#true} is VALID [2022-04-28 03:54:28,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {2500#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(17, 2);call #Ultimate.allocInit(12, 3); {2500#true} is VALID [2022-04-28 03:54:28,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {2500#true} assume true; {2500#true} is VALID [2022-04-28 03:54:28,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2500#true} {2500#true} #41#return; {2500#true} is VALID [2022-04-28 03:54:28,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {2500#true} call #t~ret4 := main(); {2500#true} is VALID [2022-04-28 03:54:28,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {2500#true} ~x~0 := 0;~y~0 := 500000; {2530#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:54:28,104 INFO L290 TraceCheckUtils]: 6: Hoare triple {2530#(and (<= main_~x~0 0) (= main_~y~0 500000))} [77] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_178 v_main_~x~0_177))) (or .cse0 (and (<= 500000 v_main_~x~0_178) .cse0) (and (< v_main_~x~0_177 500001) (< v_main_~x~0_178 v_main_~x~0_177)))) InVars {main_~x~0=v_main_~x~0_178} OutVars{main_~x~0=v_main_~x~0_177} AuxVars[] AssignedVars[main_~x~0] {2534#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:54:28,105 INFO L290 TraceCheckUtils]: 7: Hoare triple {2534#(and (= main_~y~0 500000) (< main_~x~0 500001))} [78] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2534#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:54:28,105 INFO L290 TraceCheckUtils]: 8: Hoare triple {2534#(and (= main_~y~0 500000) (< main_~x~0 500001))} [79] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_180)) (.cse1 (= v_main_~x~0_180 v_main_~x~0_179)) (.cse2 (= v_main_~y~0_98 v_main_~y~0_97))) (or (and (< v_main_~x~0_180 v_main_~x~0_179) (= (+ v_main_~x~0_179 v_main_~y~0_98) (+ v_main_~x~0_180 v_main_~y~0_97)) (< v_main_~x~0_179 1000001) .cse0) (and .cse1 .cse2 (or (not (< v_main_~x~0_180 1000000)) (not .cse0))) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_180, main_~y~0=v_main_~y~0_98} OutVars{main_~x~0=v_main_~x~0_179, main_~y~0=v_main_~y~0_97} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {2541#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:28,106 INFO L290 TraceCheckUtils]: 9: Hoare triple {2541#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [76] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2545#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:54:28,107 INFO L272 TraceCheckUtils]: 10: Hoare triple {2545#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {2549#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:54:28,107 INFO L290 TraceCheckUtils]: 11: Hoare triple {2549#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2553#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:54:28,107 INFO L290 TraceCheckUtils]: 12: Hoare triple {2553#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2501#false} is VALID [2022-04-28 03:54:28,107 INFO L290 TraceCheckUtils]: 13: Hoare triple {2501#false} assume !false; {2501#false} is VALID [2022-04-28 03:54:28,107 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:54:28,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:54:28,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {2501#false} assume !false; {2501#false} is VALID [2022-04-28 03:54:28,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {2553#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2501#false} is VALID [2022-04-28 03:54:28,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {2549#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2553#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:54:28,413 INFO L272 TraceCheckUtils]: 10: Hoare triple {2508#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {2549#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:54:28,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {2572#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [76] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2508#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-28 03:54:28,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {2576#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [79] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_180)) (.cse1 (= v_main_~x~0_180 v_main_~x~0_179)) (.cse2 (= v_main_~y~0_98 v_main_~y~0_97))) (or (and (< v_main_~x~0_180 v_main_~x~0_179) (= (+ v_main_~x~0_179 v_main_~y~0_98) (+ v_main_~x~0_180 v_main_~y~0_97)) (< v_main_~x~0_179 1000001) .cse0) (and .cse1 .cse2 (or (not (< v_main_~x~0_180 1000000)) (not .cse0))) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_180, main_~y~0=v_main_~y~0_98} OutVars{main_~x~0=v_main_~x~0_179, main_~y~0=v_main_~y~0_97} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {2572#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:54:28,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {2576#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [78] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2576#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:54:28,416 INFO L290 TraceCheckUtils]: 6: Hoare triple {2583#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} [77] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_178 v_main_~x~0_177))) (or .cse0 (and (<= 500000 v_main_~x~0_178) .cse0) (and (< v_main_~x~0_177 500001) (< v_main_~x~0_178 v_main_~x~0_177)))) InVars {main_~x~0=v_main_~x~0_178} OutVars{main_~x~0=v_main_~x~0_177} AuxVars[] AssignedVars[main_~x~0] {2576#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:54:28,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {2500#true} ~x~0 := 0;~y~0 := 500000; {2583#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:54:28,416 INFO L272 TraceCheckUtils]: 4: Hoare triple {2500#true} call #t~ret4 := main(); {2500#true} is VALID [2022-04-28 03:54:28,416 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2500#true} {2500#true} #41#return; {2500#true} is VALID [2022-04-28 03:54:28,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {2500#true} assume true; {2500#true} is VALID [2022-04-28 03:54:28,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {2500#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(17, 2);call #Ultimate.allocInit(12, 3); {2500#true} is VALID [2022-04-28 03:54:28,416 INFO L272 TraceCheckUtils]: 0: Hoare triple {2500#true} call ULTIMATE.init(); {2500#true} is VALID [2022-04-28 03:54:28,417 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:54:28,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502203784] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:54:28,417 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:54:28,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 03:54:28,756 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:54:28,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1209786235] [2022-04-28 03:54:28,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1209786235] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:54:28,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:54:28,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 03:54:28,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525646982] [2022-04-28 03:54:28,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:54:28,757 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 14 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:54:28,757 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:54:28,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 1.8) internal successors, (27), 14 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:54:28,778 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:54:28,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 03:54:28,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:28,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 03:54:28,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2022-04-28 03:54:28,779 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 14 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:54:29,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:29,493 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-28 03:54:29,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 03:54:29,493 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 14 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:54:29,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:54:29,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 14 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:54:29,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 47 transitions. [2022-04-28 03:54:29,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 14 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:54:29,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 47 transitions. [2022-04-28 03:54:29,495 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 47 transitions. [2022-04-28 03:54:29,536 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:54:29,537 INFO L225 Difference]: With dead ends: 42 [2022-04-28 03:54:29,537 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 03:54:29,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=281, Invalid=1201, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 03:54:29,538 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 27 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:54:29,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 78 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:54:29,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 03:54:29,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-28 03:54:29,598 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:54:29,598 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:29,599 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:29,599 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:29,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:29,599 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-04-28 03:54:29,599 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-04-28 03:54:29,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:29,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:29,600 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 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:54:29,600 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 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:54:29,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:29,600 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-04-28 03:54:29,601 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-04-28 03:54:29,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:29,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:29,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:54:29,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:54:29,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:29,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-04-28 03:54:29,601 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 31 [2022-04-28 03:54:29,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:54:29,602 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-04-28 03:54:29,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 14 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:54:29,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 38 transitions. [2022-04-28 03:54:29,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:54:29,633 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-04-28 03:54:29,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 03:54:29,634 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:54:29,634 INFO L195 NwaCegarLoop]: trace histogram [11, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:54:29,649 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:54:29,847 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:54:29,847 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:54:29,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:54:29,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1841155664, now seen corresponding path program 9 times [2022-04-28 03:54:29,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:29,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1843835380] [2022-04-28 03:54:29,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:54:30,123 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:54:30,124 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:54:30,126 INFO L85 PathProgramCache]: Analyzing trace with hash -179940433, now seen corresponding path program 1 times [2022-04-28 03:54:30,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:54:30,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314275950] [2022-04-28 03:54:30,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:30,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:54:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:30,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:54:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:30,252 INFO L290 TraceCheckUtils]: 0: Hoare triple {2871#(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(17, 2);call #Ultimate.allocInit(12, 3); {2860#true} is VALID [2022-04-28 03:54:30,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {2860#true} assume true; {2860#true} is VALID [2022-04-28 03:54:30,253 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2860#true} {2860#true} #41#return; {2860#true} is VALID [2022-04-28 03:54:30,253 INFO L272 TraceCheckUtils]: 0: Hoare triple {2860#true} call ULTIMATE.init(); {2871#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:54:30,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {2871#(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(17, 2);call #Ultimate.allocInit(12, 3); {2860#true} is VALID [2022-04-28 03:54:30,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {2860#true} assume true; {2860#true} is VALID [2022-04-28 03:54:30,253 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2860#true} {2860#true} #41#return; {2860#true} is VALID [2022-04-28 03:54:30,253 INFO L272 TraceCheckUtils]: 4: Hoare triple {2860#true} call #t~ret4 := main(); {2860#true} is VALID [2022-04-28 03:54:30,254 INFO L290 TraceCheckUtils]: 5: Hoare triple {2860#true} ~x~0 := 0;~y~0 := 500000; {2865#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:54:30,254 INFO L290 TraceCheckUtils]: 6: Hoare triple {2865#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [81] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_205 v_main_~x~0_204))) (or (and (< v_main_~x~0_205 v_main_~x~0_204) (< v_main_~x~0_204 500001)) (and (<= 500000 v_main_~x~0_205) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_205} OutVars{main_~x~0=v_main_~x~0_204} AuxVars[] AssignedVars[main_~x~0] {2866#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:54:30,255 INFO L290 TraceCheckUtils]: 7: Hoare triple {2866#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [82] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2866#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:54:30,255 INFO L290 TraceCheckUtils]: 8: Hoare triple {2866#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [83] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_207 v_main_~x~0_206)) (.cse1 (= v_main_~y~0_115 v_main_~y~0_114)) (.cse2 (<= 500000 v_main_~x~0_207))) (or (and .cse0 .cse1) (and .cse0 (or (not .cse2) (not (< v_main_~x~0_207 1000000))) .cse1) (let ((.cse3 (+ v_main_~x~0_207 v_main_~y~0_114))) (and (= .cse3 (+ v_main_~x~0_206 v_main_~y~0_115)) .cse2 (< v_main_~y~0_115 v_main_~y~0_114) (< .cse3 (+ v_main_~y~0_115 1000001)))))) InVars {main_~x~0=v_main_~x~0_207, main_~y~0=v_main_~y~0_115} OutVars{main_~x~0=v_main_~x~0_206, main_~y~0=v_main_~y~0_114} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {2867#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} is VALID [2022-04-28 03:54:30,256 INFO L290 TraceCheckUtils]: 9: Hoare triple {2867#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} [80] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2868#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:54:30,256 INFO L272 TraceCheckUtils]: 10: Hoare triple {2868#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {2869#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:54:30,257 INFO L290 TraceCheckUtils]: 11: Hoare triple {2869#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2870#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:54:30,257 INFO L290 TraceCheckUtils]: 12: Hoare triple {2870#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2861#false} is VALID [2022-04-28 03:54:30,257 INFO L290 TraceCheckUtils]: 13: Hoare triple {2861#false} assume !false; {2861#false} is VALID [2022-04-28 03:54:30,257 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:54:30,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:54:30,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314275950] [2022-04-28 03:54:30,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314275950] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:54:30,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097178816] [2022-04-28 03:54:30,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:30,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:54:30,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:54:30,259 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:54:30,259 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:54:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:30,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:54:30,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:30,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:54:30,646 INFO L272 TraceCheckUtils]: 0: Hoare triple {2860#true} call ULTIMATE.init(); {2860#true} is VALID [2022-04-28 03:54:30,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {2860#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(17, 2);call #Ultimate.allocInit(12, 3); {2860#true} is VALID [2022-04-28 03:54:30,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {2860#true} assume true; {2860#true} is VALID [2022-04-28 03:54:30,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2860#true} {2860#true} #41#return; {2860#true} is VALID [2022-04-28 03:54:30,647 INFO L272 TraceCheckUtils]: 4: Hoare triple {2860#true} call #t~ret4 := main(); {2860#true} is VALID [2022-04-28 03:54:30,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {2860#true} ~x~0 := 0;~y~0 := 500000; {2890#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:54:30,648 INFO L290 TraceCheckUtils]: 6: Hoare triple {2890#(and (<= main_~x~0 0) (= main_~y~0 500000))} [81] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_205 v_main_~x~0_204))) (or (and (< v_main_~x~0_205 v_main_~x~0_204) (< v_main_~x~0_204 500001)) (and (<= 500000 v_main_~x~0_205) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_205} OutVars{main_~x~0=v_main_~x~0_204} AuxVars[] AssignedVars[main_~x~0] {2894#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:54:30,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {2894#(and (= main_~y~0 500000) (< main_~x~0 500001))} [82] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2894#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:54:30,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {2894#(and (= main_~y~0 500000) (< main_~x~0 500001))} [83] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_207 v_main_~x~0_206)) (.cse1 (= v_main_~y~0_115 v_main_~y~0_114)) (.cse2 (<= 500000 v_main_~x~0_207))) (or (and .cse0 .cse1) (and .cse0 (or (not .cse2) (not (< v_main_~x~0_207 1000000))) .cse1) (let ((.cse3 (+ v_main_~x~0_207 v_main_~y~0_114))) (and (= .cse3 (+ v_main_~x~0_206 v_main_~y~0_115)) .cse2 (< v_main_~y~0_115 v_main_~y~0_114) (< .cse3 (+ v_main_~y~0_115 1000001)))))) InVars {main_~x~0=v_main_~x~0_207, main_~y~0=v_main_~y~0_115} OutVars{main_~x~0=v_main_~x~0_206, main_~y~0=v_main_~y~0_114} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {2901#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:30,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {2901#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [80] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2905#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:54:30,651 INFO L272 TraceCheckUtils]: 10: Hoare triple {2905#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {2909#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:54:30,651 INFO L290 TraceCheckUtils]: 11: Hoare triple {2909#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2913#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:54:30,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {2913#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2861#false} is VALID [2022-04-28 03:54:30,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {2861#false} assume !false; {2861#false} is VALID [2022-04-28 03:54:30,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:54:30,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:54:30,972 INFO L290 TraceCheckUtils]: 13: Hoare triple {2861#false} assume !false; {2861#false} is VALID [2022-04-28 03:54:30,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {2913#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2861#false} is VALID [2022-04-28 03:54:30,973 INFO L290 TraceCheckUtils]: 11: Hoare triple {2909#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2913#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:54:30,974 INFO L272 TraceCheckUtils]: 10: Hoare triple {2868#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {2909#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:54:30,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {2932#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [80] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2868#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:54:30,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {2936#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [83] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_207 v_main_~x~0_206)) (.cse1 (= v_main_~y~0_115 v_main_~y~0_114)) (.cse2 (<= 500000 v_main_~x~0_207))) (or (and .cse0 .cse1) (and .cse0 (or (not .cse2) (not (< v_main_~x~0_207 1000000))) .cse1) (let ((.cse3 (+ v_main_~x~0_207 v_main_~y~0_114))) (and (= .cse3 (+ v_main_~x~0_206 v_main_~y~0_115)) .cse2 (< v_main_~y~0_115 v_main_~y~0_114) (< .cse3 (+ v_main_~y~0_115 1000001)))))) InVars {main_~x~0=v_main_~x~0_207, main_~y~0=v_main_~y~0_115} OutVars{main_~x~0=v_main_~x~0_206, main_~y~0=v_main_~y~0_114} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {2932#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:30,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {2936#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [82] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2936#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:30,976 INFO L290 TraceCheckUtils]: 6: Hoare triple {2943#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [81] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_205 v_main_~x~0_204))) (or (and (< v_main_~x~0_205 v_main_~x~0_204) (< v_main_~x~0_204 500001)) (and (<= 500000 v_main_~x~0_205) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_205} OutVars{main_~x~0=v_main_~x~0_204} AuxVars[] AssignedVars[main_~x~0] {2936#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:30,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {2860#true} ~x~0 := 0;~y~0 := 500000; {2943#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:54:30,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {2860#true} call #t~ret4 := main(); {2860#true} is VALID [2022-04-28 03:54:30,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2860#true} {2860#true} #41#return; {2860#true} is VALID [2022-04-28 03:54:30,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {2860#true} assume true; {2860#true} is VALID [2022-04-28 03:54:30,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {2860#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(17, 2);call #Ultimate.allocInit(12, 3); {2860#true} is VALID [2022-04-28 03:54:30,984 INFO L272 TraceCheckUtils]: 0: Hoare triple {2860#true} call ULTIMATE.init(); {2860#true} is VALID [2022-04-28 03:54:30,984 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:54:30,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097178816] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:54:30,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:54:30,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 03:54:31,343 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:54:31,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1843835380] [2022-04-28 03:54:31,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1843835380] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:54:31,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:54:31,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 03:54:31,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608725613] [2022-04-28 03:54:31,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:54:31,344 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.8125) internal successors, (29), 15 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:54:31,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:54:31,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 1.8125) internal successors, (29), 15 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:54:31,366 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:54:31,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 03:54:31,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:31,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 03:54:31,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2022-04-28 03:54:31,367 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 17 states, 16 states have (on average 1.8125) internal successors, (29), 15 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:54:32,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:32,171 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-04-28 03:54:32,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 03:54:32,172 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.8125) internal successors, (29), 15 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:54:32,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:54:32,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.8125) internal successors, (29), 15 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:54:32,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 49 transitions. [2022-04-28 03:54:32,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.8125) internal successors, (29), 15 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:54:32,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 49 transitions. [2022-04-28 03:54:32,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 49 transitions. [2022-04-28 03:54:32,210 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:54:32,210 INFO L225 Difference]: With dead ends: 44 [2022-04-28 03:54:32,210 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 03:54:32,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=1340, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 03:54:32,211 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 29 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:54:32,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 73 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:54:32,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 03:54:32,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-28 03:54:32,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:54:32,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:32,275 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:32,276 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:32,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:32,276 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2022-04-28 03:54:32,276 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2022-04-28 03:54:32,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:32,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:32,277 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 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:54:32,277 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 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:54:32,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:32,277 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2022-04-28 03:54:32,277 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2022-04-28 03:54:32,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:32,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:32,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:54:32,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:54:32,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:32,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2022-04-28 03:54:32,278 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 33 [2022-04-28 03:54:32,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:54:32,278 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2022-04-28 03:54:32,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.8125) internal successors, (29), 15 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:54:32,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 40 transitions. [2022-04-28 03:54:32,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:54:32,315 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2022-04-28 03:54:32,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 03:54:32,315 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:54:32,315 INFO L195 NwaCegarLoop]: trace histogram [12, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:54:32,331 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:54:32,515 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:54:32,516 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:54:32,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:54:32,516 INFO L85 PathProgramCache]: Analyzing trace with hash 412365707, now seen corresponding path program 10 times [2022-04-28 03:54:32,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:32,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [396201227] [2022-04-28 03:54:32,594 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:54:32,784 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:54:32,785 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:54:32,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1869591727, now seen corresponding path program 1 times [2022-04-28 03:54:32,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:54:32,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896181802] [2022-04-28 03:54:32,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:32,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:54:32,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:32,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:54:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:32,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {3246#(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(17, 2);call #Ultimate.allocInit(12, 3); {3235#true} is VALID [2022-04-28 03:54:32,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {3235#true} assume true; {3235#true} is VALID [2022-04-28 03:54:32,910 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3235#true} {3235#true} #41#return; {3235#true} is VALID [2022-04-28 03:54:32,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {3235#true} call ULTIMATE.init(); {3246#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:54:32,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {3246#(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(17, 2);call #Ultimate.allocInit(12, 3); {3235#true} is VALID [2022-04-28 03:54:32,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {3235#true} assume true; {3235#true} is VALID [2022-04-28 03:54:32,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3235#true} {3235#true} #41#return; {3235#true} is VALID [2022-04-28 03:54:32,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {3235#true} call #t~ret4 := main(); {3235#true} is VALID [2022-04-28 03:54:32,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {3235#true} ~x~0 := 0;~y~0 := 500000; {3240#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:54:32,914 INFO L290 TraceCheckUtils]: 6: Hoare triple {3240#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [85] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_233 v_main_~x~0_232))) (or .cse0 (and (< v_main_~x~0_232 500001) (< v_main_~x~0_233 v_main_~x~0_232)) (and .cse0 (not (< v_main_~x~0_233 500000))))) InVars {main_~x~0=v_main_~x~0_233} OutVars{main_~x~0=v_main_~x~0_232} AuxVars[] AssignedVars[main_~x~0] {3241#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:54:32,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {3241#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [86] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3241#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:54:32,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {3241#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [87] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_235)) (.cse2 (= v_main_~x~0_235 v_main_~x~0_234)) (.cse3 (= v_main_~y~0_133 v_main_~y~0_132))) (or (let ((.cse1 (+ v_main_~x~0_235 v_main_~y~0_132))) (and (< v_main_~y~0_133 v_main_~y~0_132) .cse0 (= .cse1 (+ v_main_~x~0_234 v_main_~y~0_133)) (< .cse1 (+ v_main_~y~0_133 1000001)))) (and .cse2 .cse3) (and (or (not (< v_main_~x~0_235 1000000)) (not .cse0)) .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_235, main_~y~0=v_main_~y~0_133} OutVars{main_~x~0=v_main_~x~0_234, main_~y~0=v_main_~y~0_132} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {3242#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} is VALID [2022-04-28 03:54:32,915 INFO L290 TraceCheckUtils]: 9: Hoare triple {3242#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} [84] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {3243#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:54:32,916 INFO L272 TraceCheckUtils]: 10: Hoare triple {3243#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {3244#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:54:32,916 INFO L290 TraceCheckUtils]: 11: Hoare triple {3244#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3245#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:54:32,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {3245#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3236#false} is VALID [2022-04-28 03:54:32,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {3236#false} assume !false; {3236#false} is VALID [2022-04-28 03:54:32,917 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:54:32,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:54:32,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896181802] [2022-04-28 03:54:32,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896181802] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:54:32,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125749443] [2022-04-28 03:54:32,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:32,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:54:32,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:54:32,918 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:54:32,919 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:54:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:32,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:54:32,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:32,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:54:33,300 INFO L272 TraceCheckUtils]: 0: Hoare triple {3235#true} call ULTIMATE.init(); {3235#true} is VALID [2022-04-28 03:54:33,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {3235#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(17, 2);call #Ultimate.allocInit(12, 3); {3235#true} is VALID [2022-04-28 03:54:33,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {3235#true} assume true; {3235#true} is VALID [2022-04-28 03:54:33,300 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3235#true} {3235#true} #41#return; {3235#true} is VALID [2022-04-28 03:54:33,300 INFO L272 TraceCheckUtils]: 4: Hoare triple {3235#true} call #t~ret4 := main(); {3235#true} is VALID [2022-04-28 03:54:33,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {3235#true} ~x~0 := 0;~y~0 := 500000; {3265#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:54:33,302 INFO L290 TraceCheckUtils]: 6: Hoare triple {3265#(and (<= main_~x~0 0) (= main_~y~0 500000))} [85] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_233 v_main_~x~0_232))) (or .cse0 (and (< v_main_~x~0_232 500001) (< v_main_~x~0_233 v_main_~x~0_232)) (and .cse0 (not (< v_main_~x~0_233 500000))))) InVars {main_~x~0=v_main_~x~0_233} OutVars{main_~x~0=v_main_~x~0_232} AuxVars[] AssignedVars[main_~x~0] {3269#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:54:33,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {3269#(and (= main_~y~0 500000) (< main_~x~0 500001))} [86] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3269#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:54:33,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {3269#(and (= main_~y~0 500000) (< main_~x~0 500001))} [87] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_235)) (.cse2 (= v_main_~x~0_235 v_main_~x~0_234)) (.cse3 (= v_main_~y~0_133 v_main_~y~0_132))) (or (let ((.cse1 (+ v_main_~x~0_235 v_main_~y~0_132))) (and (< v_main_~y~0_133 v_main_~y~0_132) .cse0 (= .cse1 (+ v_main_~x~0_234 v_main_~y~0_133)) (< .cse1 (+ v_main_~y~0_133 1000001)))) (and .cse2 .cse3) (and (or (not (< v_main_~x~0_235 1000000)) (not .cse0)) .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_235, main_~y~0=v_main_~y~0_133} OutVars{main_~x~0=v_main_~x~0_234, main_~y~0=v_main_~y~0_132} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {3276#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:33,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {3276#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [84] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {3280#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:54:33,305 INFO L272 TraceCheckUtils]: 10: Hoare triple {3280#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {3284#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:54:33,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {3284#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3288#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:54:33,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {3288#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3236#false} is VALID [2022-04-28 03:54:33,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {3236#false} assume !false; {3236#false} is VALID [2022-04-28 03:54:33,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:54:33,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:54:33,592 INFO L290 TraceCheckUtils]: 13: Hoare triple {3236#false} assume !false; {3236#false} is VALID [2022-04-28 03:54:33,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {3288#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3236#false} is VALID [2022-04-28 03:54:33,593 INFO L290 TraceCheckUtils]: 11: Hoare triple {3284#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3288#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:54:33,593 INFO L272 TraceCheckUtils]: 10: Hoare triple {3243#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {3284#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:54:33,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {3307#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [84] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {3243#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:54:33,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {3311#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [87] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_235)) (.cse2 (= v_main_~x~0_235 v_main_~x~0_234)) (.cse3 (= v_main_~y~0_133 v_main_~y~0_132))) (or (let ((.cse1 (+ v_main_~x~0_235 v_main_~y~0_132))) (and (< v_main_~y~0_133 v_main_~y~0_132) .cse0 (= .cse1 (+ v_main_~x~0_234 v_main_~y~0_133)) (< .cse1 (+ v_main_~y~0_133 1000001)))) (and .cse2 .cse3) (and (or (not (< v_main_~x~0_235 1000000)) (not .cse0)) .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_235, main_~y~0=v_main_~y~0_133} OutVars{main_~x~0=v_main_~x~0_234, main_~y~0=v_main_~y~0_132} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {3307#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:33,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {3311#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [86] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3311#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:33,596 INFO L290 TraceCheckUtils]: 6: Hoare triple {3318#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [85] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_233 v_main_~x~0_232))) (or .cse0 (and (< v_main_~x~0_232 500001) (< v_main_~x~0_233 v_main_~x~0_232)) (and .cse0 (not (< v_main_~x~0_233 500000))))) InVars {main_~x~0=v_main_~x~0_233} OutVars{main_~x~0=v_main_~x~0_232} AuxVars[] AssignedVars[main_~x~0] {3311#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:33,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {3235#true} ~x~0 := 0;~y~0 := 500000; {3318#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:54:33,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {3235#true} call #t~ret4 := main(); {3235#true} is VALID [2022-04-28 03:54:33,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3235#true} {3235#true} #41#return; {3235#true} is VALID [2022-04-28 03:54:33,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {3235#true} assume true; {3235#true} is VALID [2022-04-28 03:54:33,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {3235#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(17, 2);call #Ultimate.allocInit(12, 3); {3235#true} is VALID [2022-04-28 03:54:33,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {3235#true} call ULTIMATE.init(); {3235#true} is VALID [2022-04-28 03:54:33,597 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:54:33,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125749443] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:54:33,597 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:54:33,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 03:54:33,980 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:54:33,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [396201227] [2022-04-28 03:54:33,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [396201227] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:54:33,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:54:33,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 03:54:33,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057288153] [2022-04-28 03:54:33,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:54:33,981 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 16 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:54:33,981 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:54:33,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 16 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:54:34,004 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:54:34,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 03:54:34,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:34,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 03:54:34,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=692, Unknown=0, NotChecked=0, Total=870 [2022-04-28 03:54:34,005 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 16 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:54:34,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:34,883 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-28 03:54:34,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 03:54:34,883 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 16 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:54:34,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:54:34,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 16 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:54:34,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 51 transitions. [2022-04-28 03:54:34,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 16 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:54:34,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 51 transitions. [2022-04-28 03:54:34,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 51 transitions. [2022-04-28 03:54:34,934 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:54:34,934 INFO L225 Difference]: With dead ends: 46 [2022-04-28 03:54:34,934 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 03:54:34,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=319, Invalid=1487, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 03:54:34,935 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 31 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:54:34,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 63 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:54:34,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 03:54:35,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-28 03:54:35,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:54:35,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:35,004 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:35,005 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:35,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:35,005 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-28 03:54:35,005 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-04-28 03:54:35,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:35,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:35,006 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-28 03:54:35,006 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-28 03:54:35,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:35,006 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-28 03:54:35,006 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-04-28 03:54:35,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:35,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:35,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:54:35,007 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:54:35,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:35,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2022-04-28 03:54:35,007 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 35 [2022-04-28 03:54:35,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:54:35,008 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2022-04-28 03:54:35,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 16 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:54:35,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 42 transitions. [2022-04-28 03:54:35,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:54:35,046 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-04-28 03:54:35,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 03:54:35,047 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:54:35,047 INFO L195 NwaCegarLoop]: trace histogram [13, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:54:35,062 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:54:35,247 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:54:35,247 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:54:35,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:54:35,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1382886054, now seen corresponding path program 11 times [2022-04-28 03:54:35,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:35,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1914193231] [2022-04-28 03:54:39,315 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:54:39,372 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:54:39,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:54:39,578 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:54:39,579 INFO L85 PathProgramCache]: Analyzing trace with hash -375843409, now seen corresponding path program 1 times [2022-04-28 03:54:39,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:54:39,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425341865] [2022-04-28 03:54:39,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:39,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:54:39,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:39,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:54:39,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:39,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {3636#(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(17, 2);call #Ultimate.allocInit(12, 3); {3625#true} is VALID [2022-04-28 03:54:39,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {3625#true} assume true; {3625#true} is VALID [2022-04-28 03:54:39,676 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3625#true} {3625#true} #41#return; {3625#true} is VALID [2022-04-28 03:54:39,676 INFO L272 TraceCheckUtils]: 0: Hoare triple {3625#true} call ULTIMATE.init(); {3636#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:54:39,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {3636#(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(17, 2);call #Ultimate.allocInit(12, 3); {3625#true} is VALID [2022-04-28 03:54:39,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {3625#true} assume true; {3625#true} is VALID [2022-04-28 03:54:39,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3625#true} {3625#true} #41#return; {3625#true} is VALID [2022-04-28 03:54:39,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {3625#true} call #t~ret4 := main(); {3625#true} is VALID [2022-04-28 03:54:39,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {3625#true} ~x~0 := 0;~y~0 := 500000; {3630#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:54:39,678 INFO L290 TraceCheckUtils]: 6: Hoare triple {3630#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [89] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_262 v_main_~x~0_261))) (or (and .cse0 (<= 500000 v_main_~x~0_262)) (and (< v_main_~x~0_262 v_main_~x~0_261) (< v_main_~x~0_261 500001)) .cse0)) InVars {main_~x~0=v_main_~x~0_262} OutVars{main_~x~0=v_main_~x~0_261} AuxVars[] AssignedVars[main_~x~0] {3631#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:54:39,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {3631#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [90] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3631#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:54:39,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {3631#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [91] L11-2-->L10-2_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_264)) (.cse0 (= v_main_~y~0_152 v_main_~y~0_151)) (.cse1 (= v_main_~x~0_264 v_main_~x~0_263))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_264 1000000)) (not .cse2))) (let ((.cse3 (+ v_main_~x~0_264 v_main_~y~0_151))) (and (= (+ v_main_~x~0_263 v_main_~y~0_152) .cse3) (< .cse3 (+ v_main_~y~0_152 1000001)) .cse2 (< v_main_~y~0_152 v_main_~y~0_151))) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_264, main_~y~0=v_main_~y~0_152} OutVars{main_~x~0=v_main_~x~0_263, main_~y~0=v_main_~y~0_151} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {3632#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:39,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {3632#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [88] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {3633#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:54:39,681 INFO L272 TraceCheckUtils]: 10: Hoare triple {3633#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {3634#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:54:39,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {3634#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3635#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:54:39,682 INFO L290 TraceCheckUtils]: 12: Hoare triple {3635#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3626#false} is VALID [2022-04-28 03:54:39,682 INFO L290 TraceCheckUtils]: 13: Hoare triple {3626#false} assume !false; {3626#false} is VALID [2022-04-28 03:54:39,682 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:54:39,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:54:39,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425341865] [2022-04-28 03:54:39,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425341865] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:54:39,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203507009] [2022-04-28 03:54:39,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:39,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:54:39,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:54:39,684 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:54:39,684 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:54:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:39,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:54:39,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:39,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:54:40,071 INFO L272 TraceCheckUtils]: 0: Hoare triple {3625#true} call ULTIMATE.init(); {3625#true} is VALID [2022-04-28 03:54:40,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {3625#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(17, 2);call #Ultimate.allocInit(12, 3); {3625#true} is VALID [2022-04-28 03:54:40,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {3625#true} assume true; {3625#true} is VALID [2022-04-28 03:54:40,071 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3625#true} {3625#true} #41#return; {3625#true} is VALID [2022-04-28 03:54:40,071 INFO L272 TraceCheckUtils]: 4: Hoare triple {3625#true} call #t~ret4 := main(); {3625#true} is VALID [2022-04-28 03:54:40,072 INFO L290 TraceCheckUtils]: 5: Hoare triple {3625#true} ~x~0 := 0;~y~0 := 500000; {3655#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:54:40,072 INFO L290 TraceCheckUtils]: 6: Hoare triple {3655#(and (<= main_~x~0 0) (= main_~y~0 500000))} [89] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_262 v_main_~x~0_261))) (or (and .cse0 (<= 500000 v_main_~x~0_262)) (and (< v_main_~x~0_262 v_main_~x~0_261) (< v_main_~x~0_261 500001)) .cse0)) InVars {main_~x~0=v_main_~x~0_262} OutVars{main_~x~0=v_main_~x~0_261} AuxVars[] AssignedVars[main_~x~0] {3659#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:54:40,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {3659#(and (= main_~y~0 500000) (< main_~x~0 500001))} [90] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3659#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:54:40,073 INFO L290 TraceCheckUtils]: 8: Hoare triple {3659#(and (= main_~y~0 500000) (< main_~x~0 500001))} [91] L11-2-->L10-2_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_264)) (.cse0 (= v_main_~y~0_152 v_main_~y~0_151)) (.cse1 (= v_main_~x~0_264 v_main_~x~0_263))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_264 1000000)) (not .cse2))) (let ((.cse3 (+ v_main_~x~0_264 v_main_~y~0_151))) (and (= (+ v_main_~x~0_263 v_main_~y~0_152) .cse3) (< .cse3 (+ v_main_~y~0_152 1000001)) .cse2 (< v_main_~y~0_152 v_main_~y~0_151))) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_264, main_~y~0=v_main_~y~0_152} OutVars{main_~x~0=v_main_~x~0_263, main_~y~0=v_main_~y~0_151} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {3666#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:40,074 INFO L290 TraceCheckUtils]: 9: Hoare triple {3666#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [88] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {3670#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:54:40,074 INFO L272 TraceCheckUtils]: 10: Hoare triple {3670#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {3674#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:54:40,075 INFO L290 TraceCheckUtils]: 11: Hoare triple {3674#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3678#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:54:40,075 INFO L290 TraceCheckUtils]: 12: Hoare triple {3678#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3626#false} is VALID [2022-04-28 03:54:40,075 INFO L290 TraceCheckUtils]: 13: Hoare triple {3626#false} assume !false; {3626#false} is VALID [2022-04-28 03:54:40,075 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:54:40,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:54:40,370 INFO L290 TraceCheckUtils]: 13: Hoare triple {3626#false} assume !false; {3626#false} is VALID [2022-04-28 03:54:40,370 INFO L290 TraceCheckUtils]: 12: Hoare triple {3678#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3626#false} is VALID [2022-04-28 03:54:40,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {3674#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3678#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:54:40,371 INFO L272 TraceCheckUtils]: 10: Hoare triple {3633#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {3674#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:54:40,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {3632#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [88] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {3633#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:54:40,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {3700#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [91] L11-2-->L10-2_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_264)) (.cse0 (= v_main_~y~0_152 v_main_~y~0_151)) (.cse1 (= v_main_~x~0_264 v_main_~x~0_263))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_264 1000000)) (not .cse2))) (let ((.cse3 (+ v_main_~x~0_264 v_main_~y~0_151))) (and (= (+ v_main_~x~0_263 v_main_~y~0_152) .cse3) (< .cse3 (+ v_main_~y~0_152 1000001)) .cse2 (< v_main_~y~0_152 v_main_~y~0_151))) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_264, main_~y~0=v_main_~y~0_152} OutVars{main_~x~0=v_main_~x~0_263, main_~y~0=v_main_~y~0_151} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {3632#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:40,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {3700#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [90] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3700#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:40,373 INFO L290 TraceCheckUtils]: 6: Hoare triple {3707#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [89] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_262 v_main_~x~0_261))) (or (and .cse0 (<= 500000 v_main_~x~0_262)) (and (< v_main_~x~0_262 v_main_~x~0_261) (< v_main_~x~0_261 500001)) .cse0)) InVars {main_~x~0=v_main_~x~0_262} OutVars{main_~x~0=v_main_~x~0_261} AuxVars[] AssignedVars[main_~x~0] {3700#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:40,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {3625#true} ~x~0 := 0;~y~0 := 500000; {3707#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:40,374 INFO L272 TraceCheckUtils]: 4: Hoare triple {3625#true} call #t~ret4 := main(); {3625#true} is VALID [2022-04-28 03:54:40,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3625#true} {3625#true} #41#return; {3625#true} is VALID [2022-04-28 03:54:40,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {3625#true} assume true; {3625#true} is VALID [2022-04-28 03:54:40,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {3625#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(17, 2);call #Ultimate.allocInit(12, 3); {3625#true} is VALID [2022-04-28 03:54:40,374 INFO L272 TraceCheckUtils]: 0: Hoare triple {3625#true} call ULTIMATE.init(); {3625#true} is VALID [2022-04-28 03:54:40,374 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:54:40,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203507009] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:54:40,375 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:54:40,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:54:40,792 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:54:40,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1914193231] [2022-04-28 03:54:40,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1914193231] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:54:40,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:54:40,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 03:54:40,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482802481] [2022-04-28 03:54:40,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:54:40,793 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 17 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:54:40,793 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:54:40,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 17 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:54:40,818 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:54:40,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 03:54:40,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:40,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 03:54:40,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=709, Unknown=0, NotChecked=0, Total=870 [2022-04-28 03:54:40,818 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 17 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:54:41,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:41,805 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-04-28 03:54:41,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 03:54:41,806 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 17 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:54:41,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:54:41,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 17 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:54:41,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 53 transitions. [2022-04-28 03:54:41,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 17 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:54:41,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 53 transitions. [2022-04-28 03:54:41,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 53 transitions. [2022-04-28 03:54:41,854 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:54:41,854 INFO L225 Difference]: With dead ends: 48 [2022-04-28 03:54:41,854 INFO L226 Difference]: Without dead ends: 41 [2022-04-28 03:54:41,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=299, Invalid=1593, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 03:54:41,855 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 33 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:54:41,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 63 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 03:54:41,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-28 03:54:41,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-28 03:54:41,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:54:41,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:41,937 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:41,937 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:41,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:41,938 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2022-04-28 03:54:41,938 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2022-04-28 03:54:41,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:41,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:41,938 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 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:54:41,938 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 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:54:41,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:41,939 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2022-04-28 03:54:41,939 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2022-04-28 03:54:41,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:41,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:41,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:54:41,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:54:41,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:41,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2022-04-28 03:54:41,940 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 37 [2022-04-28 03:54:41,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:54:41,940 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2022-04-28 03:54:41,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 17 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:54:41,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 44 transitions. [2022-04-28 03:54:41,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:54:41,980 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2022-04-28 03:54:41,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 03:54:41,981 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:54:41,981 INFO L195 NwaCegarLoop]: trace histogram [14, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:54:41,997 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:54:42,181 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:54:42,181 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:54:42,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:54:42,182 INFO L85 PathProgramCache]: Analyzing trace with hash 2045036289, now seen corresponding path program 12 times [2022-04-28 03:54:42,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:42,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [637407351] [2022-04-28 03:54:46,234 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:54:46,273 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:54:46,477 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:54:46,478 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:54:46,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1673688751, now seen corresponding path program 1 times [2022-04-28 03:54:46,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:54:46,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953118172] [2022-04-28 03:54:46,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:46,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:54:46,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:46,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:54:46,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:46,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {4040#(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(17, 2);call #Ultimate.allocInit(12, 3); {4029#true} is VALID [2022-04-28 03:54:46,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {4029#true} assume true; {4029#true} is VALID [2022-04-28 03:54:46,562 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4029#true} {4029#true} #41#return; {4029#true} is VALID [2022-04-28 03:54:46,562 INFO L272 TraceCheckUtils]: 0: Hoare triple {4029#true} call ULTIMATE.init(); {4040#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:54:46,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {4040#(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(17, 2);call #Ultimate.allocInit(12, 3); {4029#true} is VALID [2022-04-28 03:54:46,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {4029#true} assume true; {4029#true} is VALID [2022-04-28 03:54:46,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4029#true} {4029#true} #41#return; {4029#true} is VALID [2022-04-28 03:54:46,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {4029#true} call #t~ret4 := main(); {4029#true} is VALID [2022-04-28 03:54:46,563 INFO L290 TraceCheckUtils]: 5: Hoare triple {4029#true} ~x~0 := 0;~y~0 := 500000; {4034#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:54:46,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {4034#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [93] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_292 v_main_~x~0_291))) (or (and (< v_main_~x~0_292 v_main_~x~0_291) (< v_main_~x~0_291 500001)) .cse0 (and .cse0 (<= 500000 v_main_~x~0_292)))) InVars {main_~x~0=v_main_~x~0_292} OutVars{main_~x~0=v_main_~x~0_291} AuxVars[] AssignedVars[main_~x~0] {4035#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:54:46,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {4035#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [94] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4035#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:54:46,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {4035#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [95] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_172 v_main_~y~0_171)) (.cse1 (= v_main_~x~0_294 v_main_~x~0_293)) (.cse2 (<= 500000 v_main_~x~0_294))) (or (and .cse0 .cse1) (and (< v_main_~x~0_293 1000001) .cse2 (= (+ v_main_~x~0_294 v_main_~y~0_171) (+ v_main_~x~0_293 v_main_~y~0_172)) (< v_main_~x~0_294 v_main_~x~0_293)) (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_294 1000000)))))) InVars {main_~x~0=v_main_~x~0_294, main_~y~0=v_main_~y~0_172} OutVars{main_~x~0=v_main_~x~0_293, main_~y~0=v_main_~y~0_171} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {4036#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:54:46,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {4036#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [92] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {4037#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-28 03:54:46,566 INFO L272 TraceCheckUtils]: 10: Hoare triple {4037#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {4038#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:54:46,566 INFO L290 TraceCheckUtils]: 11: Hoare triple {4038#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4039#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:54:46,567 INFO L290 TraceCheckUtils]: 12: Hoare triple {4039#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4030#false} is VALID [2022-04-28 03:54:46,567 INFO L290 TraceCheckUtils]: 13: Hoare triple {4030#false} assume !false; {4030#false} is VALID [2022-04-28 03:54:46,567 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:54:46,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:54:46,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953118172] [2022-04-28 03:54:46,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953118172] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:54:46,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980747640] [2022-04-28 03:54:46,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:46,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:54:46,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:54:46,568 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:54:46,569 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:54:46,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:46,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:54:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:46,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:54:46,939 INFO L272 TraceCheckUtils]: 0: Hoare triple {4029#true} call ULTIMATE.init(); {4029#true} is VALID [2022-04-28 03:54:46,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {4029#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(17, 2);call #Ultimate.allocInit(12, 3); {4029#true} is VALID [2022-04-28 03:54:46,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {4029#true} assume true; {4029#true} is VALID [2022-04-28 03:54:46,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4029#true} {4029#true} #41#return; {4029#true} is VALID [2022-04-28 03:54:46,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {4029#true} call #t~ret4 := main(); {4029#true} is VALID [2022-04-28 03:54:46,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {4029#true} ~x~0 := 0;~y~0 := 500000; {4059#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:54:46,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {4059#(and (<= main_~x~0 0) (= main_~y~0 500000))} [93] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_292 v_main_~x~0_291))) (or (and (< v_main_~x~0_292 v_main_~x~0_291) (< v_main_~x~0_291 500001)) .cse0 (and .cse0 (<= 500000 v_main_~x~0_292)))) InVars {main_~x~0=v_main_~x~0_292} OutVars{main_~x~0=v_main_~x~0_291} AuxVars[] AssignedVars[main_~x~0] {4063#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:54:46,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {4063#(and (= main_~y~0 500000) (< main_~x~0 500001))} [94] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4063#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:54:46,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {4063#(and (= main_~y~0 500000) (< main_~x~0 500001))} [95] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_172 v_main_~y~0_171)) (.cse1 (= v_main_~x~0_294 v_main_~x~0_293)) (.cse2 (<= 500000 v_main_~x~0_294))) (or (and .cse0 .cse1) (and (< v_main_~x~0_293 1000001) .cse2 (= (+ v_main_~x~0_294 v_main_~y~0_171) (+ v_main_~x~0_293 v_main_~y~0_172)) (< v_main_~x~0_294 v_main_~x~0_293)) (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_294 1000000)))))) InVars {main_~x~0=v_main_~x~0_294, main_~y~0=v_main_~y~0_172} OutVars{main_~x~0=v_main_~x~0_293, main_~y~0=v_main_~y~0_171} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {4070#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:46,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {4070#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [92] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {4074#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:54:46,944 INFO L272 TraceCheckUtils]: 10: Hoare triple {4074#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {4078#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:54:46,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {4078#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4082#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:54:46,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {4082#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4030#false} is VALID [2022-04-28 03:54:46,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {4030#false} assume !false; {4030#false} is VALID [2022-04-28 03:54:46,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:54:46,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:54:47,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {4030#false} assume !false; {4030#false} is VALID [2022-04-28 03:54:47,261 INFO L290 TraceCheckUtils]: 12: Hoare triple {4082#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4030#false} is VALID [2022-04-28 03:54:47,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {4078#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4082#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:54:47,262 INFO L272 TraceCheckUtils]: 10: Hoare triple {4037#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {4078#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:54:47,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {4101#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [92] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {4037#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-28 03:54:47,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {4105#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [95] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_172 v_main_~y~0_171)) (.cse1 (= v_main_~x~0_294 v_main_~x~0_293)) (.cse2 (<= 500000 v_main_~x~0_294))) (or (and .cse0 .cse1) (and (< v_main_~x~0_293 1000001) .cse2 (= (+ v_main_~x~0_294 v_main_~y~0_171) (+ v_main_~x~0_293 v_main_~y~0_172)) (< v_main_~x~0_294 v_main_~x~0_293)) (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_294 1000000)))))) InVars {main_~x~0=v_main_~x~0_294, main_~y~0=v_main_~y~0_172} OutVars{main_~x~0=v_main_~x~0_293, main_~y~0=v_main_~y~0_171} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {4101#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:54:47,264 INFO L290 TraceCheckUtils]: 7: Hoare triple {4105#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [94] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4105#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:54:47,264 INFO L290 TraceCheckUtils]: 6: Hoare triple {4112#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} [93] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_292 v_main_~x~0_291))) (or (and (< v_main_~x~0_292 v_main_~x~0_291) (< v_main_~x~0_291 500001)) .cse0 (and .cse0 (<= 500000 v_main_~x~0_292)))) InVars {main_~x~0=v_main_~x~0_292} OutVars{main_~x~0=v_main_~x~0_291} AuxVars[] AssignedVars[main_~x~0] {4105#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:54:47,265 INFO L290 TraceCheckUtils]: 5: Hoare triple {4029#true} ~x~0 := 0;~y~0 := 500000; {4112#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:54:47,265 INFO L272 TraceCheckUtils]: 4: Hoare triple {4029#true} call #t~ret4 := main(); {4029#true} is VALID [2022-04-28 03:54:47,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4029#true} {4029#true} #41#return; {4029#true} is VALID [2022-04-28 03:54:47,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {4029#true} assume true; {4029#true} is VALID [2022-04-28 03:54:47,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {4029#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(17, 2);call #Ultimate.allocInit(12, 3); {4029#true} is VALID [2022-04-28 03:54:47,265 INFO L272 TraceCheckUtils]: 0: Hoare triple {4029#true} call ULTIMATE.init(); {4029#true} is VALID [2022-04-28 03:54:47,265 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:54:47,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980747640] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:54:47,265 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:54:47,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 03:54:47,739 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:54:47,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [637407351] [2022-04-28 03:54:47,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [637407351] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:54:47,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:54:47,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 03:54:47,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160192478] [2022-04-28 03:54:47,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:54:47,739 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 18 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:54:47,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:54:47,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 18 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:54:47,765 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:54:47,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 03:54:47,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:47,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 03:54:47,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=798, Unknown=0, NotChecked=0, Total=992 [2022-04-28 03:54:47,766 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 18 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:54:48,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:48,722 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2022-04-28 03:54:48,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 03:54:48,722 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 18 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:54:48,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:54:48,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 18 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:54:48,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 55 transitions. [2022-04-28 03:54:48,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 18 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:54:48,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 55 transitions. [2022-04-28 03:54:48,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 55 transitions. [2022-04-28 03:54:48,772 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:54:48,773 INFO L225 Difference]: With dead ends: 50 [2022-04-28 03:54:48,773 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 03:54:48,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=357, Invalid=1805, Unknown=0, NotChecked=0, Total=2162 [2022-04-28 03:54:48,774 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 35 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:54:48,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 43 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:54:48,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 03:54:48,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-28 03:54:48,854 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:54:48,854 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:48,854 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:48,854 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:48,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:48,855 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2022-04-28 03:54:48,855 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2022-04-28 03:54:48,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:48,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:48,855 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 3 states have call successors, (3), 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:54:48,855 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 3 states have call successors, (3), 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:54:48,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:48,856 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2022-04-28 03:54:48,856 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2022-04-28 03:54:48,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:48,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:48,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:54:48,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:54:48,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:48,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2022-04-28 03:54:48,857 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 39 [2022-04-28 03:54:48,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:54:48,857 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2022-04-28 03:54:48,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 18 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:54:48,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 46 transitions. [2022-04-28 03:54:48,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:54:48,904 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2022-04-28 03:54:48,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 03:54:48,904 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:54:48,905 INFO L195 NwaCegarLoop]: trace histogram [15, 13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:54:48,920 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:54:49,119 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:54:49,119 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:54:49,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:54:49,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1578714980, now seen corresponding path program 13 times [2022-04-28 03:54:49,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:49,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [710955804] [2022-04-28 03:54:53,173 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:54:53,213 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:54:53,417 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:54:53,418 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:54:53,420 INFO L85 PathProgramCache]: Analyzing trace with hash -571746385, now seen corresponding path program 1 times [2022-04-28 03:54:53,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:54:53,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393028364] [2022-04-28 03:54:53,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:53,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:54:53,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:53,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:54:53,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:53,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {4460#(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(17, 2);call #Ultimate.allocInit(12, 3); {4449#true} is VALID [2022-04-28 03:54:53,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {4449#true} assume true; {4449#true} is VALID [2022-04-28 03:54:53,508 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4449#true} {4449#true} #41#return; {4449#true} is VALID [2022-04-28 03:54:53,508 INFO L272 TraceCheckUtils]: 0: Hoare triple {4449#true} call ULTIMATE.init(); {4460#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:54:53,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {4460#(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(17, 2);call #Ultimate.allocInit(12, 3); {4449#true} is VALID [2022-04-28 03:54:53,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {4449#true} assume true; {4449#true} is VALID [2022-04-28 03:54:53,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4449#true} {4449#true} #41#return; {4449#true} is VALID [2022-04-28 03:54:53,509 INFO L272 TraceCheckUtils]: 4: Hoare triple {4449#true} call #t~ret4 := main(); {4449#true} is VALID [2022-04-28 03:54:53,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {4449#true} ~x~0 := 0;~y~0 := 500000; {4454#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:54:53,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {4454#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [97] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_323 v_main_~x~0_322))) (or .cse0 (and (< v_main_~x~0_322 500001) (< v_main_~x~0_323 v_main_~x~0_322)) (and .cse0 (<= 500000 v_main_~x~0_323)))) InVars {main_~x~0=v_main_~x~0_323} OutVars{main_~x~0=v_main_~x~0_322} AuxVars[] AssignedVars[main_~x~0] {4455#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:54:53,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {4455#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [98] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4455#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:54:53,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {4455#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [99] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~y~0_193 v_main_~y~0_192)) (.cse0 (<= 500000 v_main_~x~0_325))) (or (and (< v_main_~x~0_324 1000001) (< v_main_~x~0_325 v_main_~x~0_324) .cse0 (= (+ v_main_~x~0_325 v_main_~y~0_192) (+ v_main_~x~0_324 v_main_~y~0_193))) (and .cse1 (= v_main_~x~0_325 v_main_~x~0_324)) (and .cse1 (= v_main_~x~0_324 v_main_~x~0_325) (or (not .cse0) (not (< v_main_~x~0_325 1000000)))))) InVars {main_~x~0=v_main_~x~0_325, main_~y~0=v_main_~y~0_193} OutVars{main_~x~0=v_main_~x~0_324, main_~y~0=v_main_~y~0_192} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {4456#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:53,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {4456#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [96] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {4457#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:54:53,512 INFO L272 TraceCheckUtils]: 10: Hoare triple {4457#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {4458#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:54:53,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {4458#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4459#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:54:53,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {4459#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4450#false} is VALID [2022-04-28 03:54:53,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {4450#false} assume !false; {4450#false} is VALID [2022-04-28 03:54:53,512 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:54:53,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:54:53,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393028364] [2022-04-28 03:54:53,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393028364] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:54:53,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730748717] [2022-04-28 03:54:53,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:53,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:54:53,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:54:53,514 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:54:53,514 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:54:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:53,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:54:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:53,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:54:53,903 INFO L272 TraceCheckUtils]: 0: Hoare triple {4449#true} call ULTIMATE.init(); {4449#true} is VALID [2022-04-28 03:54:53,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {4449#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(17, 2);call #Ultimate.allocInit(12, 3); {4449#true} is VALID [2022-04-28 03:54:53,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {4449#true} assume true; {4449#true} is VALID [2022-04-28 03:54:53,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4449#true} {4449#true} #41#return; {4449#true} is VALID [2022-04-28 03:54:53,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {4449#true} call #t~ret4 := main(); {4449#true} is VALID [2022-04-28 03:54:53,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {4449#true} ~x~0 := 0;~y~0 := 500000; {4479#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:54:53,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {4479#(and (<= main_~x~0 0) (= main_~y~0 500000))} [97] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_323 v_main_~x~0_322))) (or .cse0 (and (< v_main_~x~0_322 500001) (< v_main_~x~0_323 v_main_~x~0_322)) (and .cse0 (<= 500000 v_main_~x~0_323)))) InVars {main_~x~0=v_main_~x~0_323} OutVars{main_~x~0=v_main_~x~0_322} AuxVars[] AssignedVars[main_~x~0] {4483#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:54:53,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {4483#(and (= main_~y~0 500000) (< main_~x~0 500001))} [98] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4483#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:54:53,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {4483#(and (= main_~y~0 500000) (< main_~x~0 500001))} [99] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~y~0_193 v_main_~y~0_192)) (.cse0 (<= 500000 v_main_~x~0_325))) (or (and (< v_main_~x~0_324 1000001) (< v_main_~x~0_325 v_main_~x~0_324) .cse0 (= (+ v_main_~x~0_325 v_main_~y~0_192) (+ v_main_~x~0_324 v_main_~y~0_193))) (and .cse1 (= v_main_~x~0_325 v_main_~x~0_324)) (and .cse1 (= v_main_~x~0_324 v_main_~x~0_325) (or (not .cse0) (not (< v_main_~x~0_325 1000000)))))) InVars {main_~x~0=v_main_~x~0_325, main_~y~0=v_main_~y~0_193} OutVars{main_~x~0=v_main_~x~0_324, main_~y~0=v_main_~y~0_192} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {4490#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:53,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {4490#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [96] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {4494#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:54:53,907 INFO L272 TraceCheckUtils]: 10: Hoare triple {4494#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {4498#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:54:53,908 INFO L290 TraceCheckUtils]: 11: Hoare triple {4498#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4502#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:54:53,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {4502#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4450#false} is VALID [2022-04-28 03:54:53,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {4450#false} assume !false; {4450#false} is VALID [2022-04-28 03:54:53,908 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:54:53,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:54:54,220 INFO L290 TraceCheckUtils]: 13: Hoare triple {4450#false} assume !false; {4450#false} is VALID [2022-04-28 03:54:54,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {4502#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4450#false} is VALID [2022-04-28 03:54:54,220 INFO L290 TraceCheckUtils]: 11: Hoare triple {4498#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4502#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:54:54,221 INFO L272 TraceCheckUtils]: 10: Hoare triple {4457#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {4498#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:54:54,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {4521#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [96] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {4457#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:54:54,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {4525#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [99] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~y~0_193 v_main_~y~0_192)) (.cse0 (<= 500000 v_main_~x~0_325))) (or (and (< v_main_~x~0_324 1000001) (< v_main_~x~0_325 v_main_~x~0_324) .cse0 (= (+ v_main_~x~0_325 v_main_~y~0_192) (+ v_main_~x~0_324 v_main_~y~0_193))) (and .cse1 (= v_main_~x~0_325 v_main_~x~0_324)) (and .cse1 (= v_main_~x~0_324 v_main_~x~0_325) (or (not .cse0) (not (< v_main_~x~0_325 1000000)))))) InVars {main_~x~0=v_main_~x~0_325, main_~y~0=v_main_~y~0_193} OutVars{main_~x~0=v_main_~x~0_324, main_~y~0=v_main_~y~0_192} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {4521#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:54,223 INFO L290 TraceCheckUtils]: 7: Hoare triple {4525#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [98] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4525#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:54,224 INFO L290 TraceCheckUtils]: 6: Hoare triple {4532#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [97] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_323 v_main_~x~0_322))) (or .cse0 (and (< v_main_~x~0_322 500001) (< v_main_~x~0_323 v_main_~x~0_322)) (and .cse0 (<= 500000 v_main_~x~0_323)))) InVars {main_~x~0=v_main_~x~0_323} OutVars{main_~x~0=v_main_~x~0_322} AuxVars[] AssignedVars[main_~x~0] {4525#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:54,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {4449#true} ~x~0 := 0;~y~0 := 500000; {4532#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:54,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {4449#true} call #t~ret4 := main(); {4449#true} is VALID [2022-04-28 03:54:54,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4449#true} {4449#true} #41#return; {4449#true} is VALID [2022-04-28 03:54:54,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {4449#true} assume true; {4449#true} is VALID [2022-04-28 03:54:54,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {4449#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(17, 2);call #Ultimate.allocInit(12, 3); {4449#true} is VALID [2022-04-28 03:54:54,224 INFO L272 TraceCheckUtils]: 0: Hoare triple {4449#true} call ULTIMATE.init(); {4449#true} is VALID [2022-04-28 03:54:54,225 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:54:54,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730748717] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:54:54,225 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:54:54,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 03:54:54,734 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:54:54,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [710955804] [2022-04-28 03:54:54,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [710955804] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:54:54,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:54:54,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 03:54:54,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791607778] [2022-04-28 03:54:54,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:54:54,735 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.85) internal successors, (37), 19 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:54:54,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:54:54,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 20 states have (on average 1.85) internal successors, (37), 19 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:54:54,763 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:54:54,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 03:54:54,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:54,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 03:54:54,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=854, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 03:54:54,764 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand has 21 states, 20 states have (on average 1.85) internal successors, (37), 19 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:54:56,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:56,084 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2022-04-28 03:54:56,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 03:54:56,084 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.85) internal successors, (37), 19 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:54:56,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:54:56,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.85) internal successors, (37), 19 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:54:56,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 57 transitions. [2022-04-28 03:54:56,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.85) internal successors, (37), 19 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:54:56,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 57 transitions. [2022-04-28 03:54:56,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 57 transitions. [2022-04-28 03:54:56,129 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:54:56,130 INFO L225 Difference]: With dead ends: 52 [2022-04-28 03:54:56,130 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 03:54:56,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=376, Invalid=1976, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 03:54:56,131 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 37 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:54:56,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 98 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 03:54:56,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 03:54:56,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-28 03:54:56,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:54:56,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:56,218 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:56,218 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:56,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:56,219 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2022-04-28 03:54:56,219 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2022-04-28 03:54:56,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:56,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:56,219 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-28 03:54:56,219 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-28 03:54:56,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:56,220 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2022-04-28 03:54:56,220 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2022-04-28 03:54:56,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:56,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:56,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:54:56,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:54:56,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:56,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2022-04-28 03:54:56,221 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 41 [2022-04-28 03:54:56,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:54:56,221 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2022-04-28 03:54:56,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.85) internal successors, (37), 19 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:54:56,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 48 transitions. [2022-04-28 03:54:56,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:54:56,259 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2022-04-28 03:54:56,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 03:54:56,260 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:54:56,260 INFO L195 NwaCegarLoop]: trace histogram [16, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:54:56,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-28 03:54:56,468 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:54:56,469 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:54:56,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:54:56,469 INFO L85 PathProgramCache]: Analyzing trace with hash -785207433, now seen corresponding path program 14 times [2022-04-28 03:54:56,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:56,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1016364439] [2022-04-28 03:54:56,559 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:54:56,734 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:54:56,735 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:54:56,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1477785775, now seen corresponding path program 1 times [2022-04-28 03:54:56,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:54:56,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786853618] [2022-04-28 03:54:56,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:56,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:54:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:56,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:54:56,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:56,821 INFO L290 TraceCheckUtils]: 0: Hoare triple {4895#(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(17, 2);call #Ultimate.allocInit(12, 3); {4884#true} is VALID [2022-04-28 03:54:56,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {4884#true} assume true; {4884#true} is VALID [2022-04-28 03:54:56,821 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4884#true} {4884#true} #41#return; {4884#true} is VALID [2022-04-28 03:54:56,822 INFO L272 TraceCheckUtils]: 0: Hoare triple {4884#true} call ULTIMATE.init(); {4895#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:54:56,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {4895#(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(17, 2);call #Ultimate.allocInit(12, 3); {4884#true} is VALID [2022-04-28 03:54:56,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {4884#true} assume true; {4884#true} is VALID [2022-04-28 03:54:56,822 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4884#true} {4884#true} #41#return; {4884#true} is VALID [2022-04-28 03:54:56,822 INFO L272 TraceCheckUtils]: 4: Hoare triple {4884#true} call #t~ret4 := main(); {4884#true} is VALID [2022-04-28 03:54:56,822 INFO L290 TraceCheckUtils]: 5: Hoare triple {4884#true} ~x~0 := 0;~y~0 := 500000; {4889#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:54:56,823 INFO L290 TraceCheckUtils]: 6: Hoare triple {4889#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [101] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_355 v_main_~x~0_354))) (or .cse0 (and (not (< v_main_~x~0_355 500000)) .cse0) (and (< v_main_~x~0_354 500001) (< v_main_~x~0_355 v_main_~x~0_354)))) InVars {main_~x~0=v_main_~x~0_355} OutVars{main_~x~0=v_main_~x~0_354} AuxVars[] AssignedVars[main_~x~0] {4890#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:54:56,823 INFO L290 TraceCheckUtils]: 7: Hoare triple {4890#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [102] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4890#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:54:56,824 INFO L290 TraceCheckUtils]: 8: Hoare triple {4890#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [103] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_357)) (.cse1 (= v_main_~y~0_215 v_main_~y~0_214)) (.cse2 (= v_main_~x~0_357 v_main_~x~0_356))) (or (and .cse0 (< v_main_~x~0_357 v_main_~x~0_356) (< v_main_~x~0_356 1000001) (= (+ v_main_~x~0_356 v_main_~y~0_215) (+ v_main_~x~0_357 v_main_~y~0_214))) (and .cse1 .cse2) (and (or (not (< v_main_~x~0_357 1000000)) (not .cse0)) .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_357, main_~y~0=v_main_~y~0_215} OutVars{main_~x~0=v_main_~x~0_356, main_~y~0=v_main_~y~0_214} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {4891#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:54:56,825 INFO L290 TraceCheckUtils]: 9: Hoare triple {4891#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [100] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {4892#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-28 03:54:56,826 INFO L272 TraceCheckUtils]: 10: Hoare triple {4892#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {4893#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:54:56,826 INFO L290 TraceCheckUtils]: 11: Hoare triple {4893#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4894#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:54:56,826 INFO L290 TraceCheckUtils]: 12: Hoare triple {4894#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4885#false} is VALID [2022-04-28 03:54:56,826 INFO L290 TraceCheckUtils]: 13: Hoare triple {4885#false} assume !false; {4885#false} is VALID [2022-04-28 03:54:56,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:54:56,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:54:56,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786853618] [2022-04-28 03:54:56,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786853618] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:54:56,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238820621] [2022-04-28 03:54:56,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:56,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:54:56,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:54:56,828 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:54:56,828 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:54:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:56,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:54:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:56,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:54:57,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {4884#true} call ULTIMATE.init(); {4884#true} is VALID [2022-04-28 03:54:57,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {4884#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(17, 2);call #Ultimate.allocInit(12, 3); {4884#true} is VALID [2022-04-28 03:54:57,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {4884#true} assume true; {4884#true} is VALID [2022-04-28 03:54:57,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4884#true} {4884#true} #41#return; {4884#true} is VALID [2022-04-28 03:54:57,218 INFO L272 TraceCheckUtils]: 4: Hoare triple {4884#true} call #t~ret4 := main(); {4884#true} is VALID [2022-04-28 03:54:57,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {4884#true} ~x~0 := 0;~y~0 := 500000; {4914#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:54:57,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {4914#(and (<= main_~x~0 0) (= main_~y~0 500000))} [101] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_355 v_main_~x~0_354))) (or .cse0 (and (not (< v_main_~x~0_355 500000)) .cse0) (and (< v_main_~x~0_354 500001) (< v_main_~x~0_355 v_main_~x~0_354)))) InVars {main_~x~0=v_main_~x~0_355} OutVars{main_~x~0=v_main_~x~0_354} AuxVars[] AssignedVars[main_~x~0] {4918#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:54:57,219 INFO L290 TraceCheckUtils]: 7: Hoare triple {4918#(and (= main_~y~0 500000) (< main_~x~0 500001))} [102] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4918#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:54:57,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {4918#(and (= main_~y~0 500000) (< main_~x~0 500001))} [103] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_357)) (.cse1 (= v_main_~y~0_215 v_main_~y~0_214)) (.cse2 (= v_main_~x~0_357 v_main_~x~0_356))) (or (and .cse0 (< v_main_~x~0_357 v_main_~x~0_356) (< v_main_~x~0_356 1000001) (= (+ v_main_~x~0_356 v_main_~y~0_215) (+ v_main_~x~0_357 v_main_~y~0_214))) (and .cse1 .cse2) (and (or (not (< v_main_~x~0_357 1000000)) (not .cse0)) .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_357, main_~y~0=v_main_~y~0_215} OutVars{main_~x~0=v_main_~x~0_356, main_~y~0=v_main_~y~0_214} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {4925#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:54:57,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {4925#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [100] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {4929#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:54:57,221 INFO L272 TraceCheckUtils]: 10: Hoare triple {4929#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {4933#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:54:57,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {4933#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4937#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:54:57,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {4937#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4885#false} is VALID [2022-04-28 03:54:57,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {4885#false} assume !false; {4885#false} is VALID [2022-04-28 03:54:57,222 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:54:57,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:54:57,547 INFO L290 TraceCheckUtils]: 13: Hoare triple {4885#false} assume !false; {4885#false} is VALID [2022-04-28 03:54:57,547 INFO L290 TraceCheckUtils]: 12: Hoare triple {4937#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4885#false} is VALID [2022-04-28 03:54:57,548 INFO L290 TraceCheckUtils]: 11: Hoare triple {4933#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4937#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:54:57,548 INFO L272 TraceCheckUtils]: 10: Hoare triple {4892#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {4933#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:54:57,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {4956#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [100] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {4892#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-28 03:54:57,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {4960#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [103] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_357)) (.cse1 (= v_main_~y~0_215 v_main_~y~0_214)) (.cse2 (= v_main_~x~0_357 v_main_~x~0_356))) (or (and .cse0 (< v_main_~x~0_357 v_main_~x~0_356) (< v_main_~x~0_356 1000001) (= (+ v_main_~x~0_356 v_main_~y~0_215) (+ v_main_~x~0_357 v_main_~y~0_214))) (and .cse1 .cse2) (and (or (not (< v_main_~x~0_357 1000000)) (not .cse0)) .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_357, main_~y~0=v_main_~y~0_215} OutVars{main_~x~0=v_main_~x~0_356, main_~y~0=v_main_~y~0_214} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {4956#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:54:57,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {4960#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [102] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4960#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:54:57,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {4967#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} [101] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_355 v_main_~x~0_354))) (or .cse0 (and (not (< v_main_~x~0_355 500000)) .cse0) (and (< v_main_~x~0_354 500001) (< v_main_~x~0_355 v_main_~x~0_354)))) InVars {main_~x~0=v_main_~x~0_355} OutVars{main_~x~0=v_main_~x~0_354} AuxVars[] AssignedVars[main_~x~0] {4960#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:54:57,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {4884#true} ~x~0 := 0;~y~0 := 500000; {4967#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:54:57,551 INFO L272 TraceCheckUtils]: 4: Hoare triple {4884#true} call #t~ret4 := main(); {4884#true} is VALID [2022-04-28 03:54:57,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4884#true} {4884#true} #41#return; {4884#true} is VALID [2022-04-28 03:54:57,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {4884#true} assume true; {4884#true} is VALID [2022-04-28 03:54:57,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {4884#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(17, 2);call #Ultimate.allocInit(12, 3); {4884#true} is VALID [2022-04-28 03:54:57,552 INFO L272 TraceCheckUtils]: 0: Hoare triple {4884#true} call ULTIMATE.init(); {4884#true} is VALID [2022-04-28 03:54:57,552 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:54:57,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238820621] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:54:57,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:54:57,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 03:54:58,105 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:54:58,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1016364439] [2022-04-28 03:54:58,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1016364439] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:54:58,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:54:58,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 03:54:58,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419494148] [2022-04-28 03:54:58,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:54:58,106 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 20 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:54:58,106 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:54:58,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 20 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:54:58,136 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:54:58,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 03:54:58,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:58,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 03:54:58,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=912, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 03:54:58,137 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 20 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:54:59,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:59,523 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2022-04-28 03:54:59,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 03:54:59,524 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 20 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:54:59,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:54:59,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 20 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:54:59,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 59 transitions. [2022-04-28 03:54:59,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 20 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:54:59,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 59 transitions. [2022-04-28 03:54:59,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 59 transitions. [2022-04-28 03:54:59,574 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:54:59,575 INFO L225 Difference]: With dead ends: 54 [2022-04-28 03:54:59,575 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 03:54:59,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=395, Invalid=2155, Unknown=0, NotChecked=0, Total=2550 [2022-04-28 03:54:59,576 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 39 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:54:59,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 73 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 03:54:59,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 03:54:59,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-28 03:54:59,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:54:59,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:59,673 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:59,673 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:59,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:59,674 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-04-28 03:54:59,674 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-04-28 03:54:59,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:59,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:59,674 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 3 states have call successors, (3), 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:54:59,674 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 3 states have call successors, (3), 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:54:59,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:59,675 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-04-28 03:54:59,675 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-04-28 03:54:59,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:59,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:59,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:54:59,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:54:59,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:59,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2022-04-28 03:54:59,676 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 43 [2022-04-28 03:54:59,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:54:59,676 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2022-04-28 03:54:59,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 20 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:54:59,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 50 transitions. [2022-04-28 03:54:59,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:54:59,724 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-04-28 03:54:59,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 03:54:59,725 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:54:59,725 INFO L195 NwaCegarLoop]: trace histogram [17, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:54:59,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 03:54:59,925 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:54:59,925 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:54:59,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:54:59,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1566333842, now seen corresponding path program 15 times [2022-04-28 03:54:59,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:59,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1752759243] [2022-04-28 03:55:00,019 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:55:00,221 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:55:00,222 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:55:00,224 INFO L85 PathProgramCache]: Analyzing trace with hash -767649361, now seen corresponding path program 1 times [2022-04-28 03:55:00,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:55:00,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609520649] [2022-04-28 03:55:00,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:55:00,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:55:00,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:00,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:55:00,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:00,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {5345#(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(17, 2);call #Ultimate.allocInit(12, 3); {5334#true} is VALID [2022-04-28 03:55:00,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {5334#true} assume true; {5334#true} is VALID [2022-04-28 03:55:00,327 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5334#true} {5334#true} #41#return; {5334#true} is VALID [2022-04-28 03:55:00,327 INFO L272 TraceCheckUtils]: 0: Hoare triple {5334#true} call ULTIMATE.init(); {5345#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:55:00,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {5345#(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(17, 2);call #Ultimate.allocInit(12, 3); {5334#true} is VALID [2022-04-28 03:55:00,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {5334#true} assume true; {5334#true} is VALID [2022-04-28 03:55:00,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5334#true} {5334#true} #41#return; {5334#true} is VALID [2022-04-28 03:55:00,328 INFO L272 TraceCheckUtils]: 4: Hoare triple {5334#true} call #t~ret4 := main(); {5334#true} is VALID [2022-04-28 03:55:00,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {5334#true} ~x~0 := 0;~y~0 := 500000; {5339#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:55:00,328 INFO L290 TraceCheckUtils]: 6: Hoare triple {5339#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [105] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_388 v_main_~x~0_387))) (or (and .cse0 (not (< v_main_~x~0_388 500000))) .cse0 (and (< v_main_~x~0_388 v_main_~x~0_387) (< v_main_~x~0_387 500001)))) InVars {main_~x~0=v_main_~x~0_388} OutVars{main_~x~0=v_main_~x~0_387} AuxVars[] AssignedVars[main_~x~0] {5340#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:55:00,329 INFO L290 TraceCheckUtils]: 7: Hoare triple {5340#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [106] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5340#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:55:00,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {5340#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [107] L11-2-->L10-2_primed: Formula: (let ((.cse2 (= v_main_~y~0_238 v_main_~y~0_237)) (.cse1 (<= 500000 v_main_~x~0_390))) (or (let ((.cse0 (+ v_main_~x~0_390 v_main_~y~0_237))) (and (< .cse0 (+ v_main_~y~0_238 1000001)) (= (+ v_main_~x~0_389 v_main_~y~0_238) .cse0) (< v_main_~y~0_238 v_main_~y~0_237) .cse1)) (and .cse2 (= v_main_~x~0_390 v_main_~x~0_389)) (and .cse2 (= v_main_~x~0_389 v_main_~x~0_390) (or (not .cse1) (not (< v_main_~x~0_390 1000000)))))) InVars {main_~x~0=v_main_~x~0_390, main_~y~0=v_main_~y~0_238} OutVars{main_~x~0=v_main_~x~0_389, main_~y~0=v_main_~y~0_237} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {5341#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:00,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {5341#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [104] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {5342#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:55:00,331 INFO L272 TraceCheckUtils]: 10: Hoare triple {5342#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {5343#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:55:00,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {5343#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {5344#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:55:00,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {5344#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5335#false} is VALID [2022-04-28 03:55:00,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {5335#false} assume !false; {5335#false} is VALID [2022-04-28 03:55:00,332 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:55:00,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:55:00,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609520649] [2022-04-28 03:55:00,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609520649] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:55:00,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465234063] [2022-04-28 03:55:00,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:55:00,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:55:00,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:55:00,334 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:55:00,335 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:55:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:00,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:55:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:00,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:55:00,716 INFO L272 TraceCheckUtils]: 0: Hoare triple {5334#true} call ULTIMATE.init(); {5334#true} is VALID [2022-04-28 03:55:00,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {5334#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(17, 2);call #Ultimate.allocInit(12, 3); {5334#true} is VALID [2022-04-28 03:55:00,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {5334#true} assume true; {5334#true} is VALID [2022-04-28 03:55:00,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5334#true} {5334#true} #41#return; {5334#true} is VALID [2022-04-28 03:55:00,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {5334#true} call #t~ret4 := main(); {5334#true} is VALID [2022-04-28 03:55:00,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {5334#true} ~x~0 := 0;~y~0 := 500000; {5364#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:55:00,717 INFO L290 TraceCheckUtils]: 6: Hoare triple {5364#(and (<= main_~x~0 0) (= main_~y~0 500000))} [105] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_388 v_main_~x~0_387))) (or (and .cse0 (not (< v_main_~x~0_388 500000))) .cse0 (and (< v_main_~x~0_388 v_main_~x~0_387) (< v_main_~x~0_387 500001)))) InVars {main_~x~0=v_main_~x~0_388} OutVars{main_~x~0=v_main_~x~0_387} AuxVars[] AssignedVars[main_~x~0] {5368#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:55:00,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {5368#(and (= main_~y~0 500000) (< main_~x~0 500001))} [106] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5368#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:55:00,718 INFO L290 TraceCheckUtils]: 8: Hoare triple {5368#(and (= main_~y~0 500000) (< main_~x~0 500001))} [107] L11-2-->L10-2_primed: Formula: (let ((.cse2 (= v_main_~y~0_238 v_main_~y~0_237)) (.cse1 (<= 500000 v_main_~x~0_390))) (or (let ((.cse0 (+ v_main_~x~0_390 v_main_~y~0_237))) (and (< .cse0 (+ v_main_~y~0_238 1000001)) (= (+ v_main_~x~0_389 v_main_~y~0_238) .cse0) (< v_main_~y~0_238 v_main_~y~0_237) .cse1)) (and .cse2 (= v_main_~x~0_390 v_main_~x~0_389)) (and .cse2 (= v_main_~x~0_389 v_main_~x~0_390) (or (not .cse1) (not (< v_main_~x~0_390 1000000)))))) InVars {main_~x~0=v_main_~x~0_390, main_~y~0=v_main_~y~0_238} OutVars{main_~x~0=v_main_~x~0_389, main_~y~0=v_main_~y~0_237} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {5375#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:00,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {5375#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [104] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {5379#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:55:00,724 INFO L272 TraceCheckUtils]: 10: Hoare triple {5379#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {5383#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:55:00,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {5383#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5387#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:55:00,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {5387#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5335#false} is VALID [2022-04-28 03:55:00,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {5335#false} assume !false; {5335#false} is VALID [2022-04-28 03:55:00,725 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:55:00,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:55:01,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {5335#false} assume !false; {5335#false} is VALID [2022-04-28 03:55:01,027 INFO L290 TraceCheckUtils]: 12: Hoare triple {5387#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5335#false} is VALID [2022-04-28 03:55:01,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {5383#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5387#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:55:01,028 INFO L272 TraceCheckUtils]: 10: Hoare triple {5342#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {5383#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:55:01,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {5406#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [104] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {5342#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:55:01,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {5410#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [107] L11-2-->L10-2_primed: Formula: (let ((.cse2 (= v_main_~y~0_238 v_main_~y~0_237)) (.cse1 (<= 500000 v_main_~x~0_390))) (or (let ((.cse0 (+ v_main_~x~0_390 v_main_~y~0_237))) (and (< .cse0 (+ v_main_~y~0_238 1000001)) (= (+ v_main_~x~0_389 v_main_~y~0_238) .cse0) (< v_main_~y~0_238 v_main_~y~0_237) .cse1)) (and .cse2 (= v_main_~x~0_390 v_main_~x~0_389)) (and .cse2 (= v_main_~x~0_389 v_main_~x~0_390) (or (not .cse1) (not (< v_main_~x~0_390 1000000)))))) InVars {main_~x~0=v_main_~x~0_390, main_~y~0=v_main_~y~0_238} OutVars{main_~x~0=v_main_~x~0_389, main_~y~0=v_main_~y~0_237} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {5406#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:01,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {5410#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [106] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5410#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:01,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {5417#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [105] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_388 v_main_~x~0_387))) (or (and .cse0 (not (< v_main_~x~0_388 500000))) .cse0 (and (< v_main_~x~0_388 v_main_~x~0_387) (< v_main_~x~0_387 500001)))) InVars {main_~x~0=v_main_~x~0_388} OutVars{main_~x~0=v_main_~x~0_387} AuxVars[] AssignedVars[main_~x~0] {5410#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:01,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {5334#true} ~x~0 := 0;~y~0 := 500000; {5417#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:55:01,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {5334#true} call #t~ret4 := main(); {5334#true} is VALID [2022-04-28 03:55:01,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5334#true} {5334#true} #41#return; {5334#true} is VALID [2022-04-28 03:55:01,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {5334#true} assume true; {5334#true} is VALID [2022-04-28 03:55:01,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {5334#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(17, 2);call #Ultimate.allocInit(12, 3); {5334#true} is VALID [2022-04-28 03:55:01,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {5334#true} call ULTIMATE.init(); {5334#true} is VALID [2022-04-28 03:55:01,032 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:55:01,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465234063] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:55:01,032 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:55:01,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 03:55:01,604 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:55:01,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1752759243] [2022-04-28 03:55:01,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1752759243] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:55:01,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:55:01,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 03:55:01,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479729439] [2022-04-28 03:55:01,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:55:01,605 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 21 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:55:01,605 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:55:01,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 21 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:55:01,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:55:01,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 03:55:01,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:55:01,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 03:55:01,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=972, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 03:55:01,637 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 21 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:55:03,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:03,238 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-28 03:55:03,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 03:55:03,238 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 21 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:55:03,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:55:03,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 21 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:55:03,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 61 transitions. [2022-04-28 03:55:03,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 21 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:55:03,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 61 transitions. [2022-04-28 03:55:03,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 61 transitions. [2022-04-28 03:55:03,307 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:55:03,308 INFO L225 Difference]: With dead ends: 56 [2022-04-28 03:55:03,308 INFO L226 Difference]: Without dead ends: 49 [2022-04-28 03:55:03,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 712 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=414, Invalid=2342, Unknown=0, NotChecked=0, Total=2756 [2022-04-28 03:55:03,309 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 41 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:55:03,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 113 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 03:55:03,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-28 03:55:03,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-28 03:55:03,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:55:03,417 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:03,417 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:03,417 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:03,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:03,418 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2022-04-28 03:55:03,418 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2022-04-28 03:55:03,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:55:03,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:55:03,418 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 3 states have call successors, (3), 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:55:03,418 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 3 states have call successors, (3), 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:55:03,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:03,419 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2022-04-28 03:55:03,419 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2022-04-28 03:55:03,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:55:03,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:55:03,419 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:55:03,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:55:03,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:03,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2022-04-28 03:55:03,420 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 45 [2022-04-28 03:55:03,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:55:03,420 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2022-04-28 03:55:03,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 21 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:55:03,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 52 transitions. [2022-04-28 03:55:03,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:55:03,463 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2022-04-28 03:55:03,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 03:55:03,464 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:55:03,464 INFO L195 NwaCegarLoop]: trace histogram [18, 16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:55:03,481 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:55:03,664 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:55:03,664 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:55:03,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:55:03,665 INFO L85 PathProgramCache]: Analyzing trace with hash -2050265875, now seen corresponding path program 16 times [2022-04-28 03:55:03,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:55:03,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [483371096] [2022-04-28 03:55:03,756 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:55:03,976 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:55:03,977 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:55:03,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1281882799, now seen corresponding path program 1 times [2022-04-28 03:55:03,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:55:03,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936384793] [2022-04-28 03:55:03,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:55:03,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:55:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:04,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:55:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:04,091 INFO L290 TraceCheckUtils]: 0: Hoare triple {5810#(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(17, 2);call #Ultimate.allocInit(12, 3); {5799#true} is VALID [2022-04-28 03:55:04,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {5799#true} assume true; {5799#true} is VALID [2022-04-28 03:55:04,091 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5799#true} {5799#true} #41#return; {5799#true} is VALID [2022-04-28 03:55:04,091 INFO L272 TraceCheckUtils]: 0: Hoare triple {5799#true} call ULTIMATE.init(); {5810#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:55:04,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {5810#(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(17, 2);call #Ultimate.allocInit(12, 3); {5799#true} is VALID [2022-04-28 03:55:04,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {5799#true} assume true; {5799#true} is VALID [2022-04-28 03:55:04,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5799#true} {5799#true} #41#return; {5799#true} is VALID [2022-04-28 03:55:04,092 INFO L272 TraceCheckUtils]: 4: Hoare triple {5799#true} call #t~ret4 := main(); {5799#true} is VALID [2022-04-28 03:55:04,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {5799#true} ~x~0 := 0;~y~0 := 500000; {5804#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:55:04,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {5804#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [109] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_422 v_main_~x~0_421))) (or .cse0 (and (< v_main_~x~0_421 500001) (< v_main_~x~0_422 v_main_~x~0_421)) (and .cse0 (<= 500000 v_main_~x~0_422)))) InVars {main_~x~0=v_main_~x~0_422} OutVars{main_~x~0=v_main_~x~0_421} AuxVars[] AssignedVars[main_~x~0] {5805#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:55:04,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {5805#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [110] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5805#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:55:04,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {5805#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [111] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_262 v_main_~y~0_261)) (.cse2 (<= 500000 v_main_~x~0_424))) (or (and .cse0 (= v_main_~x~0_424 v_main_~x~0_423)) (let ((.cse1 (+ v_main_~x~0_424 v_main_~y~0_261))) (and (= .cse1 (+ v_main_~x~0_423 v_main_~y~0_262)) (< v_main_~y~0_262 v_main_~y~0_261) .cse2 (< .cse1 (+ v_main_~y~0_262 1000001)))) (and .cse0 (= v_main_~x~0_423 v_main_~x~0_424) (or (not (< v_main_~x~0_424 1000000)) (not .cse2))))) InVars {main_~x~0=v_main_~x~0_424, main_~y~0=v_main_~y~0_262} OutVars{main_~x~0=v_main_~x~0_423, main_~y~0=v_main_~y~0_261} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {5806#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} is VALID [2022-04-28 03:55:04,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {5806#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} [108] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {5807#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:55:04,095 INFO L272 TraceCheckUtils]: 10: Hoare triple {5807#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {5808#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:55:04,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {5808#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {5809#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:55:04,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {5809#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5800#false} is VALID [2022-04-28 03:55:04,096 INFO L290 TraceCheckUtils]: 13: Hoare triple {5800#false} assume !false; {5800#false} is VALID [2022-04-28 03:55:04,099 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:55:04,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:55:04,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936384793] [2022-04-28 03:55:04,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936384793] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:55:04,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361391976] [2022-04-28 03:55:04,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:55:04,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:55:04,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:55:04,101 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:55:04,105 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:55:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:04,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:55:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:04,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:55:04,462 INFO L272 TraceCheckUtils]: 0: Hoare triple {5799#true} call ULTIMATE.init(); {5799#true} is VALID [2022-04-28 03:55:04,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {5799#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(17, 2);call #Ultimate.allocInit(12, 3); {5799#true} is VALID [2022-04-28 03:55:04,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {5799#true} assume true; {5799#true} is VALID [2022-04-28 03:55:04,463 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5799#true} {5799#true} #41#return; {5799#true} is VALID [2022-04-28 03:55:04,463 INFO L272 TraceCheckUtils]: 4: Hoare triple {5799#true} call #t~ret4 := main(); {5799#true} is VALID [2022-04-28 03:55:04,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {5799#true} ~x~0 := 0;~y~0 := 500000; {5829#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:55:04,464 INFO L290 TraceCheckUtils]: 6: Hoare triple {5829#(and (<= main_~x~0 0) (= main_~y~0 500000))} [109] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_422 v_main_~x~0_421))) (or .cse0 (and (< v_main_~x~0_421 500001) (< v_main_~x~0_422 v_main_~x~0_421)) (and .cse0 (<= 500000 v_main_~x~0_422)))) InVars {main_~x~0=v_main_~x~0_422} OutVars{main_~x~0=v_main_~x~0_421} AuxVars[] AssignedVars[main_~x~0] {5833#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:55:04,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {5833#(and (= main_~y~0 500000) (< main_~x~0 500001))} [110] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5833#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:55:04,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {5833#(and (= main_~y~0 500000) (< main_~x~0 500001))} [111] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_262 v_main_~y~0_261)) (.cse2 (<= 500000 v_main_~x~0_424))) (or (and .cse0 (= v_main_~x~0_424 v_main_~x~0_423)) (let ((.cse1 (+ v_main_~x~0_424 v_main_~y~0_261))) (and (= .cse1 (+ v_main_~x~0_423 v_main_~y~0_262)) (< v_main_~y~0_262 v_main_~y~0_261) .cse2 (< .cse1 (+ v_main_~y~0_262 1000001)))) (and .cse0 (= v_main_~x~0_423 v_main_~x~0_424) (or (not (< v_main_~x~0_424 1000000)) (not .cse2))))) InVars {main_~x~0=v_main_~x~0_424, main_~y~0=v_main_~y~0_262} OutVars{main_~x~0=v_main_~x~0_423, main_~y~0=v_main_~y~0_261} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {5840#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:04,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {5840#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [108] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {5844#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:55:04,466 INFO L272 TraceCheckUtils]: 10: Hoare triple {5844#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {5848#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:55:04,467 INFO L290 TraceCheckUtils]: 11: Hoare triple {5848#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5852#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:55:04,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {5852#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5800#false} is VALID [2022-04-28 03:55:04,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {5800#false} assume !false; {5800#false} is VALID [2022-04-28 03:55:04,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:55:04,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:55:04,781 INFO L290 TraceCheckUtils]: 13: Hoare triple {5800#false} assume !false; {5800#false} is VALID [2022-04-28 03:55:04,781 INFO L290 TraceCheckUtils]: 12: Hoare triple {5852#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5800#false} is VALID [2022-04-28 03:55:04,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {5848#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5852#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:55:04,782 INFO L272 TraceCheckUtils]: 10: Hoare triple {5807#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {5848#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:55:04,783 INFO L290 TraceCheckUtils]: 9: Hoare triple {5871#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [108] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {5807#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:55:04,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {5875#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [111] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_262 v_main_~y~0_261)) (.cse2 (<= 500000 v_main_~x~0_424))) (or (and .cse0 (= v_main_~x~0_424 v_main_~x~0_423)) (let ((.cse1 (+ v_main_~x~0_424 v_main_~y~0_261))) (and (= .cse1 (+ v_main_~x~0_423 v_main_~y~0_262)) (< v_main_~y~0_262 v_main_~y~0_261) .cse2 (< .cse1 (+ v_main_~y~0_262 1000001)))) (and .cse0 (= v_main_~x~0_423 v_main_~x~0_424) (or (not (< v_main_~x~0_424 1000000)) (not .cse2))))) InVars {main_~x~0=v_main_~x~0_424, main_~y~0=v_main_~y~0_262} OutVars{main_~x~0=v_main_~x~0_423, main_~y~0=v_main_~y~0_261} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {5871#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:04,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {5875#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [110] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5875#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:04,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {5882#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [109] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_422 v_main_~x~0_421))) (or .cse0 (and (< v_main_~x~0_421 500001) (< v_main_~x~0_422 v_main_~x~0_421)) (and .cse0 (<= 500000 v_main_~x~0_422)))) InVars {main_~x~0=v_main_~x~0_422} OutVars{main_~x~0=v_main_~x~0_421} AuxVars[] AssignedVars[main_~x~0] {5875#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:04,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {5799#true} ~x~0 := 0;~y~0 := 500000; {5882#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:55:04,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {5799#true} call #t~ret4 := main(); {5799#true} is VALID [2022-04-28 03:55:04,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5799#true} {5799#true} #41#return; {5799#true} is VALID [2022-04-28 03:55:04,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {5799#true} assume true; {5799#true} is VALID [2022-04-28 03:55:04,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {5799#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(17, 2);call #Ultimate.allocInit(12, 3); {5799#true} is VALID [2022-04-28 03:55:04,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {5799#true} call ULTIMATE.init(); {5799#true} is VALID [2022-04-28 03:55:04,786 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:55:04,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361391976] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:55:04,786 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:55:04,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 03:55:05,421 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:55:05,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [483371096] [2022-04-28 03:55:05,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [483371096] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:55:05,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:55:05,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 03:55:05,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415753061] [2022-04-28 03:55:05,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:55:05,422 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 22 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:55:05,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:55:05,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 22 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:55:05,454 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:55:05,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 03:55:05,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:55:05,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 03:55:05,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1034, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 03:55:05,455 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 22 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:55:07,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:07,110 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2022-04-28 03:55:07,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 03:55:07,111 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 22 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:55:07,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:55:07,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 22 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:55:07,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 63 transitions. [2022-04-28 03:55:07,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 22 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:55:07,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 63 transitions. [2022-04-28 03:55:07,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 63 transitions. [2022-04-28 03:55:07,203 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:55:07,204 INFO L225 Difference]: With dead ends: 58 [2022-04-28 03:55:07,204 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 03:55:07,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=433, Invalid=2537, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 03:55:07,205 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 43 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:55:07,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 78 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 03:55:07,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 03:55:07,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-28 03:55:07,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:55:07,310 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:07,310 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:07,310 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:07,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:07,311 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2022-04-28 03:55:07,311 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-04-28 03:55:07,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:55:07,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:55:07,312 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-28 03:55:07,312 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-28 03:55:07,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:07,312 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2022-04-28 03:55:07,312 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-04-28 03:55:07,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:55:07,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:55:07,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:55:07,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:55:07,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:07,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2022-04-28 03:55:07,313 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 47 [2022-04-28 03:55:07,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:55:07,313 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2022-04-28 03:55:07,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 22 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:55:07,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 54 transitions. [2022-04-28 03:55:07,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:55:07,365 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-04-28 03:55:07,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 03:55:07,365 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:55:07,365 INFO L195 NwaCegarLoop]: trace histogram [19, 17, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:55:07,381 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:55:07,565 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:55:07,565 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:55:07,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:55:07,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1320915848, now seen corresponding path program 17 times [2022-04-28 03:55:07,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:55:07,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [512615849] [2022-04-28 03:55:07,659 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:55:07,854 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:55:07,855 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:55:07,857 INFO L85 PathProgramCache]: Analyzing trace with hash -963552337, now seen corresponding path program 1 times [2022-04-28 03:55:07,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:55:07,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273859489] [2022-04-28 03:55:07,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:55:07,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:55:07,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:07,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:55:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:07,960 INFO L290 TraceCheckUtils]: 0: Hoare triple {6290#(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(17, 2);call #Ultimate.allocInit(12, 3); {6279#true} is VALID [2022-04-28 03:55:07,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {6279#true} assume true; {6279#true} is VALID [2022-04-28 03:55:07,960 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6279#true} {6279#true} #41#return; {6279#true} is VALID [2022-04-28 03:55:07,961 INFO L272 TraceCheckUtils]: 0: Hoare triple {6279#true} call ULTIMATE.init(); {6290#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:55:07,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {6290#(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(17, 2);call #Ultimate.allocInit(12, 3); {6279#true} is VALID [2022-04-28 03:55:07,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {6279#true} assume true; {6279#true} is VALID [2022-04-28 03:55:07,961 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6279#true} {6279#true} #41#return; {6279#true} is VALID [2022-04-28 03:55:07,961 INFO L272 TraceCheckUtils]: 4: Hoare triple {6279#true} call #t~ret4 := main(); {6279#true} is VALID [2022-04-28 03:55:07,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {6279#true} ~x~0 := 0;~y~0 := 500000; {6284#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:55:07,962 INFO L290 TraceCheckUtils]: 6: Hoare triple {6284#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [113] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_457 v_main_~x~0_456))) (or .cse0 (and (< v_main_~x~0_456 500001) (< v_main_~x~0_457 v_main_~x~0_456)) (and (not (< v_main_~x~0_457 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_457} OutVars{main_~x~0=v_main_~x~0_456} AuxVars[] AssignedVars[main_~x~0] {6285#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:55:07,962 INFO L290 TraceCheckUtils]: 7: Hoare triple {6285#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [114] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6285#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:55:07,963 INFO L290 TraceCheckUtils]: 8: Hoare triple {6285#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [115] L11-2-->L10-2_primed: Formula: (let ((.cse2 (= v_main_~y~0_287 v_main_~y~0_286)) (.cse3 (= v_main_~x~0_459 v_main_~x~0_458)) (.cse1 (<= 500000 v_main_~x~0_459))) (or (let ((.cse0 (+ v_main_~x~0_459 v_main_~y~0_286))) (and (= .cse0 (+ v_main_~x~0_458 v_main_~y~0_287)) .cse1 (< .cse0 (+ v_main_~y~0_287 1000001)) (< v_main_~y~0_287 v_main_~y~0_286))) (and .cse2 .cse3) (and .cse2 .cse3 (or (not (< v_main_~x~0_459 1000000)) (not .cse1))))) InVars {main_~x~0=v_main_~x~0_459, main_~y~0=v_main_~y~0_287} OutVars{main_~x~0=v_main_~x~0_458, main_~y~0=v_main_~y~0_286} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {6286#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} is VALID [2022-04-28 03:55:07,964 INFO L290 TraceCheckUtils]: 9: Hoare triple {6286#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} [112] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {6287#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:55:07,964 INFO L272 TraceCheckUtils]: 10: Hoare triple {6287#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {6288#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:55:07,965 INFO L290 TraceCheckUtils]: 11: Hoare triple {6288#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {6289#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:55:07,965 INFO L290 TraceCheckUtils]: 12: Hoare triple {6289#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6280#false} is VALID [2022-04-28 03:55:07,965 INFO L290 TraceCheckUtils]: 13: Hoare triple {6280#false} assume !false; {6280#false} is VALID [2022-04-28 03:55:07,965 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:55:07,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:55:07,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273859489] [2022-04-28 03:55:07,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273859489] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:55:07,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357543352] [2022-04-28 03:55:07,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:55:07,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:55:07,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:55:07,967 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:55:07,968 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:55:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:07,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:55:07,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:07,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:55:08,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {6279#true} call ULTIMATE.init(); {6279#true} is VALID [2022-04-28 03:55:08,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {6279#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(17, 2);call #Ultimate.allocInit(12, 3); {6279#true} is VALID [2022-04-28 03:55:08,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {6279#true} assume true; {6279#true} is VALID [2022-04-28 03:55:08,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6279#true} {6279#true} #41#return; {6279#true} is VALID [2022-04-28 03:55:08,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {6279#true} call #t~ret4 := main(); {6279#true} is VALID [2022-04-28 03:55:08,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {6279#true} ~x~0 := 0;~y~0 := 500000; {6309#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:55:08,381 INFO L290 TraceCheckUtils]: 6: Hoare triple {6309#(and (<= main_~x~0 0) (= main_~y~0 500000))} [113] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_457 v_main_~x~0_456))) (or .cse0 (and (< v_main_~x~0_456 500001) (< v_main_~x~0_457 v_main_~x~0_456)) (and (not (< v_main_~x~0_457 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_457} OutVars{main_~x~0=v_main_~x~0_456} AuxVars[] AssignedVars[main_~x~0] {6313#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:55:08,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {6313#(and (= main_~y~0 500000) (< main_~x~0 500001))} [114] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6313#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:55:08,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {6313#(and (= main_~y~0 500000) (< main_~x~0 500001))} [115] L11-2-->L10-2_primed: Formula: (let ((.cse2 (= v_main_~y~0_287 v_main_~y~0_286)) (.cse3 (= v_main_~x~0_459 v_main_~x~0_458)) (.cse1 (<= 500000 v_main_~x~0_459))) (or (let ((.cse0 (+ v_main_~x~0_459 v_main_~y~0_286))) (and (= .cse0 (+ v_main_~x~0_458 v_main_~y~0_287)) .cse1 (< .cse0 (+ v_main_~y~0_287 1000001)) (< v_main_~y~0_287 v_main_~y~0_286))) (and .cse2 .cse3) (and .cse2 .cse3 (or (not (< v_main_~x~0_459 1000000)) (not .cse1))))) InVars {main_~x~0=v_main_~x~0_459, main_~y~0=v_main_~y~0_287} OutVars{main_~x~0=v_main_~x~0_458, main_~y~0=v_main_~y~0_286} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {6320#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:08,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {6320#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [112] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {6324#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:55:08,383 INFO L272 TraceCheckUtils]: 10: Hoare triple {6324#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {6328#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:55:08,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {6328#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6332#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:55:08,384 INFO L290 TraceCheckUtils]: 12: Hoare triple {6332#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6280#false} is VALID [2022-04-28 03:55:08,384 INFO L290 TraceCheckUtils]: 13: Hoare triple {6280#false} assume !false; {6280#false} is VALID [2022-04-28 03:55:08,384 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:55:08,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:55:08,705 INFO L290 TraceCheckUtils]: 13: Hoare triple {6280#false} assume !false; {6280#false} is VALID [2022-04-28 03:55:08,706 INFO L290 TraceCheckUtils]: 12: Hoare triple {6332#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6280#false} is VALID [2022-04-28 03:55:08,706 INFO L290 TraceCheckUtils]: 11: Hoare triple {6328#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6332#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:55:08,707 INFO L272 TraceCheckUtils]: 10: Hoare triple {6287#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {6328#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:55:08,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {6351#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [112] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {6287#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:55:08,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {6355#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [115] L11-2-->L10-2_primed: Formula: (let ((.cse2 (= v_main_~y~0_287 v_main_~y~0_286)) (.cse3 (= v_main_~x~0_459 v_main_~x~0_458)) (.cse1 (<= 500000 v_main_~x~0_459))) (or (let ((.cse0 (+ v_main_~x~0_459 v_main_~y~0_286))) (and (= .cse0 (+ v_main_~x~0_458 v_main_~y~0_287)) .cse1 (< .cse0 (+ v_main_~y~0_287 1000001)) (< v_main_~y~0_287 v_main_~y~0_286))) (and .cse2 .cse3) (and .cse2 .cse3 (or (not (< v_main_~x~0_459 1000000)) (not .cse1))))) InVars {main_~x~0=v_main_~x~0_459, main_~y~0=v_main_~y~0_287} OutVars{main_~x~0=v_main_~x~0_458, main_~y~0=v_main_~y~0_286} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {6351#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:08,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {6355#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [114] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6355#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:08,709 INFO L290 TraceCheckUtils]: 6: Hoare triple {6362#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [113] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_457 v_main_~x~0_456))) (or .cse0 (and (< v_main_~x~0_456 500001) (< v_main_~x~0_457 v_main_~x~0_456)) (and (not (< v_main_~x~0_457 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_457} OutVars{main_~x~0=v_main_~x~0_456} AuxVars[] AssignedVars[main_~x~0] {6355#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:08,710 INFO L290 TraceCheckUtils]: 5: Hoare triple {6279#true} ~x~0 := 0;~y~0 := 500000; {6362#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:55:08,710 INFO L272 TraceCheckUtils]: 4: Hoare triple {6279#true} call #t~ret4 := main(); {6279#true} is VALID [2022-04-28 03:55:08,710 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6279#true} {6279#true} #41#return; {6279#true} is VALID [2022-04-28 03:55:08,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {6279#true} assume true; {6279#true} is VALID [2022-04-28 03:55:08,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {6279#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(17, 2);call #Ultimate.allocInit(12, 3); {6279#true} is VALID [2022-04-28 03:55:08,710 INFO L272 TraceCheckUtils]: 0: Hoare triple {6279#true} call ULTIMATE.init(); {6279#true} is VALID [2022-04-28 03:55:08,710 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:55:08,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357543352] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:55:08,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:55:08,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 03:55:09,392 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:55:09,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [512615849] [2022-04-28 03:55:09,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [512615849] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:55:09,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:55:09,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 03:55:09,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119221409] [2022-04-28 03:55:09,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:55:09,393 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.875) internal successors, (45), 23 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:55:09,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:55:09,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 24 states have (on average 1.875) internal successors, (45), 23 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:55:09,427 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:55:09,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 03:55:09,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:55:09,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 03:55:09,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1098, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 03:55:09,428 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 25 states, 24 states have (on average 1.875) internal successors, (45), 23 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:55:11,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:11,224 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2022-04-28 03:55:11,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 03:55:11,224 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.875) internal successors, (45), 23 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:55:11,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:55:11,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.875) internal successors, (45), 23 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:55:11,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 65 transitions. [2022-04-28 03:55:11,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.875) internal successors, (45), 23 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:55:11,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 65 transitions. [2022-04-28 03:55:11,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 65 transitions. [2022-04-28 03:55:11,274 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:55:11,275 INFO L225 Difference]: With dead ends: 60 [2022-04-28 03:55:11,275 INFO L226 Difference]: Without dead ends: 53 [2022-04-28 03:55:11,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 803 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=452, Invalid=2740, Unknown=0, NotChecked=0, Total=3192 [2022-04-28 03:55:11,276 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 45 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:55:11,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 93 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 03:55:11,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-28 03:55:11,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-28 03:55:11,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:55:11,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 48 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:11,397 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 48 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:11,397 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 48 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:11,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:11,397 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2022-04-28 03:55:11,397 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2022-04-28 03:55:11,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:55:11,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:55:11,398 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 48 states have internal predecessors, (52), 3 states have call successors, (3), 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:55:11,398 INFO L87 Difference]: Start difference. First operand has 53 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 48 states have internal predecessors, (52), 3 states have call successors, (3), 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:55:11,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:11,399 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2022-04-28 03:55:11,399 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2022-04-28 03:55:11,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:55:11,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:55:11,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:55:11,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:55:11,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 48 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:11,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2022-04-28 03:55:11,400 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 49 [2022-04-28 03:55:11,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:55:11,400 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2022-04-28 03:55:11,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.875) internal successors, (45), 23 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:55:11,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 56 transitions. [2022-04-28 03:55:11,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:55:11,453 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2022-04-28 03:55:11,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 03:55:11,453 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:55:11,453 INFO L195 NwaCegarLoop]: trace histogram [20, 18, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:55:11,469 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:55:11,654 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:55:11,654 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:55:11,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:55:11,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1673756829, now seen corresponding path program 18 times [2022-04-28 03:55:11,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:55:11,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [597945828] [2022-04-28 03:55:11,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:55:11,926 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:55:11,928 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:55:11,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1085979823, now seen corresponding path program 1 times [2022-04-28 03:55:11,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:55:11,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965003486] [2022-04-28 03:55:11,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:55:11,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:55:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:12,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:55:12,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:12,042 INFO L290 TraceCheckUtils]: 0: Hoare triple {6785#(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(17, 2);call #Ultimate.allocInit(12, 3); {6774#true} is VALID [2022-04-28 03:55:12,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {6774#true} assume true; {6774#true} is VALID [2022-04-28 03:55:12,042 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6774#true} {6774#true} #41#return; {6774#true} is VALID [2022-04-28 03:55:12,043 INFO L272 TraceCheckUtils]: 0: Hoare triple {6774#true} call ULTIMATE.init(); {6785#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:55:12,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {6785#(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(17, 2);call #Ultimate.allocInit(12, 3); {6774#true} is VALID [2022-04-28 03:55:12,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {6774#true} assume true; {6774#true} is VALID [2022-04-28 03:55:12,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6774#true} {6774#true} #41#return; {6774#true} is VALID [2022-04-28 03:55:12,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {6774#true} call #t~ret4 := main(); {6774#true} is VALID [2022-04-28 03:55:12,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {6774#true} ~x~0 := 0;~y~0 := 500000; {6779#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:55:12,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {6779#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [117] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_493 v_main_~x~0_492))) (or (and (< v_main_~x~0_492 500001) (< v_main_~x~0_493 v_main_~x~0_492)) (and (not (< v_main_~x~0_493 500000)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_493} OutVars{main_~x~0=v_main_~x~0_492} AuxVars[] AssignedVars[main_~x~0] {6780#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:55:12,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {6780#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [118] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6780#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:55:12,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {6780#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [119] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_495)) (.cse2 (= v_main_~x~0_495 v_main_~x~0_494)) (.cse3 (= v_main_~y~0_313 v_main_~y~0_312))) (or (let ((.cse1 (+ v_main_~x~0_495 v_main_~y~0_312))) (and .cse0 (= .cse1 (+ v_main_~x~0_494 v_main_~y~0_313)) (< .cse1 (+ v_main_~y~0_313 1000001)) (< v_main_~y~0_313 v_main_~y~0_312))) (and (or (not .cse0) (not (< v_main_~x~0_495 1000000))) .cse2 .cse3) (and .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_495, main_~y~0=v_main_~y~0_313} OutVars{main_~x~0=v_main_~x~0_494, main_~y~0=v_main_~y~0_312} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {6781#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} is VALID [2022-04-28 03:55:12,046 INFO L290 TraceCheckUtils]: 9: Hoare triple {6781#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} [116] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {6782#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:55:12,046 INFO L272 TraceCheckUtils]: 10: Hoare triple {6782#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {6783#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:55:12,047 INFO L290 TraceCheckUtils]: 11: Hoare triple {6783#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {6784#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:55:12,047 INFO L290 TraceCheckUtils]: 12: Hoare triple {6784#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6775#false} is VALID [2022-04-28 03:55:12,047 INFO L290 TraceCheckUtils]: 13: Hoare triple {6775#false} assume !false; {6775#false} is VALID [2022-04-28 03:55:12,047 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:55:12,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:55:12,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965003486] [2022-04-28 03:55:12,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965003486] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:55:12,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155690425] [2022-04-28 03:55:12,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:55:12,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:55:12,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:55:12,049 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:55:12,049 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:55:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:12,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:55:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:12,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:55:12,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {6774#true} call ULTIMATE.init(); {6774#true} is VALID [2022-04-28 03:55:12,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {6774#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(17, 2);call #Ultimate.allocInit(12, 3); {6774#true} is VALID [2022-04-28 03:55:12,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {6774#true} assume true; {6774#true} is VALID [2022-04-28 03:55:12,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6774#true} {6774#true} #41#return; {6774#true} is VALID [2022-04-28 03:55:12,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {6774#true} call #t~ret4 := main(); {6774#true} is VALID [2022-04-28 03:55:12,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {6774#true} ~x~0 := 0;~y~0 := 500000; {6804#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:55:12,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {6804#(and (<= main_~x~0 0) (= main_~y~0 500000))} [117] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_493 v_main_~x~0_492))) (or (and (< v_main_~x~0_492 500001) (< v_main_~x~0_493 v_main_~x~0_492)) (and (not (< v_main_~x~0_493 500000)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_493} OutVars{main_~x~0=v_main_~x~0_492} AuxVars[] AssignedVars[main_~x~0] {6808#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:55:12,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {6808#(and (= main_~y~0 500000) (< main_~x~0 500001))} [118] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6808#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:55:12,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {6808#(and (= main_~y~0 500000) (< main_~x~0 500001))} [119] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_495)) (.cse2 (= v_main_~x~0_495 v_main_~x~0_494)) (.cse3 (= v_main_~y~0_313 v_main_~y~0_312))) (or (let ((.cse1 (+ v_main_~x~0_495 v_main_~y~0_312))) (and .cse0 (= .cse1 (+ v_main_~x~0_494 v_main_~y~0_313)) (< .cse1 (+ v_main_~y~0_313 1000001)) (< v_main_~y~0_313 v_main_~y~0_312))) (and (or (not .cse0) (not (< v_main_~x~0_495 1000000))) .cse2 .cse3) (and .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_495, main_~y~0=v_main_~y~0_313} OutVars{main_~x~0=v_main_~x~0_494, main_~y~0=v_main_~y~0_312} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {6815#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:12,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {6815#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [116] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {6819#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:55:12,461 INFO L272 TraceCheckUtils]: 10: Hoare triple {6819#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {6823#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:55:12,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {6823#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6827#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:55:12,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {6827#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6775#false} is VALID [2022-04-28 03:55:12,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {6775#false} assume !false; {6775#false} is VALID [2022-04-28 03:55:12,462 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:55:12,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:55:12,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {6775#false} assume !false; {6775#false} is VALID [2022-04-28 03:55:12,819 INFO L290 TraceCheckUtils]: 12: Hoare triple {6827#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6775#false} is VALID [2022-04-28 03:55:12,819 INFO L290 TraceCheckUtils]: 11: Hoare triple {6823#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6827#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:55:12,820 INFO L272 TraceCheckUtils]: 10: Hoare triple {6782#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {6823#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:55:12,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {6846#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [116] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {6782#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:55:12,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {6850#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [119] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_495)) (.cse2 (= v_main_~x~0_495 v_main_~x~0_494)) (.cse3 (= v_main_~y~0_313 v_main_~y~0_312))) (or (let ((.cse1 (+ v_main_~x~0_495 v_main_~y~0_312))) (and .cse0 (= .cse1 (+ v_main_~x~0_494 v_main_~y~0_313)) (< .cse1 (+ v_main_~y~0_313 1000001)) (< v_main_~y~0_313 v_main_~y~0_312))) (and (or (not .cse0) (not (< v_main_~x~0_495 1000000))) .cse2 .cse3) (and .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_495, main_~y~0=v_main_~y~0_313} OutVars{main_~x~0=v_main_~x~0_494, main_~y~0=v_main_~y~0_312} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {6846#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:12,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {6850#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [118] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6850#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:12,823 INFO L290 TraceCheckUtils]: 6: Hoare triple {6857#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [117] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_493 v_main_~x~0_492))) (or (and (< v_main_~x~0_492 500001) (< v_main_~x~0_493 v_main_~x~0_492)) (and (not (< v_main_~x~0_493 500000)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_493} OutVars{main_~x~0=v_main_~x~0_492} AuxVars[] AssignedVars[main_~x~0] {6850#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:12,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {6774#true} ~x~0 := 0;~y~0 := 500000; {6857#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:12,823 INFO L272 TraceCheckUtils]: 4: Hoare triple {6774#true} call #t~ret4 := main(); {6774#true} is VALID [2022-04-28 03:55:12,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6774#true} {6774#true} #41#return; {6774#true} is VALID [2022-04-28 03:55:12,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {6774#true} assume true; {6774#true} is VALID [2022-04-28 03:55:12,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {6774#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(17, 2);call #Ultimate.allocInit(12, 3); {6774#true} is VALID [2022-04-28 03:55:12,823 INFO L272 TraceCheckUtils]: 0: Hoare triple {6774#true} call ULTIMATE.init(); {6774#true} is VALID [2022-04-28 03:55:12,824 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:55:12,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155690425] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:55:12,824 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:55:12,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 03:55:13,543 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:55:13,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [597945828] [2022-04-28 03:55:13,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [597945828] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:55:13,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:55:13,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 03:55:13,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995573889] [2022-04-28 03:55:13,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:55:13,543 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.88) internal successors, (47), 24 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:55:13,543 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:55:13,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 25 states have (on average 1.88) internal successors, (47), 24 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:55:13,582 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:55:13,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 03:55:13,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:55:13,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 03:55:13,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1164, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 03:55:13,583 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 26 states, 25 states have (on average 1.88) internal successors, (47), 24 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:55:15,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:15,380 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2022-04-28 03:55:15,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 03:55:15,383 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.88) internal successors, (47), 24 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:55:15,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:55:15,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.88) internal successors, (47), 24 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:55:15,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 67 transitions. [2022-04-28 03:55:15,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.88) internal successors, (47), 24 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:55:15,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 67 transitions. [2022-04-28 03:55:15,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 67 transitions. [2022-04-28 03:55:15,440 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:55:15,441 INFO L225 Difference]: With dead ends: 62 [2022-04-28 03:55:15,441 INFO L226 Difference]: Without dead ends: 55 [2022-04-28 03:55:15,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=471, Invalid=2951, Unknown=0, NotChecked=0, Total=3422 [2022-04-28 03:55:15,442 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 47 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:55:15,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 63 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 03:55:15,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-28 03:55:15,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-28 03:55:15,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:55:15,574 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.08) internal successors, (54), 50 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:15,574 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.08) internal successors, (54), 50 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:15,574 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.08) internal successors, (54), 50 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:15,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:15,575 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2022-04-28 03:55:15,575 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2022-04-28 03:55:15,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:55:15,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:55:15,575 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.08) internal successors, (54), 50 states have internal predecessors, (54), 3 states have call successors, (3), 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:55:15,575 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.08) internal successors, (54), 50 states have internal predecessors, (54), 3 states have call successors, (3), 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:55:15,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:15,576 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2022-04-28 03:55:15,576 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2022-04-28 03:55:15,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:55:15,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:55:15,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:55:15,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:55:15,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.08) internal successors, (54), 50 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:15,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2022-04-28 03:55:15,577 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 51 [2022-04-28 03:55:15,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:55:15,577 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2022-04-28 03:55:15,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.88) internal successors, (47), 24 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:55:15,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 58 transitions. [2022-04-28 03:55:15,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:55:15,630 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2022-04-28 03:55:15,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-28 03:55:15,631 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:55:15,631 INFO L195 NwaCegarLoop]: trace histogram [21, 19, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:55:15,647 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:55:15,831 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:55:15,831 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:55:15,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:55:15,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1926111106, now seen corresponding path program 19 times [2022-04-28 03:55:15,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:55:15,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [946281776] [2022-04-28 03:55:15,913 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:55:19,525 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:55:19,612 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:55:19,613 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:55:19,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1159455313, now seen corresponding path program 1 times [2022-04-28 03:55:19,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:55:19,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452285236] [2022-04-28 03:55:19,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:55:19,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:55:19,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:19,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:55:19,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:19,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {7295#(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(17, 2);call #Ultimate.allocInit(12, 3); {7284#true} is VALID [2022-04-28 03:55:19,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {7284#true} assume true; {7284#true} is VALID [2022-04-28 03:55:19,698 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7284#true} {7284#true} #41#return; {7284#true} is VALID [2022-04-28 03:55:19,698 INFO L272 TraceCheckUtils]: 0: Hoare triple {7284#true} call ULTIMATE.init(); {7295#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:55:19,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {7295#(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(17, 2);call #Ultimate.allocInit(12, 3); {7284#true} is VALID [2022-04-28 03:55:19,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {7284#true} assume true; {7284#true} is VALID [2022-04-28 03:55:19,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7284#true} {7284#true} #41#return; {7284#true} is VALID [2022-04-28 03:55:19,698 INFO L272 TraceCheckUtils]: 4: Hoare triple {7284#true} call #t~ret4 := main(); {7284#true} is VALID [2022-04-28 03:55:19,699 INFO L290 TraceCheckUtils]: 5: Hoare triple {7284#true} ~x~0 := 0;~y~0 := 500000; {7289#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:55:19,699 INFO L290 TraceCheckUtils]: 6: Hoare triple {7289#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [121] L11-2-->L10-2_primed: Formula: (or (and (< v_main_~x~0_530 v_main_~x~0_529) (< v_main_~x~0_529 500001)) (= v_main_~x~0_530 v_main_~x~0_529) (and (= v_main_~x~0_529 v_main_~x~0_530) (<= 500000 v_main_~x~0_530))) InVars {main_~x~0=v_main_~x~0_530} OutVars{main_~x~0=v_main_~x~0_529} AuxVars[] AssignedVars[main_~x~0] {7290#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:55:19,700 INFO L290 TraceCheckUtils]: 7: Hoare triple {7290#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [122] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7290#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:55:19,700 INFO L290 TraceCheckUtils]: 8: Hoare triple {7290#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [123] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_532)) (.cse1 (= v_main_~x~0_532 v_main_~x~0_531))) (or (and (< v_main_~x~0_531 1000001) (= (+ v_main_~x~0_532 v_main_~y~0_339) (+ v_main_~x~0_531 v_main_~y~0_340)) .cse0 (< v_main_~x~0_532 v_main_~x~0_531)) (and .cse1 (or (not .cse0) (not (< v_main_~x~0_532 1000000))) (= v_main_~y~0_339 v_main_~y~0_340)) (and .cse1 (= v_main_~y~0_340 v_main_~y~0_339)))) InVars {main_~x~0=v_main_~x~0_532, main_~y~0=v_main_~y~0_340} OutVars{main_~x~0=v_main_~x~0_531, main_~y~0=v_main_~y~0_339} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {7291#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:55:19,701 INFO L290 TraceCheckUtils]: 9: Hoare triple {7291#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [120] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {7292#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-28 03:55:19,701 INFO L272 TraceCheckUtils]: 10: Hoare triple {7292#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {7293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:55:19,702 INFO L290 TraceCheckUtils]: 11: Hoare triple {7293#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {7294#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:55:19,702 INFO L290 TraceCheckUtils]: 12: Hoare triple {7294#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {7285#false} is VALID [2022-04-28 03:55:19,702 INFO L290 TraceCheckUtils]: 13: Hoare triple {7285#false} assume !false; {7285#false} is VALID [2022-04-28 03:55:19,702 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:55:19,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:55:19,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452285236] [2022-04-28 03:55:19,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452285236] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:55:19,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237832129] [2022-04-28 03:55:19,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:55:19,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:55:19,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:55:19,704 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:55:19,706 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:55:19,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:19,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:55:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:19,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:55:20,071 INFO L272 TraceCheckUtils]: 0: Hoare triple {7284#true} call ULTIMATE.init(); {7284#true} is VALID [2022-04-28 03:55:20,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {7284#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(17, 2);call #Ultimate.allocInit(12, 3); {7284#true} is VALID [2022-04-28 03:55:20,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {7284#true} assume true; {7284#true} is VALID [2022-04-28 03:55:20,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7284#true} {7284#true} #41#return; {7284#true} is VALID [2022-04-28 03:55:20,072 INFO L272 TraceCheckUtils]: 4: Hoare triple {7284#true} call #t~ret4 := main(); {7284#true} is VALID [2022-04-28 03:55:20,072 INFO L290 TraceCheckUtils]: 5: Hoare triple {7284#true} ~x~0 := 0;~y~0 := 500000; {7314#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:55:20,073 INFO L290 TraceCheckUtils]: 6: Hoare triple {7314#(and (<= main_~x~0 0) (= main_~y~0 500000))} [121] L11-2-->L10-2_primed: Formula: (or (and (< v_main_~x~0_530 v_main_~x~0_529) (< v_main_~x~0_529 500001)) (= v_main_~x~0_530 v_main_~x~0_529) (and (= v_main_~x~0_529 v_main_~x~0_530) (<= 500000 v_main_~x~0_530))) InVars {main_~x~0=v_main_~x~0_530} OutVars{main_~x~0=v_main_~x~0_529} AuxVars[] AssignedVars[main_~x~0] {7318#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:55:20,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {7318#(and (= main_~y~0 500000) (< main_~x~0 500001))} [122] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7318#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:55:20,074 INFO L290 TraceCheckUtils]: 8: Hoare triple {7318#(and (= main_~y~0 500000) (< main_~x~0 500001))} [123] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_532)) (.cse1 (= v_main_~x~0_532 v_main_~x~0_531))) (or (and (< v_main_~x~0_531 1000001) (= (+ v_main_~x~0_532 v_main_~y~0_339) (+ v_main_~x~0_531 v_main_~y~0_340)) .cse0 (< v_main_~x~0_532 v_main_~x~0_531)) (and .cse1 (or (not .cse0) (not (< v_main_~x~0_532 1000000))) (= v_main_~y~0_339 v_main_~y~0_340)) (and .cse1 (= v_main_~y~0_340 v_main_~y~0_339)))) InVars {main_~x~0=v_main_~x~0_532, main_~y~0=v_main_~y~0_340} OutVars{main_~x~0=v_main_~x~0_531, main_~y~0=v_main_~y~0_339} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {7325#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:20,074 INFO L290 TraceCheckUtils]: 9: Hoare triple {7325#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [120] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {7329#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:55:20,075 INFO L272 TraceCheckUtils]: 10: Hoare triple {7329#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {7333#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:55:20,075 INFO L290 TraceCheckUtils]: 11: Hoare triple {7333#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7337#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:55:20,076 INFO L290 TraceCheckUtils]: 12: Hoare triple {7337#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7285#false} is VALID [2022-04-28 03:55:20,076 INFO L290 TraceCheckUtils]: 13: Hoare triple {7285#false} assume !false; {7285#false} is VALID [2022-04-28 03:55:20,076 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:55:20,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:55:20,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {7285#false} assume !false; {7285#false} is VALID [2022-04-28 03:55:20,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {7337#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7285#false} is VALID [2022-04-28 03:55:20,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {7333#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7337#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:55:20,414 INFO L272 TraceCheckUtils]: 10: Hoare triple {7292#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {7333#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:55:20,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {7356#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [120] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {7292#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-28 03:55:20,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {7360#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [123] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_532)) (.cse1 (= v_main_~x~0_532 v_main_~x~0_531))) (or (and (< v_main_~x~0_531 1000001) (= (+ v_main_~x~0_532 v_main_~y~0_339) (+ v_main_~x~0_531 v_main_~y~0_340)) .cse0 (< v_main_~x~0_532 v_main_~x~0_531)) (and .cse1 (or (not .cse0) (not (< v_main_~x~0_532 1000000))) (= v_main_~y~0_339 v_main_~y~0_340)) (and .cse1 (= v_main_~y~0_340 v_main_~y~0_339)))) InVars {main_~x~0=v_main_~x~0_532, main_~y~0=v_main_~y~0_340} OutVars{main_~x~0=v_main_~x~0_531, main_~y~0=v_main_~y~0_339} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {7356#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:55:20,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {7360#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [122] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7360#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:55:20,416 INFO L290 TraceCheckUtils]: 6: Hoare triple {7367#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} [121] L11-2-->L10-2_primed: Formula: (or (and (< v_main_~x~0_530 v_main_~x~0_529) (< v_main_~x~0_529 500001)) (= v_main_~x~0_530 v_main_~x~0_529) (and (= v_main_~x~0_529 v_main_~x~0_530) (<= 500000 v_main_~x~0_530))) InVars {main_~x~0=v_main_~x~0_530} OutVars{main_~x~0=v_main_~x~0_529} AuxVars[] AssignedVars[main_~x~0] {7360#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:55:20,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {7284#true} ~x~0 := 0;~y~0 := 500000; {7367#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:55:20,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {7284#true} call #t~ret4 := main(); {7284#true} is VALID [2022-04-28 03:55:20,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7284#true} {7284#true} #41#return; {7284#true} is VALID [2022-04-28 03:55:20,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {7284#true} assume true; {7284#true} is VALID [2022-04-28 03:55:20,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {7284#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(17, 2);call #Ultimate.allocInit(12, 3); {7284#true} is VALID [2022-04-28 03:55:20,417 INFO L272 TraceCheckUtils]: 0: Hoare triple {7284#true} call ULTIMATE.init(); {7284#true} is VALID [2022-04-28 03:55:20,417 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:55:20,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237832129] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:55:20,417 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:55:20,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 03:55:21,158 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:55:21,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [946281776] [2022-04-28 03:55:21,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [946281776] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:55:21,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:55:21,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-28 03:55:21,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293175774] [2022-04-28 03:55:21,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:55:21,159 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 25 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:55:21,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:55:21,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 25 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:55:21,196 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:55:21,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-28 03:55:21,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:55:21,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-28 03:55:21,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1232, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 03:55:21,197 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 27 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 25 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:55:23,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:23,151 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2022-04-28 03:55:23,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 03:55:23,151 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 25 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:55:23,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:55:23,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 25 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:55:23,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 69 transitions. [2022-04-28 03:55:23,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 25 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:55:23,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 69 transitions. [2022-04-28 03:55:23,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 69 transitions. [2022-04-28 03:55:23,205 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:55:23,206 INFO L225 Difference]: With dead ends: 64 [2022-04-28 03:55:23,206 INFO L226 Difference]: Without dead ends: 57 [2022-04-28 03:55:23,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 898 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=490, Invalid=3170, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 03:55:23,207 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 49 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 03:55:23,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 68 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 03:55:23,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-28 03:55:23,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-28 03:55:23,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:55:23,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:23,326 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:23,326 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:23,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:23,327 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2022-04-28 03:55:23,327 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2022-04-28 03:55:23,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:55:23,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:55:23,327 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-28 03:55:23,327 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-28 03:55:23,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:23,328 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2022-04-28 03:55:23,328 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2022-04-28 03:55:23,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:55:23,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:55:23,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:55:23,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:55:23,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:23,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2022-04-28 03:55:23,329 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 53 [2022-04-28 03:55:23,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:55:23,329 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2022-04-28 03:55:23,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 25 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:55:23,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 60 transitions. [2022-04-28 03:55:23,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:55:23,376 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2022-04-28 03:55:23,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 03:55:23,376 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:55:23,376 INFO L195 NwaCegarLoop]: trace histogram [22, 20, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:55:23,394 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:55:23,591 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:55:23,591 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:55:23,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:55:23,592 INFO L85 PathProgramCache]: Analyzing trace with hash 374564569, now seen corresponding path program 20 times [2022-04-28 03:55:23,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:55:23,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1761867667] [2022-04-28 03:55:23,668 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:55:23,834 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:55:23,835 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:55:23,836 INFO L85 PathProgramCache]: Analyzing trace with hash 890076847, now seen corresponding path program 1 times [2022-04-28 03:55:23,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:55:23,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753435179] [2022-04-28 03:55:23,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:55:23,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:55:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:23,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:55:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:23,919 INFO L290 TraceCheckUtils]: 0: Hoare triple {7820#(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(17, 2);call #Ultimate.allocInit(12, 3); {7809#true} is VALID [2022-04-28 03:55:23,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {7809#true} assume true; {7809#true} is VALID [2022-04-28 03:55:23,919 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7809#true} {7809#true} #41#return; {7809#true} is VALID [2022-04-28 03:55:23,920 INFO L272 TraceCheckUtils]: 0: Hoare triple {7809#true} call ULTIMATE.init(); {7820#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:55:23,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {7820#(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(17, 2);call #Ultimate.allocInit(12, 3); {7809#true} is VALID [2022-04-28 03:55:23,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {7809#true} assume true; {7809#true} is VALID [2022-04-28 03:55:23,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7809#true} {7809#true} #41#return; {7809#true} is VALID [2022-04-28 03:55:23,920 INFO L272 TraceCheckUtils]: 4: Hoare triple {7809#true} call #t~ret4 := main(); {7809#true} is VALID [2022-04-28 03:55:23,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {7809#true} ~x~0 := 0;~y~0 := 500000; {7814#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:55:23,921 INFO L290 TraceCheckUtils]: 6: Hoare triple {7814#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [125] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_568 v_main_~x~0_567))) (or (and (<= 500000 v_main_~x~0_568) .cse0) (and (< v_main_~x~0_567 500001) (< v_main_~x~0_568 v_main_~x~0_567)) .cse0)) InVars {main_~x~0=v_main_~x~0_568} OutVars{main_~x~0=v_main_~x~0_567} AuxVars[] AssignedVars[main_~x~0] {7815#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:55:23,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {7815#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [126] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7815#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:55:23,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {7815#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [127] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_570))) (or (and (= v_main_~y~0_368 v_main_~y~0_367) (= v_main_~x~0_570 v_main_~x~0_569)) (and (< v_main_~x~0_569 1000001) (< v_main_~x~0_570 v_main_~x~0_569) (= (+ v_main_~x~0_570 v_main_~y~0_367) (+ v_main_~x~0_569 v_main_~y~0_368)) .cse0) (and (or (not (< v_main_~x~0_570 1000000)) (not .cse0)) (= v_main_~x~0_569 v_main_~x~0_570) (= v_main_~y~0_367 v_main_~y~0_368)))) InVars {main_~x~0=v_main_~x~0_570, main_~y~0=v_main_~y~0_368} OutVars{main_~x~0=v_main_~x~0_569, main_~y~0=v_main_~y~0_367} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {7816#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:23,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {7816#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [124] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {7817#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:55:23,923 INFO L272 TraceCheckUtils]: 10: Hoare triple {7817#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {7818#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:55:23,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {7818#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {7819#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:55:23,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {7819#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {7810#false} is VALID [2022-04-28 03:55:23,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {7810#false} assume !false; {7810#false} is VALID [2022-04-28 03:55:23,924 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:55:23,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:55:23,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753435179] [2022-04-28 03:55:23,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753435179] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:55:23,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124548620] [2022-04-28 03:55:23,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:55:23,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:55:23,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:55:23,925 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:55:23,926 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:55:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:23,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:55:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:23,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:55:24,329 INFO L272 TraceCheckUtils]: 0: Hoare triple {7809#true} call ULTIMATE.init(); {7809#true} is VALID [2022-04-28 03:55:24,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {7809#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(17, 2);call #Ultimate.allocInit(12, 3); {7809#true} is VALID [2022-04-28 03:55:24,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {7809#true} assume true; {7809#true} is VALID [2022-04-28 03:55:24,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7809#true} {7809#true} #41#return; {7809#true} is VALID [2022-04-28 03:55:24,329 INFO L272 TraceCheckUtils]: 4: Hoare triple {7809#true} call #t~ret4 := main(); {7809#true} is VALID [2022-04-28 03:55:24,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {7809#true} ~x~0 := 0;~y~0 := 500000; {7839#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:55:24,330 INFO L290 TraceCheckUtils]: 6: Hoare triple {7839#(and (<= main_~x~0 0) (= main_~y~0 500000))} [125] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_568 v_main_~x~0_567))) (or (and (<= 500000 v_main_~x~0_568) .cse0) (and (< v_main_~x~0_567 500001) (< v_main_~x~0_568 v_main_~x~0_567)) .cse0)) InVars {main_~x~0=v_main_~x~0_568} OutVars{main_~x~0=v_main_~x~0_567} AuxVars[] AssignedVars[main_~x~0] {7843#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:55:24,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {7843#(and (= main_~y~0 500000) (< main_~x~0 500001))} [126] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7843#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:55:24,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {7843#(and (= main_~y~0 500000) (< main_~x~0 500001))} [127] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_570))) (or (and (= v_main_~y~0_368 v_main_~y~0_367) (= v_main_~x~0_570 v_main_~x~0_569)) (and (< v_main_~x~0_569 1000001) (< v_main_~x~0_570 v_main_~x~0_569) (= (+ v_main_~x~0_570 v_main_~y~0_367) (+ v_main_~x~0_569 v_main_~y~0_368)) .cse0) (and (or (not (< v_main_~x~0_570 1000000)) (not .cse0)) (= v_main_~x~0_569 v_main_~x~0_570) (= v_main_~y~0_367 v_main_~y~0_368)))) InVars {main_~x~0=v_main_~x~0_570, main_~y~0=v_main_~y~0_368} OutVars{main_~x~0=v_main_~x~0_569, main_~y~0=v_main_~y~0_367} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {7850#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:24,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {7850#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [124] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {7854#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:55:24,333 INFO L272 TraceCheckUtils]: 10: Hoare triple {7854#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {7858#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:55:24,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {7858#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7862#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:55:24,333 INFO L290 TraceCheckUtils]: 12: Hoare triple {7862#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7810#false} is VALID [2022-04-28 03:55:24,333 INFO L290 TraceCheckUtils]: 13: Hoare triple {7810#false} assume !false; {7810#false} is VALID [2022-04-28 03:55:24,333 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:55:24,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:55:24,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {7810#false} assume !false; {7810#false} is VALID [2022-04-28 03:55:24,634 INFO L290 TraceCheckUtils]: 12: Hoare triple {7862#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7810#false} is VALID [2022-04-28 03:55:24,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {7858#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7862#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:55:24,635 INFO L272 TraceCheckUtils]: 10: Hoare triple {7817#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {7858#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:55:24,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {7881#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [124] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {7817#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:55:24,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {7885#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [127] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_570))) (or (and (= v_main_~y~0_368 v_main_~y~0_367) (= v_main_~x~0_570 v_main_~x~0_569)) (and (< v_main_~x~0_569 1000001) (< v_main_~x~0_570 v_main_~x~0_569) (= (+ v_main_~x~0_570 v_main_~y~0_367) (+ v_main_~x~0_569 v_main_~y~0_368)) .cse0) (and (or (not (< v_main_~x~0_570 1000000)) (not .cse0)) (= v_main_~x~0_569 v_main_~x~0_570) (= v_main_~y~0_367 v_main_~y~0_368)))) InVars {main_~x~0=v_main_~x~0_570, main_~y~0=v_main_~y~0_368} OutVars{main_~x~0=v_main_~x~0_569, main_~y~0=v_main_~y~0_367} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {7881#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:24,637 INFO L290 TraceCheckUtils]: 7: Hoare triple {7885#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [126] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7885#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:24,637 INFO L290 TraceCheckUtils]: 6: Hoare triple {7892#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [125] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_568 v_main_~x~0_567))) (or (and (<= 500000 v_main_~x~0_568) .cse0) (and (< v_main_~x~0_567 500001) (< v_main_~x~0_568 v_main_~x~0_567)) .cse0)) InVars {main_~x~0=v_main_~x~0_568} OutVars{main_~x~0=v_main_~x~0_567} AuxVars[] AssignedVars[main_~x~0] {7885#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:24,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {7809#true} ~x~0 := 0;~y~0 := 500000; {7892#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:55:24,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {7809#true} call #t~ret4 := main(); {7809#true} is VALID [2022-04-28 03:55:24,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7809#true} {7809#true} #41#return; {7809#true} is VALID [2022-04-28 03:55:24,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {7809#true} assume true; {7809#true} is VALID [2022-04-28 03:55:24,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {7809#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(17, 2);call #Ultimate.allocInit(12, 3); {7809#true} is VALID [2022-04-28 03:55:24,638 INFO L272 TraceCheckUtils]: 0: Hoare triple {7809#true} call ULTIMATE.init(); {7809#true} is VALID [2022-04-28 03:55:24,638 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:55:24,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124548620] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:55:24,638 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:55:24,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 03:55:25,420 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:55:25,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1761867667] [2022-04-28 03:55:25,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1761867667] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:55:25,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:55:25,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-28 03:55:25,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914285067] [2022-04-28 03:55:25,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:55:25,421 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 26 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:55:25,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:55:25,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 26 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:55:25,459 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:55:25,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-28 03:55:25,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:55:25,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-28 03:55:25,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=1302, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 03:55:25,461 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 26 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:55:27,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:27,728 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2022-04-28 03:55:27,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 03:55:27,728 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 26 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:55:27,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:55:27,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 26 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:55:27,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 71 transitions. [2022-04-28 03:55:27,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 26 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:55:27,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 71 transitions. [2022-04-28 03:55:27,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 71 transitions. [2022-04-28 03:55:27,797 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:55:27,798 INFO L225 Difference]: With dead ends: 66 [2022-04-28 03:55:27,798 INFO L226 Difference]: Without dead ends: 59 [2022-04-28 03:55:27,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 947 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=509, Invalid=3397, Unknown=0, NotChecked=0, Total=3906 [2022-04-28 03:55:27,800 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 51 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:55:27,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 108 Invalid, 1242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 03:55:27,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-28 03:55:27,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-28 03:55:27,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:55:27,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.0740740740740742) internal successors, (58), 54 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:27,954 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.0740740740740742) internal successors, (58), 54 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:27,954 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.0740740740740742) internal successors, (58), 54 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:27,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:27,954 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2022-04-28 03:55:27,954 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2022-04-28 03:55:27,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:55:27,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:55:27,955 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 54 states have (on average 1.0740740740740742) internal successors, (58), 54 states have internal predecessors, (58), 3 states have call successors, (3), 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:55:27,955 INFO L87 Difference]: Start difference. First operand has 59 states, 54 states have (on average 1.0740740740740742) internal successors, (58), 54 states have internal predecessors, (58), 3 states have call successors, (3), 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:55:27,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:27,955 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2022-04-28 03:55:27,956 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2022-04-28 03:55:27,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:55:27,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:55:27,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:55:27,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:55:27,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.0740740740740742) internal successors, (58), 54 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:27,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2022-04-28 03:55:27,957 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 55 [2022-04-28 03:55:27,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:55:27,957 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2022-04-28 03:55:27,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 26 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:55:27,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 62 transitions. [2022-04-28 03:55:28,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:55:28,015 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2022-04-28 03:55:28,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-28 03:55:28,015 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:55:28,015 INFO L195 NwaCegarLoop]: trace histogram [23, 21, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:55:28,034 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:55:28,215 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:55:28,216 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:55:28,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:55:28,216 INFO L85 PathProgramCache]: Analyzing trace with hash -584269196, now seen corresponding path program 21 times [2022-04-28 03:55:28,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:55:28,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [100011359] [2022-04-28 03:55:28,308 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:55:28,476 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:55:28,477 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:55:28,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1355358289, now seen corresponding path program 1 times [2022-04-28 03:55:28,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:55:28,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322510630] [2022-04-28 03:55:28,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:55:28,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:55:28,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:28,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:55:28,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:28,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {8360#(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(17, 2);call #Ultimate.allocInit(12, 3); {8349#true} is VALID [2022-04-28 03:55:28,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {8349#true} assume true; {8349#true} is VALID [2022-04-28 03:55:28,577 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8349#true} {8349#true} #41#return; {8349#true} is VALID [2022-04-28 03:55:28,577 INFO L272 TraceCheckUtils]: 0: Hoare triple {8349#true} call ULTIMATE.init(); {8360#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:55:28,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {8360#(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(17, 2);call #Ultimate.allocInit(12, 3); {8349#true} is VALID [2022-04-28 03:55:28,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {8349#true} assume true; {8349#true} is VALID [2022-04-28 03:55:28,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8349#true} {8349#true} #41#return; {8349#true} is VALID [2022-04-28 03:55:28,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {8349#true} call #t~ret4 := main(); {8349#true} is VALID [2022-04-28 03:55:28,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {8349#true} ~x~0 := 0;~y~0 := 500000; {8354#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:55:28,578 INFO L290 TraceCheckUtils]: 6: Hoare triple {8354#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [129] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_607 v_main_~x~0_606))) (or (and (< v_main_~x~0_607 v_main_~x~0_606) (< v_main_~x~0_606 500001)) (and .cse0 (not (< v_main_~x~0_607 500000))) .cse0)) InVars {main_~x~0=v_main_~x~0_607} OutVars{main_~x~0=v_main_~x~0_606} AuxVars[] AssignedVars[main_~x~0] {8355#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:55:28,579 INFO L290 TraceCheckUtils]: 7: Hoare triple {8355#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [130] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8355#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:55:28,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {8355#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [131] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_609 v_main_~x~0_608)) (.cse1 (= v_main_~y~0_397 v_main_~y~0_396)) (.cse2 (<= 500000 v_main_~x~0_609))) (or (and .cse0 .cse1) (and .cse0 .cse1 (or (not (< v_main_~x~0_609 1000000)) (not .cse2))) (let ((.cse3 (+ v_main_~x~0_609 v_main_~y~0_396))) (and (= .cse3 (+ v_main_~x~0_608 v_main_~y~0_397)) (< v_main_~y~0_397 v_main_~y~0_396) .cse2 (< .cse3 (+ v_main_~y~0_397 1000001)))))) InVars {main_~x~0=v_main_~x~0_609, main_~y~0=v_main_~y~0_397} OutVars{main_~x~0=v_main_~x~0_608, main_~y~0=v_main_~y~0_396} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {8356#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} is VALID [2022-04-28 03:55:28,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {8356#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} [128] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {8357#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:55:28,581 INFO L272 TraceCheckUtils]: 10: Hoare triple {8357#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {8358#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:55:28,581 INFO L290 TraceCheckUtils]: 11: Hoare triple {8358#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {8359#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:55:28,581 INFO L290 TraceCheckUtils]: 12: Hoare triple {8359#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {8350#false} is VALID [2022-04-28 03:55:28,581 INFO L290 TraceCheckUtils]: 13: Hoare triple {8350#false} assume !false; {8350#false} is VALID [2022-04-28 03:55:28,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:55:28,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:55:28,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322510630] [2022-04-28 03:55:28,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322510630] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:55:28,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851443602] [2022-04-28 03:55:28,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:55:28,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:55:28,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:55:28,583 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:55:28,583 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:55:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:28,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:55:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:28,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:55:28,952 INFO L272 TraceCheckUtils]: 0: Hoare triple {8349#true} call ULTIMATE.init(); {8349#true} is VALID [2022-04-28 03:55:28,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {8349#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(17, 2);call #Ultimate.allocInit(12, 3); {8349#true} is VALID [2022-04-28 03:55:28,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {8349#true} assume true; {8349#true} is VALID [2022-04-28 03:55:28,952 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8349#true} {8349#true} #41#return; {8349#true} is VALID [2022-04-28 03:55:28,952 INFO L272 TraceCheckUtils]: 4: Hoare triple {8349#true} call #t~ret4 := main(); {8349#true} is VALID [2022-04-28 03:55:28,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {8349#true} ~x~0 := 0;~y~0 := 500000; {8379#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:55:28,953 INFO L290 TraceCheckUtils]: 6: Hoare triple {8379#(and (<= main_~x~0 0) (= main_~y~0 500000))} [129] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_607 v_main_~x~0_606))) (or (and (< v_main_~x~0_607 v_main_~x~0_606) (< v_main_~x~0_606 500001)) (and .cse0 (not (< v_main_~x~0_607 500000))) .cse0)) InVars {main_~x~0=v_main_~x~0_607} OutVars{main_~x~0=v_main_~x~0_606} AuxVars[] AssignedVars[main_~x~0] {8383#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:55:28,953 INFO L290 TraceCheckUtils]: 7: Hoare triple {8383#(and (= main_~y~0 500000) (< main_~x~0 500001))} [130] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8383#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:55:28,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {8383#(and (= main_~y~0 500000) (< main_~x~0 500001))} [131] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_609 v_main_~x~0_608)) (.cse1 (= v_main_~y~0_397 v_main_~y~0_396)) (.cse2 (<= 500000 v_main_~x~0_609))) (or (and .cse0 .cse1) (and .cse0 .cse1 (or (not (< v_main_~x~0_609 1000000)) (not .cse2))) (let ((.cse3 (+ v_main_~x~0_609 v_main_~y~0_396))) (and (= .cse3 (+ v_main_~x~0_608 v_main_~y~0_397)) (< v_main_~y~0_397 v_main_~y~0_396) .cse2 (< .cse3 (+ v_main_~y~0_397 1000001)))))) InVars {main_~x~0=v_main_~x~0_609, main_~y~0=v_main_~y~0_397} OutVars{main_~x~0=v_main_~x~0_608, main_~y~0=v_main_~y~0_396} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {8390#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:28,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {8390#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [128] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {8394#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:55:28,955 INFO L272 TraceCheckUtils]: 10: Hoare triple {8394#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {8398#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:55:28,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {8398#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8402#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:55:28,956 INFO L290 TraceCheckUtils]: 12: Hoare triple {8402#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8350#false} is VALID [2022-04-28 03:55:28,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {8350#false} assume !false; {8350#false} is VALID [2022-04-28 03:55:28,956 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:55:28,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:55:29,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {8350#false} assume !false; {8350#false} is VALID [2022-04-28 03:55:29,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {8402#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8350#false} is VALID [2022-04-28 03:55:29,263 INFO L290 TraceCheckUtils]: 11: Hoare triple {8398#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8402#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:55:29,263 INFO L272 TraceCheckUtils]: 10: Hoare triple {8357#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {8398#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:55:29,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {8421#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [128] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {8357#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:55:29,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {8425#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [131] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_609 v_main_~x~0_608)) (.cse1 (= v_main_~y~0_397 v_main_~y~0_396)) (.cse2 (<= 500000 v_main_~x~0_609))) (or (and .cse0 .cse1) (and .cse0 .cse1 (or (not (< v_main_~x~0_609 1000000)) (not .cse2))) (let ((.cse3 (+ v_main_~x~0_609 v_main_~y~0_396))) (and (= .cse3 (+ v_main_~x~0_608 v_main_~y~0_397)) (< v_main_~y~0_397 v_main_~y~0_396) .cse2 (< .cse3 (+ v_main_~y~0_397 1000001)))))) InVars {main_~x~0=v_main_~x~0_609, main_~y~0=v_main_~y~0_397} OutVars{main_~x~0=v_main_~x~0_608, main_~y~0=v_main_~y~0_396} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {8421#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:29,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {8425#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [130] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8425#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:29,266 INFO L290 TraceCheckUtils]: 6: Hoare triple {8432#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [129] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_607 v_main_~x~0_606))) (or (and (< v_main_~x~0_607 v_main_~x~0_606) (< v_main_~x~0_606 500001)) (and .cse0 (not (< v_main_~x~0_607 500000))) .cse0)) InVars {main_~x~0=v_main_~x~0_607} OutVars{main_~x~0=v_main_~x~0_606} AuxVars[] AssignedVars[main_~x~0] {8425#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:29,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {8349#true} ~x~0 := 0;~y~0 := 500000; {8432#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:29,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {8349#true} call #t~ret4 := main(); {8349#true} is VALID [2022-04-28 03:55:29,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8349#true} {8349#true} #41#return; {8349#true} is VALID [2022-04-28 03:55:29,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {8349#true} assume true; {8349#true} is VALID [2022-04-28 03:55:29,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {8349#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(17, 2);call #Ultimate.allocInit(12, 3); {8349#true} is VALID [2022-04-28 03:55:29,266 INFO L272 TraceCheckUtils]: 0: Hoare triple {8349#true} call ULTIMATE.init(); {8349#true} is VALID [2022-04-28 03:55:29,267 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:55:29,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851443602] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:55:29,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:55:29,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 03:55:30,086 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:55:30,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [100011359] [2022-04-28 03:55:30,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [100011359] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:55:30,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:55:30,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-28 03:55:30,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506245629] [2022-04-28 03:55:30,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:55:30,087 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 27 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:55:30,087 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:55:30,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 27 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:55:30,128 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:55:30,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-28 03:55:30,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:55:30,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-28 03:55:30,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=1374, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 03:55:30,130 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand has 29 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 27 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:55:32,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:32,507 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2022-04-28 03:55:32,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 03:55:32,507 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 27 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:55:32,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:55:32,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 27 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:55:32,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 73 transitions. [2022-04-28 03:55:32,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 27 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:55:32,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 73 transitions. [2022-04-28 03:55:32,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 73 transitions. [2022-04-28 03:55:32,563 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:55:32,564 INFO L225 Difference]: With dead ends: 68 [2022-04-28 03:55:32,564 INFO L226 Difference]: Without dead ends: 61 [2022-04-28 03:55:32,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 997 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=528, Invalid=3632, Unknown=0, NotChecked=0, Total=4160 [2022-04-28 03:55:32,566 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 53 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:55:32,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 108 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1246 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 03:55:32,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-28 03:55:32,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-28 03:55:32,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:55:32,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 56 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:32,725 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 56 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:32,725 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 56 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:32,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:32,725 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2022-04-28 03:55:32,725 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2022-04-28 03:55:32,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:55:32,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:55:32,726 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 56 states have internal predecessors, (60), 3 states have call successors, (3), 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:55:32,726 INFO L87 Difference]: Start difference. First operand has 61 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 56 states have internal predecessors, (60), 3 states have call successors, (3), 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:55:32,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:32,730 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2022-04-28 03:55:32,730 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2022-04-28 03:55:32,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:55:32,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:55:32,739 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:55:32,739 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:55:32,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 56 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:32,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2022-04-28 03:55:32,740 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 57 [2022-04-28 03:55:32,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:55:32,740 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2022-04-28 03:55:32,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 27 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:55:32,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 64 transitions. [2022-04-28 03:55:32,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:55:32,793 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2022-04-28 03:55:32,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 03:55:32,793 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:55:32,793 INFO L195 NwaCegarLoop]: trace histogram [24, 22, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:55:32,809 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:55:32,994 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:55:32,994 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:55:32,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:55:32,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1394451279, now seen corresponding path program 22 times [2022-04-28 03:55:32,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:55:32,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [202437490] [2022-04-28 03:55:33,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:55:33,253 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:55:33,254 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:55:33,256 INFO L85 PathProgramCache]: Analyzing trace with hash 694173871, now seen corresponding path program 1 times [2022-04-28 03:55:33,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:55:33,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245357286] [2022-04-28 03:55:33,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:55:33,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:55:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:33,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:55:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:33,370 INFO L290 TraceCheckUtils]: 0: Hoare triple {8915#(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(17, 2);call #Ultimate.allocInit(12, 3); {8904#true} is VALID [2022-04-28 03:55:33,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {8904#true} assume true; {8904#true} is VALID [2022-04-28 03:55:33,370 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8904#true} {8904#true} #41#return; {8904#true} is VALID [2022-04-28 03:55:33,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {8904#true} call ULTIMATE.init(); {8915#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:55:33,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {8915#(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(17, 2);call #Ultimate.allocInit(12, 3); {8904#true} is VALID [2022-04-28 03:55:33,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {8904#true} assume true; {8904#true} is VALID [2022-04-28 03:55:33,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8904#true} {8904#true} #41#return; {8904#true} is VALID [2022-04-28 03:55:33,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {8904#true} call #t~ret4 := main(); {8904#true} is VALID [2022-04-28 03:55:33,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {8904#true} ~x~0 := 0;~y~0 := 500000; {8909#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:55:33,376 INFO L290 TraceCheckUtils]: 6: Hoare triple {8909#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [133] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_647 v_main_~x~0_646))) (or .cse0 (and .cse0 (not (< v_main_~x~0_647 500000))) (and (< v_main_~x~0_646 500001) (< v_main_~x~0_647 v_main_~x~0_646)))) InVars {main_~x~0=v_main_~x~0_647} OutVars{main_~x~0=v_main_~x~0_646} AuxVars[] AssignedVars[main_~x~0] {8910#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:55:33,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {8910#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [134] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8910#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:55:33,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {8910#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [135] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_649 v_main_~x~0_648)) (.cse2 (= v_main_~y~0_427 v_main_~y~0_426)) (.cse0 (<= 500000 v_main_~x~0_649))) (or (and .cse0 (= (+ v_main_~x~0_649 v_main_~y~0_426) (+ v_main_~x~0_648 v_main_~y~0_427)) (< v_main_~x~0_649 v_main_~x~0_648) (< v_main_~x~0_648 1000001)) (and .cse1 .cse2) (and .cse1 .cse2 (or (not (< v_main_~x~0_649 1000000)) (not .cse0))))) InVars {main_~x~0=v_main_~x~0_649, main_~y~0=v_main_~y~0_427} OutVars{main_~x~0=v_main_~x~0_648, main_~y~0=v_main_~y~0_426} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {8911#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:55:33,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {8911#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [132] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {8912#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-28 03:55:33,379 INFO L272 TraceCheckUtils]: 10: Hoare triple {8912#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {8913#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:55:33,379 INFO L290 TraceCheckUtils]: 11: Hoare triple {8913#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {8914#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:55:33,380 INFO L290 TraceCheckUtils]: 12: Hoare triple {8914#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {8905#false} is VALID [2022-04-28 03:55:33,380 INFO L290 TraceCheckUtils]: 13: Hoare triple {8905#false} assume !false; {8905#false} is VALID [2022-04-28 03:55:33,380 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:55:33,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:55:33,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245357286] [2022-04-28 03:55:33,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245357286] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:55:33,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197884308] [2022-04-28 03:55:33,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:55:33,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:55:33,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:55:33,381 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:55:33,383 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:55:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:33,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:55:33,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:33,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:55:33,777 INFO L272 TraceCheckUtils]: 0: Hoare triple {8904#true} call ULTIMATE.init(); {8904#true} is VALID [2022-04-28 03:55:33,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {8904#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(17, 2);call #Ultimate.allocInit(12, 3); {8904#true} is VALID [2022-04-28 03:55:33,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {8904#true} assume true; {8904#true} is VALID [2022-04-28 03:55:33,777 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8904#true} {8904#true} #41#return; {8904#true} is VALID [2022-04-28 03:55:33,777 INFO L272 TraceCheckUtils]: 4: Hoare triple {8904#true} call #t~ret4 := main(); {8904#true} is VALID [2022-04-28 03:55:33,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {8904#true} ~x~0 := 0;~y~0 := 500000; {8934#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:55:33,788 INFO L290 TraceCheckUtils]: 6: Hoare triple {8934#(and (<= main_~x~0 0) (= main_~y~0 500000))} [133] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_647 v_main_~x~0_646))) (or .cse0 (and .cse0 (not (< v_main_~x~0_647 500000))) (and (< v_main_~x~0_646 500001) (< v_main_~x~0_647 v_main_~x~0_646)))) InVars {main_~x~0=v_main_~x~0_647} OutVars{main_~x~0=v_main_~x~0_646} AuxVars[] AssignedVars[main_~x~0] {8938#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:55:33,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {8938#(and (= main_~y~0 500000) (< main_~x~0 500001))} [134] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8938#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:55:33,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {8938#(and (= main_~y~0 500000) (< main_~x~0 500001))} [135] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_649 v_main_~x~0_648)) (.cse2 (= v_main_~y~0_427 v_main_~y~0_426)) (.cse0 (<= 500000 v_main_~x~0_649))) (or (and .cse0 (= (+ v_main_~x~0_649 v_main_~y~0_426) (+ v_main_~x~0_648 v_main_~y~0_427)) (< v_main_~x~0_649 v_main_~x~0_648) (< v_main_~x~0_648 1000001)) (and .cse1 .cse2) (and .cse1 .cse2 (or (not (< v_main_~x~0_649 1000000)) (not .cse0))))) InVars {main_~x~0=v_main_~x~0_649, main_~y~0=v_main_~y~0_427} OutVars{main_~x~0=v_main_~x~0_648, main_~y~0=v_main_~y~0_426} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {8945#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:33,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {8945#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [132] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {8949#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:55:33,790 INFO L272 TraceCheckUtils]: 10: Hoare triple {8949#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {8953#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:55:33,791 INFO L290 TraceCheckUtils]: 11: Hoare triple {8953#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8957#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:55:33,791 INFO L290 TraceCheckUtils]: 12: Hoare triple {8957#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8905#false} is VALID [2022-04-28 03:55:33,791 INFO L290 TraceCheckUtils]: 13: Hoare triple {8905#false} assume !false; {8905#false} is VALID [2022-04-28 03:55:33,791 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:55:33,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:55:34,082 INFO L290 TraceCheckUtils]: 13: Hoare triple {8905#false} assume !false; {8905#false} is VALID [2022-04-28 03:55:34,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {8957#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8905#false} is VALID [2022-04-28 03:55:34,083 INFO L290 TraceCheckUtils]: 11: Hoare triple {8953#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8957#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:55:34,084 INFO L272 TraceCheckUtils]: 10: Hoare triple {8912#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {8953#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:55:34,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {8976#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [132] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {8912#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-28 03:55:34,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {8980#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [135] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_649 v_main_~x~0_648)) (.cse2 (= v_main_~y~0_427 v_main_~y~0_426)) (.cse0 (<= 500000 v_main_~x~0_649))) (or (and .cse0 (= (+ v_main_~x~0_649 v_main_~y~0_426) (+ v_main_~x~0_648 v_main_~y~0_427)) (< v_main_~x~0_649 v_main_~x~0_648) (< v_main_~x~0_648 1000001)) (and .cse1 .cse2) (and .cse1 .cse2 (or (not (< v_main_~x~0_649 1000000)) (not .cse0))))) InVars {main_~x~0=v_main_~x~0_649, main_~y~0=v_main_~y~0_427} OutVars{main_~x~0=v_main_~x~0_648, main_~y~0=v_main_~y~0_426} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {8976#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:55:34,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {8980#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [134] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8980#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:55:34,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {8987#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))))} [133] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_647 v_main_~x~0_646))) (or .cse0 (and .cse0 (not (< v_main_~x~0_647 500000))) (and (< v_main_~x~0_646 500001) (< v_main_~x~0_647 v_main_~x~0_646)))) InVars {main_~x~0=v_main_~x~0_647} OutVars{main_~x~0=v_main_~x~0_646} AuxVars[] AssignedVars[main_~x~0] {8980#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:55:34,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {8904#true} ~x~0 := 0;~y~0 := 500000; {8987#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))))} is VALID [2022-04-28 03:55:34,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {8904#true} call #t~ret4 := main(); {8904#true} is VALID [2022-04-28 03:55:34,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8904#true} {8904#true} #41#return; {8904#true} is VALID [2022-04-28 03:55:34,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {8904#true} assume true; {8904#true} is VALID [2022-04-28 03:55:34,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {8904#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(17, 2);call #Ultimate.allocInit(12, 3); {8904#true} is VALID [2022-04-28 03:55:34,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {8904#true} call ULTIMATE.init(); {8904#true} is VALID [2022-04-28 03:55:34,087 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:55:34,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197884308] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:55:34,087 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:55:34,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 03:55:34,965 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:55:34,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [202437490] [2022-04-28 03:55:34,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [202437490] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:55:34,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:55:34,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-28 03:55:34,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076439742] [2022-04-28 03:55:34,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:55:34,966 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.896551724137931) internal successors, (55), 28 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:55:34,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:55:34,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 29 states have (on average 1.896551724137931) internal successors, (55), 28 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:55:35,010 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:55:35,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-28 03:55:35,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:55:35,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-28 03:55:35,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1448, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 03:55:35,011 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand has 30 states, 29 states have (on average 1.896551724137931) internal successors, (55), 28 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:55:37,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:37,631 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2022-04-28 03:55:37,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 03:55:37,631 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.896551724137931) internal successors, (55), 28 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:55:37,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:55:37,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.896551724137931) internal successors, (55), 28 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:55:37,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 75 transitions. [2022-04-28 03:55:37,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.896551724137931) internal successors, (55), 28 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:55:37,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 75 transitions. [2022-04-28 03:55:37,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 75 transitions. [2022-04-28 03:55:37,701 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:55:37,702 INFO L225 Difference]: With dead ends: 70 [2022-04-28 03:55:37,702 INFO L226 Difference]: Without dead ends: 63 [2022-04-28 03:55:37,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=547, Invalid=3875, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 03:55:37,703 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 55 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 1383 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 1436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:55:37,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 128 Invalid, 1436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1383 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 03:55:37,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-28 03:55:37,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-04-28 03:55:37,853 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:55:37,854 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 63 states, 58 states have (on average 1.0689655172413792) internal successors, (62), 58 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:37,854 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 63 states, 58 states have (on average 1.0689655172413792) internal successors, (62), 58 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:37,854 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 63 states, 58 states have (on average 1.0689655172413792) internal successors, (62), 58 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:37,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:37,855 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2022-04-28 03:55:37,855 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2022-04-28 03:55:37,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:55:37,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:55:37,855 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 58 states have (on average 1.0689655172413792) internal successors, (62), 58 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 63 states. [2022-04-28 03:55:37,855 INFO L87 Difference]: Start difference. First operand has 63 states, 58 states have (on average 1.0689655172413792) internal successors, (62), 58 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 63 states. [2022-04-28 03:55:37,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:37,856 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2022-04-28 03:55:37,856 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2022-04-28 03:55:37,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:55:37,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:55:37,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:55:37,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:55:37,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.0689655172413792) internal successors, (62), 58 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:37,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2022-04-28 03:55:37,857 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 59 [2022-04-28 03:55:37,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:55:37,857 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2022-04-28 03:55:37,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.896551724137931) internal successors, (55), 28 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:55:37,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 66 transitions. [2022-04-28 03:55:37,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:55:37,911 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2022-04-28 03:55:37,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-28 03:55:37,911 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:55:37,911 INFO L195 NwaCegarLoop]: trace histogram [25, 23, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:55:37,929 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:55:38,112 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:55:38,112 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:55:38,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:55:38,112 INFO L85 PathProgramCache]: Analyzing trace with hash 274315626, now seen corresponding path program 23 times [2022-04-28 03:55:38,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:55:38,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1670254257] [2022-04-28 03:55:38,188 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:55:38,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:55:38,361 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:55:38,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1551261265, now seen corresponding path program 1 times [2022-04-28 03:55:38,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:55:38,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771664724] [2022-04-28 03:55:38,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:55:38,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:55:38,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:38,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:55:38,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:38,461 INFO L290 TraceCheckUtils]: 0: Hoare triple {9485#(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(17, 2);call #Ultimate.allocInit(12, 3); {9474#true} is VALID [2022-04-28 03:55:38,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {9474#true} assume true; {9474#true} is VALID [2022-04-28 03:55:38,462 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9474#true} {9474#true} #41#return; {9474#true} is VALID [2022-04-28 03:55:38,462 INFO L272 TraceCheckUtils]: 0: Hoare triple {9474#true} call ULTIMATE.init(); {9485#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:55:38,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {9485#(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(17, 2);call #Ultimate.allocInit(12, 3); {9474#true} is VALID [2022-04-28 03:55:38,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {9474#true} assume true; {9474#true} is VALID [2022-04-28 03:55:38,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9474#true} {9474#true} #41#return; {9474#true} is VALID [2022-04-28 03:55:38,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {9474#true} call #t~ret4 := main(); {9474#true} is VALID [2022-04-28 03:55:38,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {9474#true} ~x~0 := 0;~y~0 := 500000; {9479#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:55:38,463 INFO L290 TraceCheckUtils]: 6: Hoare triple {9479#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [137] L11-2-->L10-2_primed: Formula: (or (and (= v_main_~x~0_687 v_main_~x~0_688) (not (< v_main_~x~0_688 500000))) (and (< v_main_~x~0_687 500001) (< v_main_~x~0_688 v_main_~x~0_687)) (= v_main_~x~0_688 v_main_~x~0_687)) InVars {main_~x~0=v_main_~x~0_688} OutVars{main_~x~0=v_main_~x~0_687} AuxVars[] AssignedVars[main_~x~0] {9480#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:55:38,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {9480#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [138] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9480#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:55:38,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {9480#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [139] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_690)) (.cse0 (= v_main_~y~0_458 v_main_~y~0_457))) (or (and .cse0 (= v_main_~x~0_689 v_main_~x~0_690) (or (not (< v_main_~x~0_690 1000000)) (not .cse1))) (let ((.cse2 (+ v_main_~x~0_690 v_main_~y~0_457))) (and .cse1 (< .cse2 (+ v_main_~y~0_458 1000001)) (< v_main_~y~0_458 v_main_~y~0_457) (= .cse2 (+ v_main_~x~0_689 v_main_~y~0_458)))) (and .cse0 (= v_main_~x~0_690 v_main_~x~0_689)))) InVars {main_~x~0=v_main_~x~0_690, main_~y~0=v_main_~y~0_458} OutVars{main_~x~0=v_main_~x~0_689, main_~y~0=v_main_~y~0_457} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {9481#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:38,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {9481#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [136] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {9482#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:55:38,466 INFO L272 TraceCheckUtils]: 10: Hoare triple {9482#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {9483#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:55:38,466 INFO L290 TraceCheckUtils]: 11: Hoare triple {9483#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {9484#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:55:38,466 INFO L290 TraceCheckUtils]: 12: Hoare triple {9484#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {9475#false} is VALID [2022-04-28 03:55:38,466 INFO L290 TraceCheckUtils]: 13: Hoare triple {9475#false} assume !false; {9475#false} is VALID [2022-04-28 03:55:38,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:55:38,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:55:38,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771664724] [2022-04-28 03:55:38,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771664724] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:55:38,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375669105] [2022-04-28 03:55:38,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:55:38,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:55:38,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:55:38,468 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:55:38,469 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:55:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:38,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:55:38,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:38,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:55:38,905 INFO L272 TraceCheckUtils]: 0: Hoare triple {9474#true} call ULTIMATE.init(); {9474#true} is VALID [2022-04-28 03:55:38,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {9474#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(17, 2);call #Ultimate.allocInit(12, 3); {9474#true} is VALID [2022-04-28 03:55:38,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {9474#true} assume true; {9474#true} is VALID [2022-04-28 03:55:38,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9474#true} {9474#true} #41#return; {9474#true} is VALID [2022-04-28 03:55:38,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {9474#true} call #t~ret4 := main(); {9474#true} is VALID [2022-04-28 03:55:38,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {9474#true} ~x~0 := 0;~y~0 := 500000; {9504#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:55:38,907 INFO L290 TraceCheckUtils]: 6: Hoare triple {9504#(and (<= main_~x~0 0) (= main_~y~0 500000))} [137] L11-2-->L10-2_primed: Formula: (or (and (= v_main_~x~0_687 v_main_~x~0_688) (not (< v_main_~x~0_688 500000))) (and (< v_main_~x~0_687 500001) (< v_main_~x~0_688 v_main_~x~0_687)) (= v_main_~x~0_688 v_main_~x~0_687)) InVars {main_~x~0=v_main_~x~0_688} OutVars{main_~x~0=v_main_~x~0_687} AuxVars[] AssignedVars[main_~x~0] {9508#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:55:38,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {9508#(and (= main_~y~0 500000) (< main_~x~0 500001))} [138] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9508#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:55:38,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {9508#(and (= main_~y~0 500000) (< main_~x~0 500001))} [139] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_690)) (.cse0 (= v_main_~y~0_458 v_main_~y~0_457))) (or (and .cse0 (= v_main_~x~0_689 v_main_~x~0_690) (or (not (< v_main_~x~0_690 1000000)) (not .cse1))) (let ((.cse2 (+ v_main_~x~0_690 v_main_~y~0_457))) (and .cse1 (< .cse2 (+ v_main_~y~0_458 1000001)) (< v_main_~y~0_458 v_main_~y~0_457) (= .cse2 (+ v_main_~x~0_689 v_main_~y~0_458)))) (and .cse0 (= v_main_~x~0_690 v_main_~x~0_689)))) InVars {main_~x~0=v_main_~x~0_690, main_~y~0=v_main_~y~0_458} OutVars{main_~x~0=v_main_~x~0_689, main_~y~0=v_main_~y~0_457} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {9515#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:38,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {9515#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [136] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {9519#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:55:38,909 INFO L272 TraceCheckUtils]: 10: Hoare triple {9519#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {9523#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:55:38,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {9523#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9527#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:55:38,909 INFO L290 TraceCheckUtils]: 12: Hoare triple {9527#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9475#false} is VALID [2022-04-28 03:55:38,910 INFO L290 TraceCheckUtils]: 13: Hoare triple {9475#false} assume !false; {9475#false} is VALID [2022-04-28 03:55:38,910 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:55:38,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:55:39,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {9475#false} assume !false; {9475#false} is VALID [2022-04-28 03:55:39,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {9527#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9475#false} is VALID [2022-04-28 03:55:39,237 INFO L290 TraceCheckUtils]: 11: Hoare triple {9523#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9527#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:55:39,238 INFO L272 TraceCheckUtils]: 10: Hoare triple {9482#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {9523#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:55:39,238 INFO L290 TraceCheckUtils]: 9: Hoare triple {9481#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [136] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {9482#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:55:39,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {9549#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [139] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_690)) (.cse0 (= v_main_~y~0_458 v_main_~y~0_457))) (or (and .cse0 (= v_main_~x~0_689 v_main_~x~0_690) (or (not (< v_main_~x~0_690 1000000)) (not .cse1))) (let ((.cse2 (+ v_main_~x~0_690 v_main_~y~0_457))) (and .cse1 (< .cse2 (+ v_main_~y~0_458 1000001)) (< v_main_~y~0_458 v_main_~y~0_457) (= .cse2 (+ v_main_~x~0_689 v_main_~y~0_458)))) (and .cse0 (= v_main_~x~0_690 v_main_~x~0_689)))) InVars {main_~x~0=v_main_~x~0_690, main_~y~0=v_main_~y~0_458} OutVars{main_~x~0=v_main_~x~0_689, main_~y~0=v_main_~y~0_457} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {9481#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:39,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {9549#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [138] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9549#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:39,240 INFO L290 TraceCheckUtils]: 6: Hoare triple {9556#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [137] L11-2-->L10-2_primed: Formula: (or (and (= v_main_~x~0_687 v_main_~x~0_688) (not (< v_main_~x~0_688 500000))) (and (< v_main_~x~0_687 500001) (< v_main_~x~0_688 v_main_~x~0_687)) (= v_main_~x~0_688 v_main_~x~0_687)) InVars {main_~x~0=v_main_~x~0_688} OutVars{main_~x~0=v_main_~x~0_687} AuxVars[] AssignedVars[main_~x~0] {9549#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:39,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {9474#true} ~x~0 := 0;~y~0 := 500000; {9556#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:39,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {9474#true} call #t~ret4 := main(); {9474#true} is VALID [2022-04-28 03:55:39,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9474#true} {9474#true} #41#return; {9474#true} is VALID [2022-04-28 03:55:39,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {9474#true} assume true; {9474#true} is VALID [2022-04-28 03:55:39,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {9474#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(17, 2);call #Ultimate.allocInit(12, 3); {9474#true} is VALID [2022-04-28 03:55:39,241 INFO L272 TraceCheckUtils]: 0: Hoare triple {9474#true} call ULTIMATE.init(); {9474#true} is VALID [2022-04-28 03:55:39,241 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:55:39,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375669105] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:55:39,242 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:55:39,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:55:40,135 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:55:40,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1670254257] [2022-04-28 03:55:40,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1670254257] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:55:40,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:55:40,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-28 03:55:40,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202938796] [2022-04-28 03:55:40,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:55:40,136 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.9) internal successors, (57), 29 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:55:40,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:55:40,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 30 states have (on average 1.9) internal successors, (57), 29 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:55:40,179 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:55:40,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-28 03:55:40,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:55:40,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-28 03:55:40,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1477, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 03:55:40,180 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand has 31 states, 30 states have (on average 1.9) internal successors, (57), 29 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:55:42,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:42,772 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2022-04-28 03:55:42,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 03:55:42,773 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.9) internal successors, (57), 29 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:55:42,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:55:42,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.9) internal successors, (57), 29 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:55:42,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 77 transitions. [2022-04-28 03:55:42,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.9) internal successors, (57), 29 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:55:42,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 77 transitions. [2022-04-28 03:55:42,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 77 transitions. [2022-04-28 03:55:42,836 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:55:42,836 INFO L225 Difference]: With dead ends: 72 [2022-04-28 03:55:42,836 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 03:55:42,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1039 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=503, Invalid=4053, Unknown=0, NotChecked=0, Total=4556 [2022-04-28 03:55:42,837 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 57 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1412 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:55:42,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 78 Invalid, 1467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1412 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 03:55:42,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 03:55:42,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-28 03:55:42,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:55:42,983 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:42,983 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:42,983 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:42,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:42,984 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2022-04-28 03:55:42,984 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2022-04-28 03:55:42,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:55:42,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:55:42,984 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 3 states have call successors, (3), 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:55:42,985 INFO L87 Difference]: Start difference. First operand has 65 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 3 states have call successors, (3), 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:55:42,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:42,985 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2022-04-28 03:55:42,985 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2022-04-28 03:55:42,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:55:42,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:55:42,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:55:42,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:55:42,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:42,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2022-04-28 03:55:42,986 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 61 [2022-04-28 03:55:42,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:55:42,986 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2022-04-28 03:55:42,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.9) internal successors, (57), 29 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:55:42,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 68 transitions. [2022-04-28 03:55:43,041 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:55:43,041 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2022-04-28 03:55:43,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 03:55:43,042 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:55:43,042 INFO L195 NwaCegarLoop]: trace histogram [26, 24, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:55:43,071 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:55:43,257 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:55:43,257 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:55:43,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:55:43,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1860744389, now seen corresponding path program 24 times [2022-04-28 03:55:43,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:55:43,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2030731357] [2022-04-28 03:55:47,318 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:55:47,364 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:55:47,540 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:55:47,541 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:55:47,543 INFO L85 PathProgramCache]: Analyzing trace with hash 498270895, now seen corresponding path program 1 times [2022-04-28 03:55:47,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:55:47,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588464402] [2022-04-28 03:55:47,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:55:47,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:55:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:47,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:55:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:47,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {10069#(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(17, 2);call #Ultimate.allocInit(12, 3); {10058#true} is VALID [2022-04-28 03:55:47,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {10058#true} assume true; {10058#true} is VALID [2022-04-28 03:55:47,654 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10058#true} {10058#true} #41#return; {10058#true} is VALID [2022-04-28 03:55:47,654 INFO L272 TraceCheckUtils]: 0: Hoare triple {10058#true} call ULTIMATE.init(); {10069#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:55:47,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {10069#(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(17, 2);call #Ultimate.allocInit(12, 3); {10058#true} is VALID [2022-04-28 03:55:47,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {10058#true} assume true; {10058#true} is VALID [2022-04-28 03:55:47,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10058#true} {10058#true} #41#return; {10058#true} is VALID [2022-04-28 03:55:47,654 INFO L272 TraceCheckUtils]: 4: Hoare triple {10058#true} call #t~ret4 := main(); {10058#true} is VALID [2022-04-28 03:55:47,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {10058#true} ~x~0 := 0;~y~0 := 500000; {10063#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:55:47,655 INFO L290 TraceCheckUtils]: 6: Hoare triple {10063#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [141] L11-2-->L10-2_primed: Formula: (or (and (= v_main_~x~0_729 v_main_~x~0_730) (not (< v_main_~x~0_730 500000))) (= v_main_~x~0_730 v_main_~x~0_729) (and (< v_main_~x~0_730 v_main_~x~0_729) (< v_main_~x~0_729 500001))) InVars {main_~x~0=v_main_~x~0_730} OutVars{main_~x~0=v_main_~x~0_729} AuxVars[] AssignedVars[main_~x~0] {10064#(or (<= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:55:47,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {10064#(or (<= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [142] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10064#(or (<= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:55:47,657 INFO L290 TraceCheckUtils]: 8: Hoare triple {10064#(or (<= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [143] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_732)) (.cse0 (= v_main_~x~0_732 v_main_~x~0_731))) (or (and .cse0 (= v_main_~y~0_489 v_main_~y~0_490) (or (not .cse1) (not (< v_main_~x~0_732 1000000)))) (let ((.cse2 (+ v_main_~x~0_732 v_main_~y~0_489))) (and (< v_main_~y~0_490 v_main_~y~0_489) (< .cse2 (+ v_main_~y~0_490 1000001)) (= .cse2 (+ v_main_~x~0_731 v_main_~y~0_490)) .cse1)) (and .cse0 (= v_main_~y~0_490 v_main_~y~0_489)))) InVars {main_~x~0=v_main_~x~0_732, main_~y~0=v_main_~y~0_490} OutVars{main_~x~0=v_main_~x~0_731, main_~y~0=v_main_~y~0_489} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {10065#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:47,657 INFO L290 TraceCheckUtils]: 9: Hoare triple {10065#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [140] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {10066#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:55:47,658 INFO L272 TraceCheckUtils]: 10: Hoare triple {10066#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {10067#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:55:47,658 INFO L290 TraceCheckUtils]: 11: Hoare triple {10067#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {10068#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:55:47,658 INFO L290 TraceCheckUtils]: 12: Hoare triple {10068#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {10059#false} is VALID [2022-04-28 03:55:47,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {10059#false} assume !false; {10059#false} is VALID [2022-04-28 03:55:47,659 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:55:47,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:55:47,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588464402] [2022-04-28 03:55:47,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588464402] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:55:47,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915250303] [2022-04-28 03:55:47,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:55:47,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:55:47,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:55:47,660 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:55:47,687 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:55:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:47,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:55:47,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:47,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:55:48,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {10058#true} call ULTIMATE.init(); {10058#true} is VALID [2022-04-28 03:55:48,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {10058#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(17, 2);call #Ultimate.allocInit(12, 3); {10058#true} is VALID [2022-04-28 03:55:48,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {10058#true} assume true; {10058#true} is VALID [2022-04-28 03:55:48,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10058#true} {10058#true} #41#return; {10058#true} is VALID [2022-04-28 03:55:48,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {10058#true} call #t~ret4 := main(); {10058#true} is VALID [2022-04-28 03:55:48,103 INFO L290 TraceCheckUtils]: 5: Hoare triple {10058#true} ~x~0 := 0;~y~0 := 500000; {10088#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:55:48,103 INFO L290 TraceCheckUtils]: 6: Hoare triple {10088#(and (<= main_~x~0 0) (= main_~y~0 500000))} [141] L11-2-->L10-2_primed: Formula: (or (and (= v_main_~x~0_729 v_main_~x~0_730) (not (< v_main_~x~0_730 500000))) (= v_main_~x~0_730 v_main_~x~0_729) (and (< v_main_~x~0_730 v_main_~x~0_729) (< v_main_~x~0_729 500001))) InVars {main_~x~0=v_main_~x~0_730} OutVars{main_~x~0=v_main_~x~0_729} AuxVars[] AssignedVars[main_~x~0] {10092#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:55:48,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {10092#(and (= main_~y~0 500000) (< main_~x~0 500001))} [142] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10092#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:55:48,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {10092#(and (= main_~y~0 500000) (< main_~x~0 500001))} [143] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_732)) (.cse0 (= v_main_~x~0_732 v_main_~x~0_731))) (or (and .cse0 (= v_main_~y~0_489 v_main_~y~0_490) (or (not .cse1) (not (< v_main_~x~0_732 1000000)))) (let ((.cse2 (+ v_main_~x~0_732 v_main_~y~0_489))) (and (< v_main_~y~0_490 v_main_~y~0_489) (< .cse2 (+ v_main_~y~0_490 1000001)) (= .cse2 (+ v_main_~x~0_731 v_main_~y~0_490)) .cse1)) (and .cse0 (= v_main_~y~0_490 v_main_~y~0_489)))) InVars {main_~x~0=v_main_~x~0_732, main_~y~0=v_main_~y~0_490} OutVars{main_~x~0=v_main_~x~0_731, main_~y~0=v_main_~y~0_489} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {10099#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:48,105 INFO L290 TraceCheckUtils]: 9: Hoare triple {10099#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [140] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {10103#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:55:48,106 INFO L272 TraceCheckUtils]: 10: Hoare triple {10103#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {10107#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:55:48,106 INFO L290 TraceCheckUtils]: 11: Hoare triple {10107#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10111#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:55:48,106 INFO L290 TraceCheckUtils]: 12: Hoare triple {10111#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10059#false} is VALID [2022-04-28 03:55:48,106 INFO L290 TraceCheckUtils]: 13: Hoare triple {10059#false} assume !false; {10059#false} is VALID [2022-04-28 03:55:48,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:55:48,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:55:48,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {10059#false} assume !false; {10059#false} is VALID [2022-04-28 03:55:48,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {10111#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10059#false} is VALID [2022-04-28 03:55:48,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {10107#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10111#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:55:48,394 INFO L272 TraceCheckUtils]: 10: Hoare triple {10066#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {10107#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:55:48,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {10065#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [140] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {10066#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:55:48,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {10133#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [143] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_732)) (.cse0 (= v_main_~x~0_732 v_main_~x~0_731))) (or (and .cse0 (= v_main_~y~0_489 v_main_~y~0_490) (or (not .cse1) (not (< v_main_~x~0_732 1000000)))) (let ((.cse2 (+ v_main_~x~0_732 v_main_~y~0_489))) (and (< v_main_~y~0_490 v_main_~y~0_489) (< .cse2 (+ v_main_~y~0_490 1000001)) (= .cse2 (+ v_main_~x~0_731 v_main_~y~0_490)) .cse1)) (and .cse0 (= v_main_~y~0_490 v_main_~y~0_489)))) InVars {main_~x~0=v_main_~x~0_732, main_~y~0=v_main_~y~0_490} OutVars{main_~x~0=v_main_~x~0_731, main_~y~0=v_main_~y~0_489} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {10065#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:48,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {10133#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [142] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10133#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:48,396 INFO L290 TraceCheckUtils]: 6: Hoare triple {10140#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [141] L11-2-->L10-2_primed: Formula: (or (and (= v_main_~x~0_729 v_main_~x~0_730) (not (< v_main_~x~0_730 500000))) (= v_main_~x~0_730 v_main_~x~0_729) (and (< v_main_~x~0_730 v_main_~x~0_729) (< v_main_~x~0_729 500001))) InVars {main_~x~0=v_main_~x~0_730} OutVars{main_~x~0=v_main_~x~0_729} AuxVars[] AssignedVars[main_~x~0] {10133#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:48,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {10058#true} ~x~0 := 0;~y~0 := 500000; {10140#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:55:48,397 INFO L272 TraceCheckUtils]: 4: Hoare triple {10058#true} call #t~ret4 := main(); {10058#true} is VALID [2022-04-28 03:55:48,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10058#true} {10058#true} #41#return; {10058#true} is VALID [2022-04-28 03:55:48,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {10058#true} assume true; {10058#true} is VALID [2022-04-28 03:55:48,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {10058#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(17, 2);call #Ultimate.allocInit(12, 3); {10058#true} is VALID [2022-04-28 03:55:48,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {10058#true} call ULTIMATE.init(); {10058#true} is VALID [2022-04-28 03:55:48,397 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:55:48,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915250303] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:55:48,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:55:48,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:55:49,346 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:55:49,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2030731357] [2022-04-28 03:55:49,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2030731357] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:55:49,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:55:49,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-28 03:55:49,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204346431] [2022-04-28 03:55:49,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:55:49,347 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.903225806451613) internal successors, (59), 30 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:55:49,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:55:49,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 31 states have (on average 1.903225806451613) internal successors, (59), 30 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:55:49,390 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:55:49,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-28 03:55:49,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:55:49,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-28 03:55:49,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=1554, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 03:55:49,391 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 32 states, 31 states have (on average 1.903225806451613) internal successors, (59), 30 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:55:52,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:52,365 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2022-04-28 03:55:52,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 03:55:52,365 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.903225806451613) internal successors, (59), 30 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:55:52,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:55:52,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.903225806451613) internal successors, (59), 30 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:55:52,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 79 transitions. [2022-04-28 03:55:52,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.903225806451613) internal successors, (59), 30 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:55:52,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 79 transitions. [2022-04-28 03:55:52,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 79 transitions. [2022-04-28 03:55:52,453 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:55:52,453 INFO L225 Difference]: With dead ends: 74 [2022-04-28 03:55:52,454 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 03:55:52,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1090 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=520, Invalid=4310, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 03:55:52,454 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 59 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 1658 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 1715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:55:52,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 143 Invalid, 1715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1658 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 03:55:52,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 03:55:52,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-28 03:55:52,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:55:52,607 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 67 states, 62 states have (on average 1.064516129032258) internal successors, (66), 62 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:52,607 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 67 states, 62 states have (on average 1.064516129032258) internal successors, (66), 62 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:52,607 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 67 states, 62 states have (on average 1.064516129032258) internal successors, (66), 62 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:52,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:52,608 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2022-04-28 03:55:52,608 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2022-04-28 03:55:52,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:55:52,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:55:52,609 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 62 states have (on average 1.064516129032258) internal successors, (66), 62 states have internal predecessors, (66), 3 states have call successors, (3), 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:55:52,609 INFO L87 Difference]: Start difference. First operand has 67 states, 62 states have (on average 1.064516129032258) internal successors, (66), 62 states have internal predecessors, (66), 3 states have call successors, (3), 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:55:52,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:52,609 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2022-04-28 03:55:52,609 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2022-04-28 03:55:52,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:55:52,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:55:52,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:55:52,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:55:52,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.064516129032258) internal successors, (66), 62 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:52,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2022-04-28 03:55:52,610 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 63 [2022-04-28 03:55:52,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:55:52,611 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2022-04-28 03:55:52,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.903225806451613) internal successors, (59), 30 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:55:52,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 70 transitions. [2022-04-28 03:55:52,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:55:52,682 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2022-04-28 03:55:52,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 03:55:52,682 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:55:52,682 INFO L195 NwaCegarLoop]: trace histogram [27, 25, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:55:52,698 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:55:52,882 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:55:52,883 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:55:52,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:55:52,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1705395552, now seen corresponding path program 25 times [2022-04-28 03:55:52,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:55:52,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1164834161] [2022-04-28 03:55:56,933 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:55:56,972 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:55:57,172 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:55:57,173 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:55:57,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1747164241, now seen corresponding path program 1 times [2022-04-28 03:55:57,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:55:57,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796364385] [2022-04-28 03:55:57,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:55:57,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:55:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:57,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:55:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:57,279 INFO L290 TraceCheckUtils]: 0: Hoare triple {10668#(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(17, 2);call #Ultimate.allocInit(12, 3); {10657#true} is VALID [2022-04-28 03:55:57,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {10657#true} assume true; {10657#true} is VALID [2022-04-28 03:55:57,279 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10657#true} {10657#true} #41#return; {10657#true} is VALID [2022-04-28 03:55:57,280 INFO L272 TraceCheckUtils]: 0: Hoare triple {10657#true} call ULTIMATE.init(); {10668#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:55:57,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {10668#(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(17, 2);call #Ultimate.allocInit(12, 3); {10657#true} is VALID [2022-04-28 03:55:57,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {10657#true} assume true; {10657#true} is VALID [2022-04-28 03:55:57,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10657#true} {10657#true} #41#return; {10657#true} is VALID [2022-04-28 03:55:57,280 INFO L272 TraceCheckUtils]: 4: Hoare triple {10657#true} call #t~ret4 := main(); {10657#true} is VALID [2022-04-28 03:55:57,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {10657#true} ~x~0 := 0;~y~0 := 500000; {10662#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:55:57,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {10662#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [145] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_773 v_main_~x~0_772))) (or (and .cse0 (not (< v_main_~x~0_773 500000))) .cse0 (and (< v_main_~x~0_773 v_main_~x~0_772) (< v_main_~x~0_772 500001)))) InVars {main_~x~0=v_main_~x~0_773} OutVars{main_~x~0=v_main_~x~0_772} AuxVars[] AssignedVars[main_~x~0] {10663#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:55:57,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {10663#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [146] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10663#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:55:57,282 INFO L290 TraceCheckUtils]: 8: Hoare triple {10663#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [147] L11-2-->L10-2_primed: Formula: (let ((.cse3 (<= 500000 v_main_~x~0_775)) (.cse0 (= v_main_~x~0_775 v_main_~x~0_774)) (.cse1 (= v_main_~y~0_523 v_main_~y~0_522))) (or (and .cse0 .cse1) (let ((.cse2 (+ v_main_~x~0_775 v_main_~y~0_522))) (and (< .cse2 (+ v_main_~y~0_523 1000001)) (< v_main_~y~0_523 v_main_~y~0_522) (= (+ v_main_~x~0_774 v_main_~y~0_523) .cse2) .cse3)) (and (or (not (< v_main_~x~0_775 1000000)) (not .cse3)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_775, main_~y~0=v_main_~y~0_523} OutVars{main_~x~0=v_main_~x~0_774, main_~y~0=v_main_~y~0_522} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {10664#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:57,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {10664#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [144] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {10665#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:55:57,283 INFO L272 TraceCheckUtils]: 10: Hoare triple {10665#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {10666#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:55:57,283 INFO L290 TraceCheckUtils]: 11: Hoare triple {10666#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {10667#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:55:57,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {10667#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {10658#false} is VALID [2022-04-28 03:55:57,284 INFO L290 TraceCheckUtils]: 13: Hoare triple {10658#false} assume !false; {10658#false} is VALID [2022-04-28 03:55:57,284 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:55:57,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:55:57,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796364385] [2022-04-28 03:55:57,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796364385] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:55:57,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388111535] [2022-04-28 03:55:57,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:55:57,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:55:57,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:55:57,285 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:55:57,286 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:55:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:57,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:55:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:57,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:55:57,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {10657#true} call ULTIMATE.init(); {10657#true} is VALID [2022-04-28 03:55:57,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {10657#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(17, 2);call #Ultimate.allocInit(12, 3); {10657#true} is VALID [2022-04-28 03:55:57,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {10657#true} assume true; {10657#true} is VALID [2022-04-28 03:55:57,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10657#true} {10657#true} #41#return; {10657#true} is VALID [2022-04-28 03:55:57,663 INFO L272 TraceCheckUtils]: 4: Hoare triple {10657#true} call #t~ret4 := main(); {10657#true} is VALID [2022-04-28 03:55:57,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {10657#true} ~x~0 := 0;~y~0 := 500000; {10687#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:55:57,664 INFO L290 TraceCheckUtils]: 6: Hoare triple {10687#(and (<= main_~x~0 0) (= main_~y~0 500000))} [145] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_773 v_main_~x~0_772))) (or (and .cse0 (not (< v_main_~x~0_773 500000))) .cse0 (and (< v_main_~x~0_773 v_main_~x~0_772) (< v_main_~x~0_772 500001)))) InVars {main_~x~0=v_main_~x~0_773} OutVars{main_~x~0=v_main_~x~0_772} AuxVars[] AssignedVars[main_~x~0] {10691#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:55:57,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {10691#(and (= main_~y~0 500000) (< main_~x~0 500001))} [146] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10691#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:55:57,665 INFO L290 TraceCheckUtils]: 8: Hoare triple {10691#(and (= main_~y~0 500000) (< main_~x~0 500001))} [147] L11-2-->L10-2_primed: Formula: (let ((.cse3 (<= 500000 v_main_~x~0_775)) (.cse0 (= v_main_~x~0_775 v_main_~x~0_774)) (.cse1 (= v_main_~y~0_523 v_main_~y~0_522))) (or (and .cse0 .cse1) (let ((.cse2 (+ v_main_~x~0_775 v_main_~y~0_522))) (and (< .cse2 (+ v_main_~y~0_523 1000001)) (< v_main_~y~0_523 v_main_~y~0_522) (= (+ v_main_~x~0_774 v_main_~y~0_523) .cse2) .cse3)) (and (or (not (< v_main_~x~0_775 1000000)) (not .cse3)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_775, main_~y~0=v_main_~y~0_523} OutVars{main_~x~0=v_main_~x~0_774, main_~y~0=v_main_~y~0_522} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {10698#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:57,665 INFO L290 TraceCheckUtils]: 9: Hoare triple {10698#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [144] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {10702#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:55:57,666 INFO L272 TraceCheckUtils]: 10: Hoare triple {10702#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {10706#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:55:57,666 INFO L290 TraceCheckUtils]: 11: Hoare triple {10706#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10710#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:55:57,667 INFO L290 TraceCheckUtils]: 12: Hoare triple {10710#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10658#false} is VALID [2022-04-28 03:55:57,667 INFO L290 TraceCheckUtils]: 13: Hoare triple {10658#false} assume !false; {10658#false} is VALID [2022-04-28 03:55:57,667 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:55:57,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:55:57,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {10658#false} assume !false; {10658#false} is VALID [2022-04-28 03:55:57,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {10710#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10658#false} is VALID [2022-04-28 03:55:57,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {10706#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10710#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:55:57,976 INFO L272 TraceCheckUtils]: 10: Hoare triple {10665#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {10706#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:55:57,977 INFO L290 TraceCheckUtils]: 9: Hoare triple {10729#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [144] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {10665#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:55:57,978 INFO L290 TraceCheckUtils]: 8: Hoare triple {10733#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [147] L11-2-->L10-2_primed: Formula: (let ((.cse3 (<= 500000 v_main_~x~0_775)) (.cse0 (= v_main_~x~0_775 v_main_~x~0_774)) (.cse1 (= v_main_~y~0_523 v_main_~y~0_522))) (or (and .cse0 .cse1) (let ((.cse2 (+ v_main_~x~0_775 v_main_~y~0_522))) (and (< .cse2 (+ v_main_~y~0_523 1000001)) (< v_main_~y~0_523 v_main_~y~0_522) (= (+ v_main_~x~0_774 v_main_~y~0_523) .cse2) .cse3)) (and (or (not (< v_main_~x~0_775 1000000)) (not .cse3)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_775, main_~y~0=v_main_~y~0_523} OutVars{main_~x~0=v_main_~x~0_774, main_~y~0=v_main_~y~0_522} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {10729#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:57,978 INFO L290 TraceCheckUtils]: 7: Hoare triple {10733#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [146] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10733#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:57,979 INFO L290 TraceCheckUtils]: 6: Hoare triple {10740#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [145] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_773 v_main_~x~0_772))) (or (and .cse0 (not (< v_main_~x~0_773 500000))) .cse0 (and (< v_main_~x~0_773 v_main_~x~0_772) (< v_main_~x~0_772 500001)))) InVars {main_~x~0=v_main_~x~0_773} OutVars{main_~x~0=v_main_~x~0_772} AuxVars[] AssignedVars[main_~x~0] {10733#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:55:57,979 INFO L290 TraceCheckUtils]: 5: Hoare triple {10657#true} ~x~0 := 0;~y~0 := 500000; {10740#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:55:57,979 INFO L272 TraceCheckUtils]: 4: Hoare triple {10657#true} call #t~ret4 := main(); {10657#true} is VALID [2022-04-28 03:55:57,979 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10657#true} {10657#true} #41#return; {10657#true} is VALID [2022-04-28 03:55:57,979 INFO L290 TraceCheckUtils]: 2: Hoare triple {10657#true} assume true; {10657#true} is VALID [2022-04-28 03:55:57,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {10657#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(17, 2);call #Ultimate.allocInit(12, 3); {10657#true} is VALID [2022-04-28 03:55:57,979 INFO L272 TraceCheckUtils]: 0: Hoare triple {10657#true} call ULTIMATE.init(); {10657#true} is VALID [2022-04-28 03:55:57,980 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:55:57,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388111535] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:55:57,980 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:55:57,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 03:55:58,956 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:55:58,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1164834161] [2022-04-28 03:55:58,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1164834161] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:55:58,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:55:58,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-28 03:55:58,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671023250] [2022-04-28 03:55:58,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:55:58,957 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.90625) internal successors, (61), 31 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:55:58,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:55:58,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 32 states have (on average 1.90625) internal successors, (61), 31 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:55:59,009 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:55:59,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-28 03:55:59,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:55:59,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-28 03:55:59,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=1682, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 03:55:59,010 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 33 states, 32 states have (on average 1.90625) internal successors, (61), 31 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:56:02,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:56:02,191 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2022-04-28 03:56:02,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 03:56:02,192 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.90625) internal successors, (61), 31 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:56:02,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:56:02,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.90625) internal successors, (61), 31 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:56:02,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 81 transitions. [2022-04-28 03:56:02,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.90625) internal successors, (61), 31 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:56:02,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 81 transitions. [2022-04-28 03:56:02,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 81 transitions. [2022-04-28 03:56:02,253 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:56:02,254 INFO L225 Difference]: With dead ends: 76 [2022-04-28 03:56:02,254 INFO L226 Difference]: Without dead ends: 69 [2022-04-28 03:56:02,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1207 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=604, Invalid=4652, Unknown=0, NotChecked=0, Total=5256 [2022-04-28 03:56:02,255 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 61 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 1787 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 1846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:56:02,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 153 Invalid, 1846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1787 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-28 03:56:02,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-28 03:56:02,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-04-28 03:56:02,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:56:02,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 69 states, 64 states have (on average 1.0625) internal successors, (68), 64 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:02,416 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 69 states, 64 states have (on average 1.0625) internal successors, (68), 64 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:02,416 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 69 states, 64 states have (on average 1.0625) internal successors, (68), 64 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:02,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:56:02,417 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-04-28 03:56:02,417 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2022-04-28 03:56:02,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:56:02,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:56:02,417 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 64 states have (on average 1.0625) internal successors, (68), 64 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-28 03:56:02,417 INFO L87 Difference]: Start difference. First operand has 69 states, 64 states have (on average 1.0625) internal successors, (68), 64 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-28 03:56:02,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:56:02,418 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-04-28 03:56:02,418 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2022-04-28 03:56:02,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:56:02,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:56:02,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:56:02,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:56:02,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.0625) internal successors, (68), 64 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:02,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2022-04-28 03:56:02,419 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 65 [2022-04-28 03:56:02,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:56:02,419 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2022-04-28 03:56:02,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.90625) internal successors, (61), 31 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:56:02,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 72 transitions. [2022-04-28 03:56:02,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:56:02,488 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2022-04-28 03:56:02,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-28 03:56:02,489 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:56:02,489 INFO L195 NwaCegarLoop]: trace histogram [28, 26, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:56:02,506 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:56:02,689 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:56:02,689 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:56:02,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:56:02,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1555948741, now seen corresponding path program 26 times [2022-04-28 03:56:02,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:56:02,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2041243113] [2022-04-28 03:56:06,754 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:56:06,800 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:56:06,998 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:56:06,999 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:56:07,001 INFO L85 PathProgramCache]: Analyzing trace with hash 302367919, now seen corresponding path program 1 times [2022-04-28 03:56:07,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:56:07,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440581497] [2022-04-28 03:56:07,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:56:07,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:56:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:07,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:56:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:07,096 INFO L290 TraceCheckUtils]: 0: Hoare triple {11283#(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(17, 2);call #Ultimate.allocInit(12, 3); {11272#true} is VALID [2022-04-28 03:56:07,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {11272#true} assume true; {11272#true} is VALID [2022-04-28 03:56:07,096 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11272#true} {11272#true} #41#return; {11272#true} is VALID [2022-04-28 03:56:07,097 INFO L272 TraceCheckUtils]: 0: Hoare triple {11272#true} call ULTIMATE.init(); {11283#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:56:07,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {11283#(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(17, 2);call #Ultimate.allocInit(12, 3); {11272#true} is VALID [2022-04-28 03:56:07,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {11272#true} assume true; {11272#true} is VALID [2022-04-28 03:56:07,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11272#true} {11272#true} #41#return; {11272#true} is VALID [2022-04-28 03:56:07,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {11272#true} call #t~ret4 := main(); {11272#true} is VALID [2022-04-28 03:56:07,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {11272#true} ~x~0 := 0;~y~0 := 500000; {11277#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:56:07,098 INFO L290 TraceCheckUtils]: 6: Hoare triple {11277#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [149] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_817 v_main_~x~0_816))) (or (and .cse0 (<= 500000 v_main_~x~0_817)) .cse0 (and (< v_main_~x~0_816 500001) (< v_main_~x~0_817 v_main_~x~0_816)))) InVars {main_~x~0=v_main_~x~0_817} OutVars{main_~x~0=v_main_~x~0_816} AuxVars[] AssignedVars[main_~x~0] {11278#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:56:07,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {11278#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [150] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11278#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:56:07,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {11278#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [151] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_819 v_main_~x~0_818)) (.cse1 (= v_main_~y~0_557 v_main_~y~0_556)) (.cse2 (<= 500000 v_main_~x~0_819))) (or (and .cse0 .cse1) (and (or (not .cse2) (not (< v_main_~x~0_819 1000000))) .cse0 .cse1) (let ((.cse3 (+ v_main_~x~0_819 v_main_~y~0_556))) (and (< v_main_~y~0_557 v_main_~y~0_556) (= (+ v_main_~x~0_818 v_main_~y~0_557) .cse3) (< .cse3 (+ v_main_~y~0_557 1000001)) .cse2)))) InVars {main_~x~0=v_main_~x~0_819, main_~y~0=v_main_~y~0_557} OutVars{main_~x~0=v_main_~x~0_818, main_~y~0=v_main_~y~0_556} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {11279#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:56:07,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {11279#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [148] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {11280#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:56:07,100 INFO L272 TraceCheckUtils]: 10: Hoare triple {11280#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {11281#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:56:07,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {11281#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {11282#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:56:07,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {11282#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {11273#false} is VALID [2022-04-28 03:56:07,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {11273#false} assume !false; {11273#false} is VALID [2022-04-28 03:56:07,101 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:56:07,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:56:07,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440581497] [2022-04-28 03:56:07,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440581497] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:56:07,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271681547] [2022-04-28 03:56:07,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:56:07,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:56:07,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:56:07,103 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:56:07,104 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:56:07,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:07,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:56:07,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:07,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:56:07,492 INFO L272 TraceCheckUtils]: 0: Hoare triple {11272#true} call ULTIMATE.init(); {11272#true} is VALID [2022-04-28 03:56:07,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {11272#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(17, 2);call #Ultimate.allocInit(12, 3); {11272#true} is VALID [2022-04-28 03:56:07,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {11272#true} assume true; {11272#true} is VALID [2022-04-28 03:56:07,493 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11272#true} {11272#true} #41#return; {11272#true} is VALID [2022-04-28 03:56:07,493 INFO L272 TraceCheckUtils]: 4: Hoare triple {11272#true} call #t~ret4 := main(); {11272#true} is VALID [2022-04-28 03:56:07,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {11272#true} ~x~0 := 0;~y~0 := 500000; {11302#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:56:07,494 INFO L290 TraceCheckUtils]: 6: Hoare triple {11302#(and (<= main_~x~0 0) (= main_~y~0 500000))} [149] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_817 v_main_~x~0_816))) (or (and .cse0 (<= 500000 v_main_~x~0_817)) .cse0 (and (< v_main_~x~0_816 500001) (< v_main_~x~0_817 v_main_~x~0_816)))) InVars {main_~x~0=v_main_~x~0_817} OutVars{main_~x~0=v_main_~x~0_816} AuxVars[] AssignedVars[main_~x~0] {11306#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:56:07,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {11306#(and (= main_~y~0 500000) (< main_~x~0 500001))} [150] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11306#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:56:07,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {11306#(and (= main_~y~0 500000) (< main_~x~0 500001))} [151] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_819 v_main_~x~0_818)) (.cse1 (= v_main_~y~0_557 v_main_~y~0_556)) (.cse2 (<= 500000 v_main_~x~0_819))) (or (and .cse0 .cse1) (and (or (not .cse2) (not (< v_main_~x~0_819 1000000))) .cse0 .cse1) (let ((.cse3 (+ v_main_~x~0_819 v_main_~y~0_556))) (and (< v_main_~y~0_557 v_main_~y~0_556) (= (+ v_main_~x~0_818 v_main_~y~0_557) .cse3) (< .cse3 (+ v_main_~y~0_557 1000001)) .cse2)))) InVars {main_~x~0=v_main_~x~0_819, main_~y~0=v_main_~y~0_557} OutVars{main_~x~0=v_main_~x~0_818, main_~y~0=v_main_~y~0_556} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {11313#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:56:07,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {11313#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [148] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {11317#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:56:07,496 INFO L272 TraceCheckUtils]: 10: Hoare triple {11317#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {11321#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:56:07,496 INFO L290 TraceCheckUtils]: 11: Hoare triple {11321#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11325#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:56:07,496 INFO L290 TraceCheckUtils]: 12: Hoare triple {11325#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11273#false} is VALID [2022-04-28 03:56:07,497 INFO L290 TraceCheckUtils]: 13: Hoare triple {11273#false} assume !false; {11273#false} is VALID [2022-04-28 03:56:07,497 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:56:07,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:56:07,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {11273#false} assume !false; {11273#false} is VALID [2022-04-28 03:56:07,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {11325#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11273#false} is VALID [2022-04-28 03:56:07,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {11321#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11325#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:56:07,794 INFO L272 TraceCheckUtils]: 10: Hoare triple {11280#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {11321#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:56:07,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {11279#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [148] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {11280#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:56:07,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {11347#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [151] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_819 v_main_~x~0_818)) (.cse1 (= v_main_~y~0_557 v_main_~y~0_556)) (.cse2 (<= 500000 v_main_~x~0_819))) (or (and .cse0 .cse1) (and (or (not .cse2) (not (< v_main_~x~0_819 1000000))) .cse0 .cse1) (let ((.cse3 (+ v_main_~x~0_819 v_main_~y~0_556))) (and (< v_main_~y~0_557 v_main_~y~0_556) (= (+ v_main_~x~0_818 v_main_~y~0_557) .cse3) (< .cse3 (+ v_main_~y~0_557 1000001)) .cse2)))) InVars {main_~x~0=v_main_~x~0_819, main_~y~0=v_main_~y~0_557} OutVars{main_~x~0=v_main_~x~0_818, main_~y~0=v_main_~y~0_556} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {11279#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:56:07,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {11347#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [150] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11347#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:56:07,796 INFO L290 TraceCheckUtils]: 6: Hoare triple {11354#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [149] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_817 v_main_~x~0_816))) (or (and .cse0 (<= 500000 v_main_~x~0_817)) .cse0 (and (< v_main_~x~0_816 500001) (< v_main_~x~0_817 v_main_~x~0_816)))) InVars {main_~x~0=v_main_~x~0_817} OutVars{main_~x~0=v_main_~x~0_816} AuxVars[] AssignedVars[main_~x~0] {11347#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:56:07,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {11272#true} ~x~0 := 0;~y~0 := 500000; {11354#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:56:07,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {11272#true} call #t~ret4 := main(); {11272#true} is VALID [2022-04-28 03:56:07,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11272#true} {11272#true} #41#return; {11272#true} is VALID [2022-04-28 03:56:07,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {11272#true} assume true; {11272#true} is VALID [2022-04-28 03:56:07,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {11272#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(17, 2);call #Ultimate.allocInit(12, 3); {11272#true} is VALID [2022-04-28 03:56:07,799 INFO L272 TraceCheckUtils]: 0: Hoare triple {11272#true} call ULTIMATE.init(); {11272#true} is VALID [2022-04-28 03:56:07,800 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:56:07,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271681547] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:56:07,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:56:07,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:56:08,808 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:56:08,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2041243113] [2022-04-28 03:56:08,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2041243113] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:56:08,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:56:08,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-28 03:56:08,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340179802] [2022-04-28 03:56:08,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:56:08,809 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 32 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:56:08,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:56:08,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 32 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:56:08,854 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:56:08,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-28 03:56:08,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:56:08,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-28 03:56:08,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=1714, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 03:56:08,854 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 32 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:56:12,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:56:12,026 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2022-04-28 03:56:12,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 03:56:12,026 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 32 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:56:12,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:56:12,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 32 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:56:12,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 83 transitions. [2022-04-28 03:56:12,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 32 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:56:12,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 83 transitions. [2022-04-28 03:56:12,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 83 transitions. [2022-04-28 03:56:12,193 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:56:12,194 INFO L225 Difference]: With dead ends: 78 [2022-04-28 03:56:12,194 INFO L226 Difference]: Without dead ends: 71 [2022-04-28 03:56:12,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1195 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=554, Invalid=4848, Unknown=0, NotChecked=0, Total=5402 [2022-04-28 03:56:12,195 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 63 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1762 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:56:12,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 113 Invalid, 1823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1762 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-28 03:56:12,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-28 03:56:12,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-28 03:56:12,381 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:56:12,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 66 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:12,382 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 66 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:12,382 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 66 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:12,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:56:12,383 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2022-04-28 03:56:12,383 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2022-04-28 03:56:12,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:56:12,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:56:12,383 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 66 states have internal predecessors, (70), 3 states have call successors, (3), 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:56:12,383 INFO L87 Difference]: Start difference. First operand has 71 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 66 states have internal predecessors, (70), 3 states have call successors, (3), 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:56:12,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:56:12,384 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2022-04-28 03:56:12,384 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2022-04-28 03:56:12,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:56:12,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:56:12,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:56:12,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:56:12,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 66 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:12,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2022-04-28 03:56:12,385 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 67 [2022-04-28 03:56:12,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:56:12,385 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2022-04-28 03:56:12,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 32 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:56:12,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 74 transitions. [2022-04-28 03:56:12,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:56:12,448 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2022-04-28 03:56:12,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 03:56:12,448 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:56:12,448 INFO L195 NwaCegarLoop]: trace histogram [29, 27, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:56:12,464 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:56:12,648 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:56:12,649 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:56:12,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:56:12,649 INFO L85 PathProgramCache]: Analyzing trace with hash -381688234, now seen corresponding path program 27 times [2022-04-28 03:56:12,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:56:12,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2037282225] [2022-04-28 03:56:16,708 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:56:16,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:56:16,908 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:56:16,910 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:56:16,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1943067217, now seen corresponding path program 1 times [2022-04-28 03:56:16,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:56:16,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084420184] [2022-04-28 03:56:16,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:56:16,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:56:16,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:16,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:56:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:17,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {11912#(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(17, 2);call #Ultimate.allocInit(12, 3); {11901#true} is VALID [2022-04-28 03:56:17,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {11901#true} assume true; {11901#true} is VALID [2022-04-28 03:56:17,001 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11901#true} {11901#true} #41#return; {11901#true} is VALID [2022-04-28 03:56:17,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {11901#true} call ULTIMATE.init(); {11912#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:56:17,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {11912#(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(17, 2);call #Ultimate.allocInit(12, 3); {11901#true} is VALID [2022-04-28 03:56:17,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {11901#true} assume true; {11901#true} is VALID [2022-04-28 03:56:17,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11901#true} {11901#true} #41#return; {11901#true} is VALID [2022-04-28 03:56:17,002 INFO L272 TraceCheckUtils]: 4: Hoare triple {11901#true} call #t~ret4 := main(); {11901#true} is VALID [2022-04-28 03:56:17,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {11901#true} ~x~0 := 0;~y~0 := 500000; {11906#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:56:17,003 INFO L290 TraceCheckUtils]: 6: Hoare triple {11906#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [153] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_862 v_main_~x~0_861))) (or .cse0 (and (< v_main_~x~0_861 500001) (< v_main_~x~0_862 v_main_~x~0_861)) (and (not (< v_main_~x~0_862 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_862} OutVars{main_~x~0=v_main_~x~0_861} AuxVars[] AssignedVars[main_~x~0] {11907#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:56:17,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {11907#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [154] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11907#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:56:17,004 INFO L290 TraceCheckUtils]: 8: Hoare triple {11907#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [155] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_864)) (.cse1 (= v_main_~y~0_592 v_main_~y~0_591))) (or (and (= (+ v_main_~x~0_864 v_main_~y~0_591) (+ v_main_~x~0_863 v_main_~y~0_592)) (< v_main_~x~0_863 1000001) .cse0 (< v_main_~x~0_864 v_main_~x~0_863)) (and (= v_main_~x~0_864 v_main_~x~0_863) .cse1) (and (or (not .cse0) (not (< v_main_~x~0_864 1000000))) .cse1 (= v_main_~x~0_863 v_main_~x~0_864)))) InVars {main_~x~0=v_main_~x~0_864, main_~y~0=v_main_~y~0_592} OutVars{main_~x~0=v_main_~x~0_863, main_~y~0=v_main_~y~0_591} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {11908#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:56:17,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {11908#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [152] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {11909#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-28 03:56:17,005 INFO L272 TraceCheckUtils]: 10: Hoare triple {11909#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {11910#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:56:17,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {11910#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {11911#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:56:17,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {11911#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {11902#false} is VALID [2022-04-28 03:56:17,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {11902#false} assume !false; {11902#false} is VALID [2022-04-28 03:56:17,006 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:56:17,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:56:17,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084420184] [2022-04-28 03:56:17,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084420184] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:56:17,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941217557] [2022-04-28 03:56:17,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:56:17,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:56:17,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:56:17,007 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:56:17,008 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:56:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:17,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:56:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:17,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:56:17,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {11901#true} call ULTIMATE.init(); {11901#true} is VALID [2022-04-28 03:56:17,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {11901#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(17, 2);call #Ultimate.allocInit(12, 3); {11901#true} is VALID [2022-04-28 03:56:17,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {11901#true} assume true; {11901#true} is VALID [2022-04-28 03:56:17,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11901#true} {11901#true} #41#return; {11901#true} is VALID [2022-04-28 03:56:17,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {11901#true} call #t~ret4 := main(); {11901#true} is VALID [2022-04-28 03:56:17,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {11901#true} ~x~0 := 0;~y~0 := 500000; {11931#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:56:17,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {11931#(and (<= main_~x~0 0) (= main_~y~0 500000))} [153] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_862 v_main_~x~0_861))) (or .cse0 (and (< v_main_~x~0_861 500001) (< v_main_~x~0_862 v_main_~x~0_861)) (and (not (< v_main_~x~0_862 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_862} OutVars{main_~x~0=v_main_~x~0_861} AuxVars[] AssignedVars[main_~x~0] {11935#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:56:17,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {11935#(and (= main_~y~0 500000) (< main_~x~0 500001))} [154] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11935#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:56:17,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {11935#(and (= main_~y~0 500000) (< main_~x~0 500001))} [155] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_864)) (.cse1 (= v_main_~y~0_592 v_main_~y~0_591))) (or (and (= (+ v_main_~x~0_864 v_main_~y~0_591) (+ v_main_~x~0_863 v_main_~y~0_592)) (< v_main_~x~0_863 1000001) .cse0 (< v_main_~x~0_864 v_main_~x~0_863)) (and (= v_main_~x~0_864 v_main_~x~0_863) .cse1) (and (or (not .cse0) (not (< v_main_~x~0_864 1000000))) .cse1 (= v_main_~x~0_863 v_main_~x~0_864)))) InVars {main_~x~0=v_main_~x~0_864, main_~y~0=v_main_~y~0_592} OutVars{main_~x~0=v_main_~x~0_863, main_~y~0=v_main_~y~0_591} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {11942#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:56:17,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {11942#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [152] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {11946#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:56:17,369 INFO L272 TraceCheckUtils]: 10: Hoare triple {11946#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {11950#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:56:17,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {11950#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11954#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:56:17,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {11954#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11902#false} is VALID [2022-04-28 03:56:17,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {11902#false} assume !false; {11902#false} is VALID [2022-04-28 03:56:17,370 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:56:17,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:56:17,645 INFO L290 TraceCheckUtils]: 13: Hoare triple {11902#false} assume !false; {11902#false} is VALID [2022-04-28 03:56:17,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {11954#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11902#false} is VALID [2022-04-28 03:56:17,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {11950#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11954#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:56:17,647 INFO L272 TraceCheckUtils]: 10: Hoare triple {11909#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {11950#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:56:17,647 INFO L290 TraceCheckUtils]: 9: Hoare triple {11973#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [152] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {11909#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-28 03:56:17,648 INFO L290 TraceCheckUtils]: 8: Hoare triple {11977#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [155] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_864)) (.cse1 (= v_main_~y~0_592 v_main_~y~0_591))) (or (and (= (+ v_main_~x~0_864 v_main_~y~0_591) (+ v_main_~x~0_863 v_main_~y~0_592)) (< v_main_~x~0_863 1000001) .cse0 (< v_main_~x~0_864 v_main_~x~0_863)) (and (= v_main_~x~0_864 v_main_~x~0_863) .cse1) (and (or (not .cse0) (not (< v_main_~x~0_864 1000000))) .cse1 (= v_main_~x~0_863 v_main_~x~0_864)))) InVars {main_~x~0=v_main_~x~0_864, main_~y~0=v_main_~y~0_592} OutVars{main_~x~0=v_main_~x~0_863, main_~y~0=v_main_~y~0_591} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {11973#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:56:17,648 INFO L290 TraceCheckUtils]: 7: Hoare triple {11977#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [154] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11977#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:56:17,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {11984#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))))} [153] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_862 v_main_~x~0_861))) (or .cse0 (and (< v_main_~x~0_861 500001) (< v_main_~x~0_862 v_main_~x~0_861)) (and (not (< v_main_~x~0_862 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_862} OutVars{main_~x~0=v_main_~x~0_861} AuxVars[] AssignedVars[main_~x~0] {11977#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:56:17,649 INFO L290 TraceCheckUtils]: 5: Hoare triple {11901#true} ~x~0 := 0;~y~0 := 500000; {11984#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))))} is VALID [2022-04-28 03:56:17,649 INFO L272 TraceCheckUtils]: 4: Hoare triple {11901#true} call #t~ret4 := main(); {11901#true} is VALID [2022-04-28 03:56:17,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11901#true} {11901#true} #41#return; {11901#true} is VALID [2022-04-28 03:56:17,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {11901#true} assume true; {11901#true} is VALID [2022-04-28 03:56:17,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {11901#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(17, 2);call #Ultimate.allocInit(12, 3); {11901#true} is VALID [2022-04-28 03:56:17,650 INFO L272 TraceCheckUtils]: 0: Hoare triple {11901#true} call ULTIMATE.init(); {11901#true} is VALID [2022-04-28 03:56:17,650 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:56:17,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941217557] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:56:17,650 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:56:17,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 03:56:18,725 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:56:18,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2037282225] [2022-04-28 03:56:18,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2037282225] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:56:18,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:56:18,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-28 03:56:18,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192884290] [2022-04-28 03:56:18,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:56:18,726 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.911764705882353) internal successors, (65), 33 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:56:18,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:56:18,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 34 states have (on average 1.911764705882353) internal successors, (65), 33 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:56:18,774 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:56:18,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-28 03:56:18,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:56:18,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-28 03:56:18,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=1848, Unknown=0, NotChecked=0, Total=2162 [2022-04-28 03:56:18,775 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 35 states, 34 states have (on average 1.911764705882353) internal successors, (65), 33 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:56:22,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:56:22,012 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2022-04-28 03:56:22,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-28 03:56:22,013 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.911764705882353) internal successors, (65), 33 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:56:22,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:56:22,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.911764705882353) internal successors, (65), 33 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:56:22,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 85 transitions. [2022-04-28 03:56:22,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.911764705882353) internal successors, (65), 33 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:56:22,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 85 transitions. [2022-04-28 03:56:22,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 85 transitions. [2022-04-28 03:56:22,079 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:56:22,079 INFO L225 Difference]: With dead ends: 80 [2022-04-28 03:56:22,079 INFO L226 Difference]: Without dead ends: 73 [2022-04-28 03:56:22,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=642, Invalid=5210, Unknown=0, NotChecked=0, Total=5852 [2022-04-28 03:56:22,089 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 65 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1798 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:56:22,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 78 Invalid, 1861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1798 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-28 03:56:22,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-28 03:56:22,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-04-28 03:56:22,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:56:22,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 73 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:22,256 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 73 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:22,256 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 73 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:22,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:56:22,257 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2022-04-28 03:56:22,257 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2022-04-28 03:56:22,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:56:22,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:56:22,257 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 3 states have call successors, (3), 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:56:22,257 INFO L87 Difference]: Start difference. First operand has 73 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 3 states have call successors, (3), 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:56:22,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:56:22,258 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2022-04-28 03:56:22,258 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2022-04-28 03:56:22,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:56:22,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:56:22,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:56:22,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:56:22,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:22,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2022-04-28 03:56:22,259 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 69 [2022-04-28 03:56:22,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:56:22,259 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2022-04-28 03:56:22,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.911764705882353) internal successors, (65), 33 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:56:22,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 76 transitions. [2022-04-28 03:56:22,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:56:22,320 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2022-04-28 03:56:22,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-28 03:56:22,320 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:56:22,320 INFO L195 NwaCegarLoop]: trace histogram [30, 28, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:56:22,338 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:56:22,520 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:56:22,520 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:56:22,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:56:22,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1493739855, now seen corresponding path program 28 times [2022-04-28 03:56:22,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:56:22,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1992956191] [2022-04-28 03:56:22,615 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:56:22,811 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:56:22,812 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:56:22,814 INFO L85 PathProgramCache]: Analyzing trace with hash 106464943, now seen corresponding path program 1 times [2022-04-28 03:56:22,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:56:22,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159617840] [2022-04-28 03:56:22,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:56:22,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:56:22,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:22,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:56:22,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:22,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {12557#(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(17, 2);call #Ultimate.allocInit(12, 3); {12546#true} is VALID [2022-04-28 03:56:22,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {12546#true} assume true; {12546#true} is VALID [2022-04-28 03:56:22,900 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12546#true} {12546#true} #41#return; {12546#true} is VALID [2022-04-28 03:56:22,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {12546#true} call ULTIMATE.init(); {12557#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:56:22,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {12557#(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(17, 2);call #Ultimate.allocInit(12, 3); {12546#true} is VALID [2022-04-28 03:56:22,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {12546#true} assume true; {12546#true} is VALID [2022-04-28 03:56:22,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12546#true} {12546#true} #41#return; {12546#true} is VALID [2022-04-28 03:56:22,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {12546#true} call #t~ret4 := main(); {12546#true} is VALID [2022-04-28 03:56:22,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {12546#true} ~x~0 := 0;~y~0 := 500000; {12551#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:56:22,902 INFO L290 TraceCheckUtils]: 6: Hoare triple {12551#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [157] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_908 v_main_~x~0_907))) (or (and (not (< v_main_~x~0_908 500000)) .cse0) (and (< v_main_~x~0_907 500001) (< v_main_~x~0_908 v_main_~x~0_907)) .cse0)) InVars {main_~x~0=v_main_~x~0_908} OutVars{main_~x~0=v_main_~x~0_907} AuxVars[] AssignedVars[main_~x~0] {12552#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:56:22,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {12552#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [158] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12552#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:56:22,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {12552#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [159] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_910 v_main_~x~0_909)) (.cse1 (= v_main_~y~0_628 v_main_~y~0_627)) (.cse2 (<= 500000 v_main_~x~0_910))) (or (and .cse0 .cse1) (and (or (not .cse2) (not (< v_main_~x~0_910 1000000))) .cse0 .cse1) (and (< v_main_~x~0_910 v_main_~x~0_909) .cse2 (< v_main_~x~0_909 1000001) (= (+ v_main_~x~0_909 v_main_~y~0_628) (+ v_main_~x~0_910 v_main_~y~0_627))))) InVars {main_~x~0=v_main_~x~0_910, main_~y~0=v_main_~y~0_628} OutVars{main_~x~0=v_main_~x~0_909, main_~y~0=v_main_~y~0_627} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {12553#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:56:22,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {12553#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [156] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {12554#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:56:22,904 INFO L272 TraceCheckUtils]: 10: Hoare triple {12554#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {12555#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:56:22,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {12555#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {12556#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:56:22,905 INFO L290 TraceCheckUtils]: 12: Hoare triple {12556#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {12547#false} is VALID [2022-04-28 03:56:22,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {12547#false} assume !false; {12547#false} is VALID [2022-04-28 03:56:22,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:56:22,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:56:22,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159617840] [2022-04-28 03:56:22,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159617840] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:56:22,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674667805] [2022-04-28 03:56:22,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:56:22,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:56:22,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:56:22,906 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:56:22,907 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:56:22,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:22,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:56:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:22,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:56:23,264 INFO L272 TraceCheckUtils]: 0: Hoare triple {12546#true} call ULTIMATE.init(); {12546#true} is VALID [2022-04-28 03:56:23,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {12546#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(17, 2);call #Ultimate.allocInit(12, 3); {12546#true} is VALID [2022-04-28 03:56:23,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {12546#true} assume true; {12546#true} is VALID [2022-04-28 03:56:23,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12546#true} {12546#true} #41#return; {12546#true} is VALID [2022-04-28 03:56:23,265 INFO L272 TraceCheckUtils]: 4: Hoare triple {12546#true} call #t~ret4 := main(); {12546#true} is VALID [2022-04-28 03:56:23,265 INFO L290 TraceCheckUtils]: 5: Hoare triple {12546#true} ~x~0 := 0;~y~0 := 500000; {12576#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:56:23,266 INFO L290 TraceCheckUtils]: 6: Hoare triple {12576#(and (<= main_~x~0 0) (= main_~y~0 500000))} [157] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_908 v_main_~x~0_907))) (or (and (not (< v_main_~x~0_908 500000)) .cse0) (and (< v_main_~x~0_907 500001) (< v_main_~x~0_908 v_main_~x~0_907)) .cse0)) InVars {main_~x~0=v_main_~x~0_908} OutVars{main_~x~0=v_main_~x~0_907} AuxVars[] AssignedVars[main_~x~0] {12580#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:56:23,266 INFO L290 TraceCheckUtils]: 7: Hoare triple {12580#(and (= main_~y~0 500000) (< main_~x~0 500001))} [158] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12580#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:56:23,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {12580#(and (= main_~y~0 500000) (< main_~x~0 500001))} [159] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_910 v_main_~x~0_909)) (.cse1 (= v_main_~y~0_628 v_main_~y~0_627)) (.cse2 (<= 500000 v_main_~x~0_910))) (or (and .cse0 .cse1) (and (or (not .cse2) (not (< v_main_~x~0_910 1000000))) .cse0 .cse1) (and (< v_main_~x~0_910 v_main_~x~0_909) .cse2 (< v_main_~x~0_909 1000001) (= (+ v_main_~x~0_909 v_main_~y~0_628) (+ v_main_~x~0_910 v_main_~y~0_627))))) InVars {main_~x~0=v_main_~x~0_910, main_~y~0=v_main_~y~0_628} OutVars{main_~x~0=v_main_~x~0_909, main_~y~0=v_main_~y~0_627} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {12587#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:56:23,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {12587#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [156] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {12591#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:56:23,268 INFO L272 TraceCheckUtils]: 10: Hoare triple {12591#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {12595#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:56:23,268 INFO L290 TraceCheckUtils]: 11: Hoare triple {12595#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12599#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:56:23,269 INFO L290 TraceCheckUtils]: 12: Hoare triple {12599#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12547#false} is VALID [2022-04-28 03:56:23,269 INFO L290 TraceCheckUtils]: 13: Hoare triple {12547#false} assume !false; {12547#false} is VALID [2022-04-28 03:56:23,269 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:56:23,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:56:23,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {12547#false} assume !false; {12547#false} is VALID [2022-04-28 03:56:23,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {12599#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12547#false} is VALID [2022-04-28 03:56:23,563 INFO L290 TraceCheckUtils]: 11: Hoare triple {12595#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12599#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:56:23,564 INFO L272 TraceCheckUtils]: 10: Hoare triple {12554#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {12595#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:56:23,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {12618#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [156] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {12554#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:56:23,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {12622#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [159] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_910 v_main_~x~0_909)) (.cse1 (= v_main_~y~0_628 v_main_~y~0_627)) (.cse2 (<= 500000 v_main_~x~0_910))) (or (and .cse0 .cse1) (and (or (not .cse2) (not (< v_main_~x~0_910 1000000))) .cse0 .cse1) (and (< v_main_~x~0_910 v_main_~x~0_909) .cse2 (< v_main_~x~0_909 1000001) (= (+ v_main_~x~0_909 v_main_~y~0_628) (+ v_main_~x~0_910 v_main_~y~0_627))))) InVars {main_~x~0=v_main_~x~0_910, main_~y~0=v_main_~y~0_628} OutVars{main_~x~0=v_main_~x~0_909, main_~y~0=v_main_~y~0_627} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {12618#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:56:23,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {12622#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [158] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12622#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:56:23,566 INFO L290 TraceCheckUtils]: 6: Hoare triple {12629#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [157] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_908 v_main_~x~0_907))) (or (and (not (< v_main_~x~0_908 500000)) .cse0) (and (< v_main_~x~0_907 500001) (< v_main_~x~0_908 v_main_~x~0_907)) .cse0)) InVars {main_~x~0=v_main_~x~0_908} OutVars{main_~x~0=v_main_~x~0_907} AuxVars[] AssignedVars[main_~x~0] {12622#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:56:23,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {12546#true} ~x~0 := 0;~y~0 := 500000; {12629#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:56:23,567 INFO L272 TraceCheckUtils]: 4: Hoare triple {12546#true} call #t~ret4 := main(); {12546#true} is VALID [2022-04-28 03:56:23,567 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12546#true} {12546#true} #41#return; {12546#true} is VALID [2022-04-28 03:56:23,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {12546#true} assume true; {12546#true} is VALID [2022-04-28 03:56:23,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {12546#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(17, 2);call #Ultimate.allocInit(12, 3); {12546#true} is VALID [2022-04-28 03:56:23,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {12546#true} call ULTIMATE.init(); {12546#true} is VALID [2022-04-28 03:56:23,567 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:56:23,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674667805] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:56:23,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:56:23,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 03:56:24,684 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:56:24,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1992956191] [2022-04-28 03:56:24,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1992956191] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:56:24,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:56:24,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-28 03:56:24,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252840699] [2022-04-28 03:56:24,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:56:24,685 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 34 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:56:24,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:56:24,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 34 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:56:24,733 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:56:24,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-28 03:56:24,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:56:24,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-28 03:56:24,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=1934, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 03:56:24,733 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand has 36 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 34 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:56:28,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:56:28,412 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2022-04-28 03:56:28,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-28 03:56:28,413 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 34 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:56:28,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:56:28,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 34 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:56:28,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 87 transitions. [2022-04-28 03:56:28,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 34 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:56:28,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 87 transitions. [2022-04-28 03:56:28,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 87 transitions. [2022-04-28 03:56:28,502 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:56:28,503 INFO L225 Difference]: With dead ends: 82 [2022-04-28 03:56:28,503 INFO L226 Difference]: Without dead ends: 75 [2022-04-28 03:56:28,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1375 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=661, Invalid=5501, Unknown=0, NotChecked=0, Total=6162 [2022-04-28 03:56:28,504 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 67 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2058 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 2123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 2058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:56:28,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 143 Invalid, 2123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 2058 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-28 03:56:28,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-28 03:56:28,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-04-28 03:56:28,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:56:28,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 75 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 70 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:28,673 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 75 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 70 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:28,673 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 75 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 70 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:28,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:56:28,674 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2022-04-28 03:56:28,674 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-04-28 03:56:28,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:56:28,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:56:28,675 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 70 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-28 03:56:28,675 INFO L87 Difference]: Start difference. First operand has 75 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 70 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-28 03:56:28,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:56:28,675 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2022-04-28 03:56:28,675 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-04-28 03:56:28,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:56:28,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:56:28,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:56:28,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:56:28,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 70 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:28,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2022-04-28 03:56:28,677 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 71 [2022-04-28 03:56:28,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:56:28,677 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2022-04-28 03:56:28,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 34 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:56:28,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 78 transitions. [2022-04-28 03:56:28,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:56:28,765 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-04-28 03:56:28,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 03:56:28,765 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:56:28,765 INFO L195 NwaCegarLoop]: trace histogram [31, 29, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:56:28,783 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:56:28,965 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:56:28,966 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:56:28,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:56:28,966 INFO L85 PathProgramCache]: Analyzing trace with hash -728490932, now seen corresponding path program 29 times [2022-04-28 03:56:28,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:56:28,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1164344441] [2022-04-28 03:56:29,042 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:56:29,206 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:56:29,207 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:56:29,209 INFO L85 PathProgramCache]: Analyzing trace with hash -2138970193, now seen corresponding path program 1 times [2022-04-28 03:56:29,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:56:29,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511079010] [2022-04-28 03:56:29,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:56:29,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:56:29,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:29,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:56:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:29,296 INFO L290 TraceCheckUtils]: 0: Hoare triple {13217#(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(17, 2);call #Ultimate.allocInit(12, 3); {13206#true} is VALID [2022-04-28 03:56:29,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {13206#true} assume true; {13206#true} is VALID [2022-04-28 03:56:29,296 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13206#true} {13206#true} #41#return; {13206#true} is VALID [2022-04-28 03:56:29,297 INFO L272 TraceCheckUtils]: 0: Hoare triple {13206#true} call ULTIMATE.init(); {13217#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:56:29,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {13217#(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(17, 2);call #Ultimate.allocInit(12, 3); {13206#true} is VALID [2022-04-28 03:56:29,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {13206#true} assume true; {13206#true} is VALID [2022-04-28 03:56:29,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13206#true} {13206#true} #41#return; {13206#true} is VALID [2022-04-28 03:56:29,297 INFO L272 TraceCheckUtils]: 4: Hoare triple {13206#true} call #t~ret4 := main(); {13206#true} is VALID [2022-04-28 03:56:29,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {13206#true} ~x~0 := 0;~y~0 := 500000; {13211#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:56:29,298 INFO L290 TraceCheckUtils]: 6: Hoare triple {13211#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [161] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_955 v_main_~x~0_954))) (or (and .cse0 (<= 500000 v_main_~x~0_955)) (and (< v_main_~x~0_955 v_main_~x~0_954) (< v_main_~x~0_954 500001)) .cse0)) InVars {main_~x~0=v_main_~x~0_955} OutVars{main_~x~0=v_main_~x~0_954} AuxVars[] AssignedVars[main_~x~0] {13212#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:56:29,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {13212#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [162] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13212#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:56:29,299 INFO L290 TraceCheckUtils]: 8: Hoare triple {13212#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [163] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_957)) (.cse1 (= v_main_~x~0_957 v_main_~x~0_956))) (or (and (= v_main_~y~0_664 v_main_~y~0_665) (or (not .cse0) (not (< v_main_~x~0_957 1000000))) .cse1) (and (= (+ v_main_~x~0_956 v_main_~y~0_665) (+ v_main_~x~0_957 v_main_~y~0_664)) (< v_main_~x~0_956 1000001) (< v_main_~x~0_957 v_main_~x~0_956) .cse0) (and (= v_main_~y~0_665 v_main_~y~0_664) .cse1))) InVars {main_~x~0=v_main_~x~0_957, main_~y~0=v_main_~y~0_665} OutVars{main_~x~0=v_main_~x~0_956, main_~y~0=v_main_~y~0_664} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {13213#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:56:29,300 INFO L290 TraceCheckUtils]: 9: Hoare triple {13213#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [160] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {13214#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:56:29,300 INFO L272 TraceCheckUtils]: 10: Hoare triple {13214#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {13215#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:56:29,301 INFO L290 TraceCheckUtils]: 11: Hoare triple {13215#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {13216#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:56:29,301 INFO L290 TraceCheckUtils]: 12: Hoare triple {13216#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {13207#false} is VALID [2022-04-28 03:56:29,301 INFO L290 TraceCheckUtils]: 13: Hoare triple {13207#false} assume !false; {13207#false} is VALID [2022-04-28 03:56:29,301 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:56:29,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:56:29,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511079010] [2022-04-28 03:56:29,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511079010] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:56:29,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204909800] [2022-04-28 03:56:29,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:56:29,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:56:29,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:56:29,303 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:56:29,303 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:56:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:29,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:56:29,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:29,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:56:29,679 INFO L272 TraceCheckUtils]: 0: Hoare triple {13206#true} call ULTIMATE.init(); {13206#true} is VALID [2022-04-28 03:56:29,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {13206#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(17, 2);call #Ultimate.allocInit(12, 3); {13206#true} is VALID [2022-04-28 03:56:29,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {13206#true} assume true; {13206#true} is VALID [2022-04-28 03:56:29,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13206#true} {13206#true} #41#return; {13206#true} is VALID [2022-04-28 03:56:29,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {13206#true} call #t~ret4 := main(); {13206#true} is VALID [2022-04-28 03:56:29,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {13206#true} ~x~0 := 0;~y~0 := 500000; {13236#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:56:29,680 INFO L290 TraceCheckUtils]: 6: Hoare triple {13236#(and (<= main_~x~0 0) (= main_~y~0 500000))} [161] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_955 v_main_~x~0_954))) (or (and .cse0 (<= 500000 v_main_~x~0_955)) (and (< v_main_~x~0_955 v_main_~x~0_954) (< v_main_~x~0_954 500001)) .cse0)) InVars {main_~x~0=v_main_~x~0_955} OutVars{main_~x~0=v_main_~x~0_954} AuxVars[] AssignedVars[main_~x~0] {13240#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:56:29,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {13240#(and (= main_~y~0 500000) (< main_~x~0 500001))} [162] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13240#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:56:29,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {13240#(and (= main_~y~0 500000) (< main_~x~0 500001))} [163] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_957)) (.cse1 (= v_main_~x~0_957 v_main_~x~0_956))) (or (and (= v_main_~y~0_664 v_main_~y~0_665) (or (not .cse0) (not (< v_main_~x~0_957 1000000))) .cse1) (and (= (+ v_main_~x~0_956 v_main_~y~0_665) (+ v_main_~x~0_957 v_main_~y~0_664)) (< v_main_~x~0_956 1000001) (< v_main_~x~0_957 v_main_~x~0_956) .cse0) (and (= v_main_~y~0_665 v_main_~y~0_664) .cse1))) InVars {main_~x~0=v_main_~x~0_957, main_~y~0=v_main_~y~0_665} OutVars{main_~x~0=v_main_~x~0_956, main_~y~0=v_main_~y~0_664} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {13247#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:56:29,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {13247#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [160] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {13251#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:56:29,682 INFO L272 TraceCheckUtils]: 10: Hoare triple {13251#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {13255#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:56:29,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {13255#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13259#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:56:29,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {13259#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13207#false} is VALID [2022-04-28 03:56:29,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {13207#false} assume !false; {13207#false} is VALID [2022-04-28 03:56:29,683 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:56:29,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:56:29,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {13207#false} assume !false; {13207#false} is VALID [2022-04-28 03:56:29,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {13259#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13207#false} is VALID [2022-04-28 03:56:29,994 INFO L290 TraceCheckUtils]: 11: Hoare triple {13255#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13259#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:56:29,994 INFO L272 TraceCheckUtils]: 10: Hoare triple {13214#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {13255#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:56:29,995 INFO L290 TraceCheckUtils]: 9: Hoare triple {13278#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [160] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {13214#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:56:29,995 INFO L290 TraceCheckUtils]: 8: Hoare triple {13282#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [163] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_957)) (.cse1 (= v_main_~x~0_957 v_main_~x~0_956))) (or (and (= v_main_~y~0_664 v_main_~y~0_665) (or (not .cse0) (not (< v_main_~x~0_957 1000000))) .cse1) (and (= (+ v_main_~x~0_956 v_main_~y~0_665) (+ v_main_~x~0_957 v_main_~y~0_664)) (< v_main_~x~0_956 1000001) (< v_main_~x~0_957 v_main_~x~0_956) .cse0) (and (= v_main_~y~0_665 v_main_~y~0_664) .cse1))) InVars {main_~x~0=v_main_~x~0_957, main_~y~0=v_main_~y~0_665} OutVars{main_~x~0=v_main_~x~0_956, main_~y~0=v_main_~y~0_664} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {13278#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:56:29,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {13282#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [162] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13282#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:56:29,996 INFO L290 TraceCheckUtils]: 6: Hoare triple {13289#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [161] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_955 v_main_~x~0_954))) (or (and .cse0 (<= 500000 v_main_~x~0_955)) (and (< v_main_~x~0_955 v_main_~x~0_954) (< v_main_~x~0_954 500001)) .cse0)) InVars {main_~x~0=v_main_~x~0_955} OutVars{main_~x~0=v_main_~x~0_954} AuxVars[] AssignedVars[main_~x~0] {13282#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:56:29,997 INFO L290 TraceCheckUtils]: 5: Hoare triple {13206#true} ~x~0 := 0;~y~0 := 500000; {13289#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:56:29,997 INFO L272 TraceCheckUtils]: 4: Hoare triple {13206#true} call #t~ret4 := main(); {13206#true} is VALID [2022-04-28 03:56:29,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13206#true} {13206#true} #41#return; {13206#true} is VALID [2022-04-28 03:56:29,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {13206#true} assume true; {13206#true} is VALID [2022-04-28 03:56:29,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {13206#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(17, 2);call #Ultimate.allocInit(12, 3); {13206#true} is VALID [2022-04-28 03:56:29,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {13206#true} call ULTIMATE.init(); {13206#true} is VALID [2022-04-28 03:56:29,997 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:56:29,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204909800] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:56:29,998 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:56:29,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 03:56:31,167 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:56:31,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1164344441] [2022-04-28 03:56:31,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1164344441] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:56:31,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:56:31,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-28 03:56:31,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536267257] [2022-04-28 03:56:31,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:56:31,168 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 35 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:56:31,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:56:31,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 35 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:56:31,218 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:56:31,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-28 03:56:31,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:56:31,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-28 03:56:31,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=2022, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 03:56:31,219 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 37 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 35 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:56:34,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:56:34,830 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2022-04-28 03:56:34,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-28 03:56:34,830 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 35 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:56:34,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:56:34,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 35 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:56:34,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 89 transitions. [2022-04-28 03:56:34,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 35 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:56:34,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 89 transitions. [2022-04-28 03:56:34,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 89 transitions. [2022-04-28 03:56:34,914 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:56:34,915 INFO L225 Difference]: With dead ends: 84 [2022-04-28 03:56:34,915 INFO L226 Difference]: Without dead ends: 77 [2022-04-28 03:56:34,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1433 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=680, Invalid=5800, Unknown=0, NotChecked=0, Total=6480 [2022-04-28 03:56:34,916 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 69 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1992 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 2059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:56:34,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 58 Invalid, 2059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1992 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-28 03:56:34,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-28 03:56:35,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-04-28 03:56:35,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:56:35,123 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 77 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 72 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:35,123 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 77 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 72 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:35,123 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 77 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 72 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:35,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:56:35,124 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2022-04-28 03:56:35,124 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2022-04-28 03:56:35,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:56:35,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:56:35,125 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 72 states have internal predecessors, (76), 3 states have call successors, (3), 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:56:35,125 INFO L87 Difference]: Start difference. First operand has 77 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 72 states have internal predecessors, (76), 3 states have call successors, (3), 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:56:35,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:56:35,125 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2022-04-28 03:56:35,126 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2022-04-28 03:56:35,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:56:35,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:56:35,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:56:35,126 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:56:35,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 72 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:35,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2022-04-28 03:56:35,127 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 73 [2022-04-28 03:56:35,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:56:35,127 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2022-04-28 03:56:35,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 35 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:56:35,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 80 transitions. [2022-04-28 03:56:35,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:56:35,198 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2022-04-28 03:56:35,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-28 03:56:35,198 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:56:35,198 INFO L195 NwaCegarLoop]: trace histogram [32, 30, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:56:35,216 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:56:35,411 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:56:35,411 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:56:35,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:56:35,412 INFO L85 PathProgramCache]: Analyzing trace with hash 236316455, now seen corresponding path program 30 times [2022-04-28 03:56:35,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:56:35,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [670124578] [2022-04-28 03:56:37,656 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:56:37,849 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:56:37,850 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:56:37,852 INFO L85 PathProgramCache]: Analyzing trace with hash -89438033, now seen corresponding path program 1 times [2022-04-28 03:56:37,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:56:37,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564867978] [2022-04-28 03:56:37,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:56:37,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:56:37,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:37,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:56:37,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:37,929 INFO L290 TraceCheckUtils]: 0: Hoare triple {13892#(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(17, 2);call #Ultimate.allocInit(12, 3); {13881#true} is VALID [2022-04-28 03:56:37,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {13881#true} assume true; {13881#true} is VALID [2022-04-28 03:56:37,929 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13881#true} {13881#true} #41#return; {13881#true} is VALID [2022-04-28 03:56:37,930 INFO L272 TraceCheckUtils]: 0: Hoare triple {13881#true} call ULTIMATE.init(); {13892#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:56:37,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {13892#(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(17, 2);call #Ultimate.allocInit(12, 3); {13881#true} is VALID [2022-04-28 03:56:37,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {13881#true} assume true; {13881#true} is VALID [2022-04-28 03:56:37,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13881#true} {13881#true} #41#return; {13881#true} is VALID [2022-04-28 03:56:37,930 INFO L272 TraceCheckUtils]: 4: Hoare triple {13881#true} call #t~ret4 := main(); {13881#true} is VALID [2022-04-28 03:56:37,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {13881#true} ~x~0 := 0;~y~0 := 500000; {13886#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:56:37,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {13886#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [165] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1003 v_main_~x~0_1002))) (or .cse0 (and (< v_main_~x~0_1002 500001) (< v_main_~x~0_1003 v_main_~x~0_1002)) (and .cse0 (<= 500000 v_main_~x~0_1003)))) InVars {main_~x~0=v_main_~x~0_1003} OutVars{main_~x~0=v_main_~x~0_1002} AuxVars[] AssignedVars[main_~x~0] {13887#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:56:37,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {13887#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [166] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13887#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:56:37,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {13887#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [167] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_1005 v_main_~x~0_1004)) (.cse0 (<= 500000 v_main_~x~0_1005)) (.cse2 (= v_main_~y~0_703 v_main_~y~0_702))) (or (and (= (+ v_main_~x~0_1004 v_main_~y~0_703) (+ v_main_~x~0_1005 v_main_~y~0_702)) .cse0 (< v_main_~x~0_1004 1000001) (< v_main_~x~0_1005 v_main_~x~0_1004)) (and .cse1 .cse2) (and .cse1 (or (not (< v_main_~x~0_1005 1000000)) (not .cse0)) .cse2))) InVars {main_~x~0=v_main_~x~0_1005, main_~y~0=v_main_~y~0_703} OutVars{main_~x~0=v_main_~x~0_1004, main_~y~0=v_main_~y~0_702} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {13888#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:56:37,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {13888#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [164] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {13889#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-28 03:56:37,933 INFO L272 TraceCheckUtils]: 10: Hoare triple {13889#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {13890#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:56:37,933 INFO L290 TraceCheckUtils]: 11: Hoare triple {13890#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {13891#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:56:37,934 INFO L290 TraceCheckUtils]: 12: Hoare triple {13891#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {13882#false} is VALID [2022-04-28 03:56:37,934 INFO L290 TraceCheckUtils]: 13: Hoare triple {13882#false} assume !false; {13882#false} is VALID [2022-04-28 03:56:37,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:56:37,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:56:37,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564867978] [2022-04-28 03:56:37,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564867978] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:56:37,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470259137] [2022-04-28 03:56:37,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:56:37,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:56:37,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:56:37,935 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:56:37,936 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:56:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:37,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:56:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:37,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:56:38,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {13881#true} call ULTIMATE.init(); {13881#true} is VALID [2022-04-28 03:56:38,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {13881#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(17, 2);call #Ultimate.allocInit(12, 3); {13881#true} is VALID [2022-04-28 03:56:38,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {13881#true} assume true; {13881#true} is VALID [2022-04-28 03:56:38,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13881#true} {13881#true} #41#return; {13881#true} is VALID [2022-04-28 03:56:38,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {13881#true} call #t~ret4 := main(); {13881#true} is VALID [2022-04-28 03:56:38,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {13881#true} ~x~0 := 0;~y~0 := 500000; {13911#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:56:38,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {13911#(and (<= main_~x~0 0) (= main_~y~0 500000))} [165] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1003 v_main_~x~0_1002))) (or .cse0 (and (< v_main_~x~0_1002 500001) (< v_main_~x~0_1003 v_main_~x~0_1002)) (and .cse0 (<= 500000 v_main_~x~0_1003)))) InVars {main_~x~0=v_main_~x~0_1003} OutVars{main_~x~0=v_main_~x~0_1002} AuxVars[] AssignedVars[main_~x~0] {13915#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:56:38,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {13915#(and (= main_~y~0 500000) (< main_~x~0 500001))} [166] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13915#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:56:38,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {13915#(and (= main_~y~0 500000) (< main_~x~0 500001))} [167] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_1005 v_main_~x~0_1004)) (.cse0 (<= 500000 v_main_~x~0_1005)) (.cse2 (= v_main_~y~0_703 v_main_~y~0_702))) (or (and (= (+ v_main_~x~0_1004 v_main_~y~0_703) (+ v_main_~x~0_1005 v_main_~y~0_702)) .cse0 (< v_main_~x~0_1004 1000001) (< v_main_~x~0_1005 v_main_~x~0_1004)) (and .cse1 .cse2) (and .cse1 (or (not (< v_main_~x~0_1005 1000000)) (not .cse0)) .cse2))) InVars {main_~x~0=v_main_~x~0_1005, main_~y~0=v_main_~y~0_703} OutVars{main_~x~0=v_main_~x~0_1004, main_~y~0=v_main_~y~0_702} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {13922#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:56:38,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {13922#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [164] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {13926#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:56:38,327 INFO L272 TraceCheckUtils]: 10: Hoare triple {13926#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {13930#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:56:38,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {13930#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13934#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:56:38,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {13934#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13882#false} is VALID [2022-04-28 03:56:38,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {13882#false} assume !false; {13882#false} is VALID [2022-04-28 03:56:38,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:56:38,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:56:38,626 INFO L290 TraceCheckUtils]: 13: Hoare triple {13882#false} assume !false; {13882#false} is VALID [2022-04-28 03:56:38,626 INFO L290 TraceCheckUtils]: 12: Hoare triple {13934#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13882#false} is VALID [2022-04-28 03:56:38,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {13930#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13934#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:56:38,627 INFO L272 TraceCheckUtils]: 10: Hoare triple {13889#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {13930#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:56:38,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {13953#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [164] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {13889#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-28 03:56:38,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {13957#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [167] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_1005 v_main_~x~0_1004)) (.cse0 (<= 500000 v_main_~x~0_1005)) (.cse2 (= v_main_~y~0_703 v_main_~y~0_702))) (or (and (= (+ v_main_~x~0_1004 v_main_~y~0_703) (+ v_main_~x~0_1005 v_main_~y~0_702)) .cse0 (< v_main_~x~0_1004 1000001) (< v_main_~x~0_1005 v_main_~x~0_1004)) (and .cse1 .cse2) (and .cse1 (or (not (< v_main_~x~0_1005 1000000)) (not .cse0)) .cse2))) InVars {main_~x~0=v_main_~x~0_1005, main_~y~0=v_main_~y~0_703} OutVars{main_~x~0=v_main_~x~0_1004, main_~y~0=v_main_~y~0_702} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {13953#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:56:38,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {13957#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [166] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13957#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:56:38,630 INFO L290 TraceCheckUtils]: 6: Hoare triple {13964#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))))} [165] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1003 v_main_~x~0_1002))) (or .cse0 (and (< v_main_~x~0_1002 500001) (< v_main_~x~0_1003 v_main_~x~0_1002)) (and .cse0 (<= 500000 v_main_~x~0_1003)))) InVars {main_~x~0=v_main_~x~0_1003} OutVars{main_~x~0=v_main_~x~0_1002} AuxVars[] AssignedVars[main_~x~0] {13957#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:56:38,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {13881#true} ~x~0 := 0;~y~0 := 500000; {13964#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))))} is VALID [2022-04-28 03:56:38,630 INFO L272 TraceCheckUtils]: 4: Hoare triple {13881#true} call #t~ret4 := main(); {13881#true} is VALID [2022-04-28 03:56:38,630 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13881#true} {13881#true} #41#return; {13881#true} is VALID [2022-04-28 03:56:38,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {13881#true} assume true; {13881#true} is VALID [2022-04-28 03:56:38,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {13881#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(17, 2);call #Ultimate.allocInit(12, 3); {13881#true} is VALID [2022-04-28 03:56:38,630 INFO L272 TraceCheckUtils]: 0: Hoare triple {13881#true} call ULTIMATE.init(); {13881#true} is VALID [2022-04-28 03:56:38,630 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:56:38,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470259137] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:56:38,631 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:56:38,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 03:56:39,845 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:56:39,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [670124578] [2022-04-28 03:56:39,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [670124578] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:56:39,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:56:39,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-28 03:56:39,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933774952] [2022-04-28 03:56:39,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:56:39,846 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 36 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:56:39,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:56:39,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 36 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:56:39,897 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:56:39,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-28 03:56:39,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:56:39,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-28 03:56:39,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=2112, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 03:56:39,898 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand has 38 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 36 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:56:43,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:56:43,901 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2022-04-28 03:56:43,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-28 03:56:43,901 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 36 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:56:43,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:56:43,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 36 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:56:43,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 91 transitions. [2022-04-28 03:56:43,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 36 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:56:43,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 91 transitions. [2022-04-28 03:56:43,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 91 transitions. [2022-04-28 03:56:43,973 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:56:43,973 INFO L225 Difference]: With dead ends: 86 [2022-04-28 03:56:43,973 INFO L226 Difference]: Without dead ends: 79 [2022-04-28 03:56:43,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1492 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=699, Invalid=6107, Unknown=0, NotChecked=0, Total=6806 [2022-04-28 03:56:43,974 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 71 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 2227 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 2296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 2227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:56:43,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 108 Invalid, 2296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 2227 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-28 03:56:43,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-28 03:56:44,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-04-28 03:56:44,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:56:44,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 79 states, 74 states have (on average 1.054054054054054) internal successors, (78), 74 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:44,169 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 79 states, 74 states have (on average 1.054054054054054) internal successors, (78), 74 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:44,169 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 79 states, 74 states have (on average 1.054054054054054) internal successors, (78), 74 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:44,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:56:44,170 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2022-04-28 03:56:44,170 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2022-04-28 03:56:44,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:56:44,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:56:44,170 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 74 states have (on average 1.054054054054054) internal successors, (78), 74 states have internal predecessors, (78), 3 states have call successors, (3), 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:56:44,170 INFO L87 Difference]: Start difference. First operand has 79 states, 74 states have (on average 1.054054054054054) internal successors, (78), 74 states have internal predecessors, (78), 3 states have call successors, (3), 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:56:44,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:56:44,171 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2022-04-28 03:56:44,171 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2022-04-28 03:56:44,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:56:44,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:56:44,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:56:44,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:56:44,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.054054054054054) internal successors, (78), 74 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:44,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2022-04-28 03:56:44,172 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 75 [2022-04-28 03:56:44,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:56:44,172 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2022-04-28 03:56:44,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 36 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:56:44,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 82 transitions. [2022-04-28 03:56:44,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:56:44,236 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2022-04-28 03:56:44,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-28 03:56:44,243 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:56:44,243 INFO L195 NwaCegarLoop]: trace histogram [33, 31, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:56:44,259 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:56:44,443 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:56:44,444 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:56:44,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:56:44,444 INFO L85 PathProgramCache]: Analyzing trace with hash -296720574, now seen corresponding path program 31 times [2022-04-28 03:56:44,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:56:44,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2065280194] [2022-04-28 03:56:44,534 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:56:48,636 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:56:48,724 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:56:48,725 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:56:48,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1960094127, now seen corresponding path program 1 times [2022-04-28 03:56:48,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:56:48,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155350796] [2022-04-28 03:56:48,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:56:48,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:56:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:48,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:56:48,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:48,834 INFO L290 TraceCheckUtils]: 0: Hoare triple {14582#(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(17, 2);call #Ultimate.allocInit(12, 3); {14571#true} is VALID [2022-04-28 03:56:48,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {14571#true} assume true; {14571#true} is VALID [2022-04-28 03:56:48,835 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14571#true} {14571#true} #41#return; {14571#true} is VALID [2022-04-28 03:56:48,835 INFO L272 TraceCheckUtils]: 0: Hoare triple {14571#true} call ULTIMATE.init(); {14582#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:56:48,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {14582#(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(17, 2);call #Ultimate.allocInit(12, 3); {14571#true} is VALID [2022-04-28 03:56:48,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {14571#true} assume true; {14571#true} is VALID [2022-04-28 03:56:48,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14571#true} {14571#true} #41#return; {14571#true} is VALID [2022-04-28 03:56:48,835 INFO L272 TraceCheckUtils]: 4: Hoare triple {14571#true} call #t~ret4 := main(); {14571#true} is VALID [2022-04-28 03:56:48,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {14571#true} ~x~0 := 0;~y~0 := 500000; {14576#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:56:48,836 INFO L290 TraceCheckUtils]: 6: Hoare triple {14576#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [169] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1052 v_main_~x~0_1051))) (or .cse0 (and (< v_main_~x~0_1051 500001) (< v_main_~x~0_1052 v_main_~x~0_1051)) (and (not (< v_main_~x~0_1052 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_1052} OutVars{main_~x~0=v_main_~x~0_1051} AuxVars[] AssignedVars[main_~x~0] {14577#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:56:48,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {14577#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [170] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14577#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:56:48,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {14577#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [171] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1054 v_main_~x~0_1053)) (.cse1 (<= 500000 v_main_~x~0_1054))) (or (and .cse0 (= v_main_~y~0_742 v_main_~y~0_741)) (and (or (not (< v_main_~x~0_1054 1000000)) (not .cse1)) (= v_main_~y~0_741 v_main_~y~0_742) .cse0) (and (= (+ v_main_~x~0_1053 v_main_~y~0_742) (+ v_main_~x~0_1054 v_main_~y~0_741)) (< v_main_~x~0_1053 1000001) (< v_main_~x~0_1054 v_main_~x~0_1053) .cse1))) InVars {main_~x~0=v_main_~x~0_1054, main_~y~0=v_main_~y~0_742} OutVars{main_~x~0=v_main_~x~0_1053, main_~y~0=v_main_~y~0_741} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {14578#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:56:48,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {14578#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [168] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {14579#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:56:48,839 INFO L272 TraceCheckUtils]: 10: Hoare triple {14579#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {14580#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:56:48,839 INFO L290 TraceCheckUtils]: 11: Hoare triple {14580#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {14581#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:56:48,839 INFO L290 TraceCheckUtils]: 12: Hoare triple {14581#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {14572#false} is VALID [2022-04-28 03:56:48,839 INFO L290 TraceCheckUtils]: 13: Hoare triple {14572#false} assume !false; {14572#false} is VALID [2022-04-28 03:56:48,840 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:56:48,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:56:48,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155350796] [2022-04-28 03:56:48,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155350796] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:56:48,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435879804] [2022-04-28 03:56:48,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:56:48,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:56:48,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:56:48,841 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:56:48,842 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:56:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:48,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:56:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:48,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:56:49,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {14571#true} call ULTIMATE.init(); {14571#true} is VALID [2022-04-28 03:56:49,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {14571#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(17, 2);call #Ultimate.allocInit(12, 3); {14571#true} is VALID [2022-04-28 03:56:49,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {14571#true} assume true; {14571#true} is VALID [2022-04-28 03:56:49,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14571#true} {14571#true} #41#return; {14571#true} is VALID [2022-04-28 03:56:49,206 INFO L272 TraceCheckUtils]: 4: Hoare triple {14571#true} call #t~ret4 := main(); {14571#true} is VALID [2022-04-28 03:56:49,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {14571#true} ~x~0 := 0;~y~0 := 500000; {14601#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:56:49,207 INFO L290 TraceCheckUtils]: 6: Hoare triple {14601#(and (<= main_~x~0 0) (= main_~y~0 500000))} [169] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1052 v_main_~x~0_1051))) (or .cse0 (and (< v_main_~x~0_1051 500001) (< v_main_~x~0_1052 v_main_~x~0_1051)) (and (not (< v_main_~x~0_1052 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_1052} OutVars{main_~x~0=v_main_~x~0_1051} AuxVars[] AssignedVars[main_~x~0] {14605#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:56:49,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {14605#(and (= main_~y~0 500000) (< main_~x~0 500001))} [170] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14605#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:56:49,208 INFO L290 TraceCheckUtils]: 8: Hoare triple {14605#(and (= main_~y~0 500000) (< main_~x~0 500001))} [171] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1054 v_main_~x~0_1053)) (.cse1 (<= 500000 v_main_~x~0_1054))) (or (and .cse0 (= v_main_~y~0_742 v_main_~y~0_741)) (and (or (not (< v_main_~x~0_1054 1000000)) (not .cse1)) (= v_main_~y~0_741 v_main_~y~0_742) .cse0) (and (= (+ v_main_~x~0_1053 v_main_~y~0_742) (+ v_main_~x~0_1054 v_main_~y~0_741)) (< v_main_~x~0_1053 1000001) (< v_main_~x~0_1054 v_main_~x~0_1053) .cse1))) InVars {main_~x~0=v_main_~x~0_1054, main_~y~0=v_main_~y~0_742} OutVars{main_~x~0=v_main_~x~0_1053, main_~y~0=v_main_~y~0_741} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {14612#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:56:49,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {14612#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [168] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {14616#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:56:49,209 INFO L272 TraceCheckUtils]: 10: Hoare triple {14616#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {14620#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:56:49,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {14620#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14624#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:56:49,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {14624#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14572#false} is VALID [2022-04-28 03:56:49,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {14572#false} assume !false; {14572#false} is VALID [2022-04-28 03:56:49,210 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:56:49,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:56:49,509 INFO L290 TraceCheckUtils]: 13: Hoare triple {14572#false} assume !false; {14572#false} is VALID [2022-04-28 03:56:49,509 INFO L290 TraceCheckUtils]: 12: Hoare triple {14624#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14572#false} is VALID [2022-04-28 03:56:49,510 INFO L290 TraceCheckUtils]: 11: Hoare triple {14620#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14624#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:56:49,510 INFO L272 TraceCheckUtils]: 10: Hoare triple {14579#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {14620#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:56:49,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {14643#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [168] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {14579#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:56:49,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {14647#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [171] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1054 v_main_~x~0_1053)) (.cse1 (<= 500000 v_main_~x~0_1054))) (or (and .cse0 (= v_main_~y~0_742 v_main_~y~0_741)) (and (or (not (< v_main_~x~0_1054 1000000)) (not .cse1)) (= v_main_~y~0_741 v_main_~y~0_742) .cse0) (and (= (+ v_main_~x~0_1053 v_main_~y~0_742) (+ v_main_~x~0_1054 v_main_~y~0_741)) (< v_main_~x~0_1053 1000001) (< v_main_~x~0_1054 v_main_~x~0_1053) .cse1))) InVars {main_~x~0=v_main_~x~0_1054, main_~y~0=v_main_~y~0_742} OutVars{main_~x~0=v_main_~x~0_1053, main_~y~0=v_main_~y~0_741} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {14643#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:56:49,512 INFO L290 TraceCheckUtils]: 7: Hoare triple {14647#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [170] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14647#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:56:49,512 INFO L290 TraceCheckUtils]: 6: Hoare triple {14654#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [169] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1052 v_main_~x~0_1051))) (or .cse0 (and (< v_main_~x~0_1051 500001) (< v_main_~x~0_1052 v_main_~x~0_1051)) (and (not (< v_main_~x~0_1052 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_1052} OutVars{main_~x~0=v_main_~x~0_1051} AuxVars[] AssignedVars[main_~x~0] {14647#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:56:49,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {14571#true} ~x~0 := 0;~y~0 := 500000; {14654#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:56:49,513 INFO L272 TraceCheckUtils]: 4: Hoare triple {14571#true} call #t~ret4 := main(); {14571#true} is VALID [2022-04-28 03:56:49,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14571#true} {14571#true} #41#return; {14571#true} is VALID [2022-04-28 03:56:49,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {14571#true} assume true; {14571#true} is VALID [2022-04-28 03:56:49,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {14571#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(17, 2);call #Ultimate.allocInit(12, 3); {14571#true} is VALID [2022-04-28 03:56:49,513 INFO L272 TraceCheckUtils]: 0: Hoare triple {14571#true} call ULTIMATE.init(); {14571#true} is VALID [2022-04-28 03:56:49,513 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:56:49,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435879804] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:56:49,514 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:56:49,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 03:56:50,780 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:56:50,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2065280194] [2022-04-28 03:56:50,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2065280194] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:56:50,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:56:50,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-28 03:56:50,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383868427] [2022-04-28 03:56:50,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:56:50,780 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 37 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:56:50,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:56:50,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 37 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:56:50,833 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:56:50,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-28 03:56:50,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:56:50,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-28 03:56:50,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=2204, Unknown=0, NotChecked=0, Total=2550 [2022-04-28 03:56:50,834 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 39 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 37 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:56:55,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:56:55,128 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2022-04-28 03:56:55,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-28 03:56:55,128 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 37 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:56:55,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:56:55,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 37 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:56:55,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 93 transitions. [2022-04-28 03:56:55,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 37 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:56:55,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 93 transitions. [2022-04-28 03:56:55,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 93 transitions. [2022-04-28 03:56:55,209 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:56:55,211 INFO L225 Difference]: With dead ends: 88 [2022-04-28 03:56:55,211 INFO L226 Difference]: Without dead ends: 81 [2022-04-28 03:56:55,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1552 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=718, Invalid=6422, Unknown=0, NotChecked=0, Total=7140 [2022-04-28 03:56:55,223 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 73 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2422 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 2493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 2422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-28 03:56:55,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 138 Invalid, 2493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 2422 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-28 03:56:55,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-28 03:56:55,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-04-28 03:56:55,418 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:56:55,418 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 81 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 76 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:55,418 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 81 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 76 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:55,418 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 81 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 76 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:55,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:56:55,424 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2022-04-28 03:56:55,424 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2022-04-28 03:56:55,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:56:55,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:56:55,424 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 76 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 81 states. [2022-04-28 03:56:55,424 INFO L87 Difference]: Start difference. First operand has 81 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 76 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 81 states. [2022-04-28 03:56:55,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:56:55,425 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2022-04-28 03:56:55,425 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2022-04-28 03:56:55,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:56:55,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:56:55,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:56:55,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:56:55,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 76 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:55,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2022-04-28 03:56:55,426 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 77 [2022-04-28 03:56:55,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:56:55,426 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2022-04-28 03:56:55,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 37 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:56:55,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 84 transitions. [2022-04-28 03:56:55,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:56:55,502 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2022-04-28 03:56:55,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-28 03:56:55,503 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:56:55,503 INFO L195 NwaCegarLoop]: trace histogram [34, 32, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:56:55,522 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:56:55,703 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:56:55,703 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:56:55,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:56:55,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1444197219, now seen corresponding path program 32 times [2022-04-28 03:56:55,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:56:55,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [579266603] [2022-04-28 03:56:55,785 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:56:59,895 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:56:59,987 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:56:59,988 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:56:59,991 INFO L85 PathProgramCache]: Analyzing trace with hash -285341009, now seen corresponding path program 1 times [2022-04-28 03:56:59,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:56:59,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807962789] [2022-04-28 03:56:59,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:56:59,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:56:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:00,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:57:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:00,071 INFO L290 TraceCheckUtils]: 0: Hoare triple {15287#(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(17, 2);call #Ultimate.allocInit(12, 3); {15276#true} is VALID [2022-04-28 03:57:00,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {15276#true} assume true; {15276#true} is VALID [2022-04-28 03:57:00,071 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15276#true} {15276#true} #41#return; {15276#true} is VALID [2022-04-28 03:57:00,071 INFO L272 TraceCheckUtils]: 0: Hoare triple {15276#true} call ULTIMATE.init(); {15287#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:57:00,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {15287#(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(17, 2);call #Ultimate.allocInit(12, 3); {15276#true} is VALID [2022-04-28 03:57:00,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {15276#true} assume true; {15276#true} is VALID [2022-04-28 03:57:00,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15276#true} {15276#true} #41#return; {15276#true} is VALID [2022-04-28 03:57:00,072 INFO L272 TraceCheckUtils]: 4: Hoare triple {15276#true} call #t~ret4 := main(); {15276#true} is VALID [2022-04-28 03:57:00,072 INFO L290 TraceCheckUtils]: 5: Hoare triple {15276#true} ~x~0 := 0;~y~0 := 500000; {15281#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:57:00,072 INFO L290 TraceCheckUtils]: 6: Hoare triple {15281#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [173] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1102 v_main_~x~0_1101))) (or (and (< v_main_~x~0_1102 v_main_~x~0_1101) (< v_main_~x~0_1101 500001)) (and (not (< v_main_~x~0_1102 500000)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_1102} OutVars{main_~x~0=v_main_~x~0_1101} AuxVars[] AssignedVars[main_~x~0] {15282#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:57:00,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {15282#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [174] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15282#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:57:00,074 INFO L290 TraceCheckUtils]: 8: Hoare triple {15282#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [175] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_782 v_main_~y~0_781)) (.cse1 (= v_main_~x~0_1104 v_main_~x~0_1103)) (.cse2 (<= 500000 v_main_~x~0_1104))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_1104 1000000)) (not .cse2))) (and .cse0 .cse1) (and (< v_main_~x~0_1103 1000001) (< v_main_~x~0_1104 v_main_~x~0_1103) .cse2 (= (+ v_main_~x~0_1103 v_main_~y~0_782) (+ v_main_~x~0_1104 v_main_~y~0_781))))) InVars {main_~x~0=v_main_~x~0_1104, main_~y~0=v_main_~y~0_782} OutVars{main_~x~0=v_main_~x~0_1103, main_~y~0=v_main_~y~0_781} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {15283#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:57:00,074 INFO L290 TraceCheckUtils]: 9: Hoare triple {15283#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [172] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {15284#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-28 03:57:00,075 INFO L272 TraceCheckUtils]: 10: Hoare triple {15284#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {15285#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:57:00,075 INFO L290 TraceCheckUtils]: 11: Hoare triple {15285#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {15286#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:57:00,075 INFO L290 TraceCheckUtils]: 12: Hoare triple {15286#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {15277#false} is VALID [2022-04-28 03:57:00,075 INFO L290 TraceCheckUtils]: 13: Hoare triple {15277#false} assume !false; {15277#false} is VALID [2022-04-28 03:57:00,075 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:57:00,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:57:00,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807962789] [2022-04-28 03:57:00,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807962789] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:57:00,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107706012] [2022-04-28 03:57:00,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:57:00,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:57:00,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:57:00,077 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:57:00,077 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:57:00,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:00,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:57:00,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:00,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:57:00,436 INFO L272 TraceCheckUtils]: 0: Hoare triple {15276#true} call ULTIMATE.init(); {15276#true} is VALID [2022-04-28 03:57:00,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {15276#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(17, 2);call #Ultimate.allocInit(12, 3); {15276#true} is VALID [2022-04-28 03:57:00,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {15276#true} assume true; {15276#true} is VALID [2022-04-28 03:57:00,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15276#true} {15276#true} #41#return; {15276#true} is VALID [2022-04-28 03:57:00,437 INFO L272 TraceCheckUtils]: 4: Hoare triple {15276#true} call #t~ret4 := main(); {15276#true} is VALID [2022-04-28 03:57:00,437 INFO L290 TraceCheckUtils]: 5: Hoare triple {15276#true} ~x~0 := 0;~y~0 := 500000; {15306#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:57:00,437 INFO L290 TraceCheckUtils]: 6: Hoare triple {15306#(and (<= main_~x~0 0) (= main_~y~0 500000))} [173] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1102 v_main_~x~0_1101))) (or (and (< v_main_~x~0_1102 v_main_~x~0_1101) (< v_main_~x~0_1101 500001)) (and (not (< v_main_~x~0_1102 500000)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_1102} OutVars{main_~x~0=v_main_~x~0_1101} AuxVars[] AssignedVars[main_~x~0] {15310#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:57:00,438 INFO L290 TraceCheckUtils]: 7: Hoare triple {15310#(and (= main_~y~0 500000) (< main_~x~0 500001))} [174] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15310#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:57:00,438 INFO L290 TraceCheckUtils]: 8: Hoare triple {15310#(and (= main_~y~0 500000) (< main_~x~0 500001))} [175] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_782 v_main_~y~0_781)) (.cse1 (= v_main_~x~0_1104 v_main_~x~0_1103)) (.cse2 (<= 500000 v_main_~x~0_1104))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_1104 1000000)) (not .cse2))) (and .cse0 .cse1) (and (< v_main_~x~0_1103 1000001) (< v_main_~x~0_1104 v_main_~x~0_1103) .cse2 (= (+ v_main_~x~0_1103 v_main_~y~0_782) (+ v_main_~x~0_1104 v_main_~y~0_781))))) InVars {main_~x~0=v_main_~x~0_1104, main_~y~0=v_main_~y~0_782} OutVars{main_~x~0=v_main_~x~0_1103, main_~y~0=v_main_~y~0_781} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {15317#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:57:00,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {15317#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [172] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {15321#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:57:00,440 INFO L272 TraceCheckUtils]: 10: Hoare triple {15321#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {15325#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:57:00,440 INFO L290 TraceCheckUtils]: 11: Hoare triple {15325#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15329#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:57:00,440 INFO L290 TraceCheckUtils]: 12: Hoare triple {15329#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15277#false} is VALID [2022-04-28 03:57:00,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {15277#false} assume !false; {15277#false} is VALID [2022-04-28 03:57:00,440 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:57:00,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:57:00,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {15277#false} assume !false; {15277#false} is VALID [2022-04-28 03:57:00,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {15329#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15277#false} is VALID [2022-04-28 03:57:00,736 INFO L290 TraceCheckUtils]: 11: Hoare triple {15325#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15329#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:57:00,736 INFO L272 TraceCheckUtils]: 10: Hoare triple {15284#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {15325#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:57:00,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {15348#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [172] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {15284#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-28 03:57:00,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {15352#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [175] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_782 v_main_~y~0_781)) (.cse1 (= v_main_~x~0_1104 v_main_~x~0_1103)) (.cse2 (<= 500000 v_main_~x~0_1104))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_1104 1000000)) (not .cse2))) (and .cse0 .cse1) (and (< v_main_~x~0_1103 1000001) (< v_main_~x~0_1104 v_main_~x~0_1103) .cse2 (= (+ v_main_~x~0_1103 v_main_~y~0_782) (+ v_main_~x~0_1104 v_main_~y~0_781))))) InVars {main_~x~0=v_main_~x~0_1104, main_~y~0=v_main_~y~0_782} OutVars{main_~x~0=v_main_~x~0_1103, main_~y~0=v_main_~y~0_781} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {15348#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:57:00,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {15352#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [174] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15352#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:57:00,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {15359#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} [173] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1102 v_main_~x~0_1101))) (or (and (< v_main_~x~0_1102 v_main_~x~0_1101) (< v_main_~x~0_1101 500001)) (and (not (< v_main_~x~0_1102 500000)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_1102} OutVars{main_~x~0=v_main_~x~0_1101} AuxVars[] AssignedVars[main_~x~0] {15352#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:57:00,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {15276#true} ~x~0 := 0;~y~0 := 500000; {15359#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:57:00,739 INFO L272 TraceCheckUtils]: 4: Hoare triple {15276#true} call #t~ret4 := main(); {15276#true} is VALID [2022-04-28 03:57:00,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15276#true} {15276#true} #41#return; {15276#true} is VALID [2022-04-28 03:57:00,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {15276#true} assume true; {15276#true} is VALID [2022-04-28 03:57:00,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {15276#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(17, 2);call #Ultimate.allocInit(12, 3); {15276#true} is VALID [2022-04-28 03:57:00,739 INFO L272 TraceCheckUtils]: 0: Hoare triple {15276#true} call ULTIMATE.init(); {15276#true} is VALID [2022-04-28 03:57:00,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:57:00,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107706012] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:57:00,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:57:00,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 03:57:02,063 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:57:02,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [579266603] [2022-04-28 03:57:02,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [579266603] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:57:02,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:57:02,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-28 03:57:02,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795219512] [2022-04-28 03:57:02,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:57:02,064 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.9230769230769231) internal successors, (75), 38 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:57:02,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:57:02,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 39 states have (on average 1.9230769230769231) internal successors, (75), 38 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:57:02,118 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:57:02,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-28 03:57:02,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:57:02,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-28 03:57:02,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=2298, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 03:57:02,119 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 40 states, 39 states have (on average 1.9230769230769231) internal successors, (75), 38 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:57:06,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:57:06,732 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2022-04-28 03:57:06,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 03:57:06,732 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.9230769230769231) internal successors, (75), 38 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:57:06,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:57:06,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.9230769230769231) internal successors, (75), 38 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:57:06,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 95 transitions. [2022-04-28 03:57:06,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.9230769230769231) internal successors, (75), 38 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:57:06,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 95 transitions. [2022-04-28 03:57:06,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 95 transitions. [2022-04-28 03:57:06,813 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:57:06,814 INFO L225 Difference]: With dead ends: 90 [2022-04-28 03:57:06,814 INFO L226 Difference]: Without dead ends: 83 [2022-04-28 03:57:06,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1613 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=737, Invalid=6745, Unknown=0, NotChecked=0, Total=7482 [2022-04-28 03:57:06,815 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 75 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 2604 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 2677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:57:06,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 133 Invalid, 2677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 2604 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-28 03:57:06,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-28 03:57:07,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-04-28 03:57:07,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:57:07,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 83 states, 78 states have (on average 1.0512820512820513) internal successors, (82), 78 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:07,023 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 83 states, 78 states have (on average 1.0512820512820513) internal successors, (82), 78 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:07,023 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 83 states, 78 states have (on average 1.0512820512820513) internal successors, (82), 78 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:07,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:57:07,023 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2022-04-28 03:57:07,024 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2022-04-28 03:57:07,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:57:07,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:57:07,024 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 78 states have (on average 1.0512820512820513) internal successors, (82), 78 states have internal predecessors, (82), 3 states have call successors, (3), 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:57:07,024 INFO L87 Difference]: Start difference. First operand has 83 states, 78 states have (on average 1.0512820512820513) internal successors, (82), 78 states have internal predecessors, (82), 3 states have call successors, (3), 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:57:07,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:57:07,025 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2022-04-28 03:57:07,025 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2022-04-28 03:57:07,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:57:07,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:57:07,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:57:07,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:57:07,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 78 states have (on average 1.0512820512820513) internal successors, (82), 78 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:07,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2022-04-28 03:57:07,026 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 79 [2022-04-28 03:57:07,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:57:07,026 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2022-04-28 03:57:07,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.9230769230769231) internal successors, (75), 38 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:57:07,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 86 transitions. [2022-04-28 03:57:07,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:57:07,107 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2022-04-28 03:57:07,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-28 03:57:07,107 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:57:07,107 INFO L195 NwaCegarLoop]: trace histogram [35, 33, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:57:07,123 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:57:07,307 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:57:07,308 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:57:07,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:57:07,308 INFO L85 PathProgramCache]: Analyzing trace with hash -362657992, now seen corresponding path program 33 times [2022-04-28 03:57:07,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:57:07,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1488609092] [2022-04-28 03:57:07,401 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:57:07,560 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:57:07,562 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:57:07,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1764191151, now seen corresponding path program 1 times [2022-04-28 03:57:07,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:57:07,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190524929] [2022-04-28 03:57:07,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:57:07,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:57:07,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:07,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:57:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:07,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {16007#(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(17, 2);call #Ultimate.allocInit(12, 3); {15996#true} is VALID [2022-04-28 03:57:07,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {15996#true} assume true; {15996#true} is VALID [2022-04-28 03:57:07,664 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15996#true} {15996#true} #41#return; {15996#true} is VALID [2022-04-28 03:57:07,665 INFO L272 TraceCheckUtils]: 0: Hoare triple {15996#true} call ULTIMATE.init(); {16007#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:57:07,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {16007#(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(17, 2);call #Ultimate.allocInit(12, 3); {15996#true} is VALID [2022-04-28 03:57:07,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {15996#true} assume true; {15996#true} is VALID [2022-04-28 03:57:07,665 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15996#true} {15996#true} #41#return; {15996#true} is VALID [2022-04-28 03:57:07,665 INFO L272 TraceCheckUtils]: 4: Hoare triple {15996#true} call #t~ret4 := main(); {15996#true} is VALID [2022-04-28 03:57:07,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {15996#true} ~x~0 := 0;~y~0 := 500000; {16001#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:57:07,666 INFO L290 TraceCheckUtils]: 6: Hoare triple {16001#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [177] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1153 v_main_~x~0_1152))) (or .cse0 (and (< v_main_~x~0_1152 500001) (< v_main_~x~0_1153 v_main_~x~0_1152)) (and (not (< v_main_~x~0_1153 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_1153} OutVars{main_~x~0=v_main_~x~0_1152} AuxVars[] AssignedVars[main_~x~0] {16002#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:57:07,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {16002#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [178] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16002#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:57:07,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {16002#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [179] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1155 v_main_~x~0_1154)) (.cse1 (= v_main_~y~0_823 v_main_~y~0_822)) (.cse2 (<= 500000 v_main_~x~0_1155))) (or (and .cse0 .cse1) (let ((.cse3 (+ v_main_~x~0_1155 v_main_~y~0_822))) (and (< v_main_~y~0_823 v_main_~y~0_822) .cse2 (= .cse3 (+ v_main_~x~0_1154 v_main_~y~0_823)) (< .cse3 (+ v_main_~y~0_823 1000001)))) (and .cse0 .cse1 (or (not (< v_main_~x~0_1155 1000000)) (not .cse2))))) InVars {main_~x~0=v_main_~x~0_1155, main_~y~0=v_main_~y~0_823} OutVars{main_~x~0=v_main_~x~0_1154, main_~y~0=v_main_~y~0_822} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {16003#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} is VALID [2022-04-28 03:57:07,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {16003#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} [176] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {16004#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:57:07,668 INFO L272 TraceCheckUtils]: 10: Hoare triple {16004#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {16005#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:57:07,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {16005#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {16006#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:57:07,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {16006#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {15997#false} is VALID [2022-04-28 03:57:07,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {15997#false} assume !false; {15997#false} is VALID [2022-04-28 03:57:07,669 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:57:07,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:57:07,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190524929] [2022-04-28 03:57:07,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190524929] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:57:07,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433335730] [2022-04-28 03:57:07,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:57:07,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:57:07,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:57:07,670 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:57:07,671 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:57:07,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:07,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:57:07,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:07,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:57:08,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {15996#true} call ULTIMATE.init(); {15996#true} is VALID [2022-04-28 03:57:08,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {15996#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(17, 2);call #Ultimate.allocInit(12, 3); {15996#true} is VALID [2022-04-28 03:57:08,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {15996#true} assume true; {15996#true} is VALID [2022-04-28 03:57:08,035 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15996#true} {15996#true} #41#return; {15996#true} is VALID [2022-04-28 03:57:08,035 INFO L272 TraceCheckUtils]: 4: Hoare triple {15996#true} call #t~ret4 := main(); {15996#true} is VALID [2022-04-28 03:57:08,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {15996#true} ~x~0 := 0;~y~0 := 500000; {16026#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:57:08,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {16026#(and (<= main_~x~0 0) (= main_~y~0 500000))} [177] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1153 v_main_~x~0_1152))) (or .cse0 (and (< v_main_~x~0_1152 500001) (< v_main_~x~0_1153 v_main_~x~0_1152)) (and (not (< v_main_~x~0_1153 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_1153} OutVars{main_~x~0=v_main_~x~0_1152} AuxVars[] AssignedVars[main_~x~0] {16030#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:57:08,036 INFO L290 TraceCheckUtils]: 7: Hoare triple {16030#(and (= main_~y~0 500000) (< main_~x~0 500001))} [178] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16030#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:57:08,037 INFO L290 TraceCheckUtils]: 8: Hoare triple {16030#(and (= main_~y~0 500000) (< main_~x~0 500001))} [179] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1155 v_main_~x~0_1154)) (.cse1 (= v_main_~y~0_823 v_main_~y~0_822)) (.cse2 (<= 500000 v_main_~x~0_1155))) (or (and .cse0 .cse1) (let ((.cse3 (+ v_main_~x~0_1155 v_main_~y~0_822))) (and (< v_main_~y~0_823 v_main_~y~0_822) .cse2 (= .cse3 (+ v_main_~x~0_1154 v_main_~y~0_823)) (< .cse3 (+ v_main_~y~0_823 1000001)))) (and .cse0 .cse1 (or (not (< v_main_~x~0_1155 1000000)) (not .cse2))))) InVars {main_~x~0=v_main_~x~0_1155, main_~y~0=v_main_~y~0_823} OutVars{main_~x~0=v_main_~x~0_1154, main_~y~0=v_main_~y~0_822} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {16037#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:57:08,037 INFO L290 TraceCheckUtils]: 9: Hoare triple {16037#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [176] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {16041#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:57:08,038 INFO L272 TraceCheckUtils]: 10: Hoare triple {16041#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {16045#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:57:08,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {16045#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16049#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:57:08,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {16049#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15997#false} is VALID [2022-04-28 03:57:08,038 INFO L290 TraceCheckUtils]: 13: Hoare triple {15997#false} assume !false; {15997#false} is VALID [2022-04-28 03:57:08,039 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:57:08,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:57:08,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {15997#false} assume !false; {15997#false} is VALID [2022-04-28 03:57:08,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {16049#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15997#false} is VALID [2022-04-28 03:57:08,329 INFO L290 TraceCheckUtils]: 11: Hoare triple {16045#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16049#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:57:08,329 INFO L272 TraceCheckUtils]: 10: Hoare triple {16004#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {16045#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:57:08,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {16068#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [176] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {16004#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:57:08,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {16072#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [179] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1155 v_main_~x~0_1154)) (.cse1 (= v_main_~y~0_823 v_main_~y~0_822)) (.cse2 (<= 500000 v_main_~x~0_1155))) (or (and .cse0 .cse1) (let ((.cse3 (+ v_main_~x~0_1155 v_main_~y~0_822))) (and (< v_main_~y~0_823 v_main_~y~0_822) .cse2 (= .cse3 (+ v_main_~x~0_1154 v_main_~y~0_823)) (< .cse3 (+ v_main_~y~0_823 1000001)))) (and .cse0 .cse1 (or (not (< v_main_~x~0_1155 1000000)) (not .cse2))))) InVars {main_~x~0=v_main_~x~0_1155, main_~y~0=v_main_~y~0_823} OutVars{main_~x~0=v_main_~x~0_1154, main_~y~0=v_main_~y~0_822} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {16068#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:57:08,331 INFO L290 TraceCheckUtils]: 7: Hoare triple {16072#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [178] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16072#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:57:08,331 INFO L290 TraceCheckUtils]: 6: Hoare triple {16079#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [177] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1153 v_main_~x~0_1152))) (or .cse0 (and (< v_main_~x~0_1152 500001) (< v_main_~x~0_1153 v_main_~x~0_1152)) (and (not (< v_main_~x~0_1153 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_1153} OutVars{main_~x~0=v_main_~x~0_1152} AuxVars[] AssignedVars[main_~x~0] {16072#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:57:08,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {15996#true} ~x~0 := 0;~y~0 := 500000; {16079#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:57:08,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {15996#true} call #t~ret4 := main(); {15996#true} is VALID [2022-04-28 03:57:08,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15996#true} {15996#true} #41#return; {15996#true} is VALID [2022-04-28 03:57:08,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {15996#true} assume true; {15996#true} is VALID [2022-04-28 03:57:08,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {15996#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(17, 2);call #Ultimate.allocInit(12, 3); {15996#true} is VALID [2022-04-28 03:57:08,342 INFO L272 TraceCheckUtils]: 0: Hoare triple {15996#true} call ULTIMATE.init(); {15996#true} is VALID [2022-04-28 03:57:08,342 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:57:08,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433335730] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:57:08,342 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:57:08,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 03:57:09,728 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:57:09,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1488609092] [2022-04-28 03:57:09,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1488609092] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:57:09,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:57:09,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-28 03:57:09,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499563191] [2022-04-28 03:57:09,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:57:09,729 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.925) internal successors, (77), 39 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:57:09,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:57:09,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 40 states have (on average 1.925) internal successors, (77), 39 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:57:09,784 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:57:09,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-28 03:57:09,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:57:09,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-28 03:57:09,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=2394, Unknown=0, NotChecked=0, Total=2756 [2022-04-28 03:57:09,785 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand has 41 states, 40 states have (on average 1.925) internal successors, (77), 39 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:57:14,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:57:14,372 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2022-04-28 03:57:14,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-28 03:57:14,372 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.925) internal successors, (77), 39 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:57:14,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:57:14,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.925) internal successors, (77), 39 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:57:14,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 97 transitions. [2022-04-28 03:57:14,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.925) internal successors, (77), 39 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:57:14,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 97 transitions. [2022-04-28 03:57:14,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 97 transitions. [2022-04-28 03:57:14,462 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:57:14,463 INFO L225 Difference]: With dead ends: 92 [2022-04-28 03:57:14,463 INFO L226 Difference]: Without dead ends: 85 [2022-04-28 03:57:14,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1675 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=756, Invalid=7076, Unknown=0, NotChecked=0, Total=7832 [2022-04-28 03:57:14,464 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 77 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 2560 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 2635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 2560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:57:14,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 78 Invalid, 2635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 2560 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-28 03:57:14,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-28 03:57:14,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-04-28 03:57:14,702 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:57:14,702 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 85 states, 80 states have (on average 1.05) internal successors, (84), 80 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:14,702 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 85 states, 80 states have (on average 1.05) internal successors, (84), 80 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:14,703 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 85 states, 80 states have (on average 1.05) internal successors, (84), 80 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:14,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:57:14,703 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2022-04-28 03:57:14,704 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2022-04-28 03:57:14,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:57:14,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:57:14,704 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 80 states have (on average 1.05) internal successors, (84), 80 states have internal predecessors, (84), 3 states have call successors, (3), 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:57:14,704 INFO L87 Difference]: Start difference. First operand has 85 states, 80 states have (on average 1.05) internal successors, (84), 80 states have internal predecessors, (84), 3 states have call successors, (3), 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:57:14,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:57:14,710 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2022-04-28 03:57:14,710 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2022-04-28 03:57:14,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:57:14,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:57:14,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:57:14,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:57:14,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 80 states have (on average 1.05) internal successors, (84), 80 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:14,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2022-04-28 03:57:14,711 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 81 [2022-04-28 03:57:14,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:57:14,711 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2022-04-28 03:57:14,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.925) internal successors, (77), 39 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:57:14,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 88 transitions. [2022-04-28 03:57:14,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:57:14,783 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2022-04-28 03:57:14,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-28 03:57:14,783 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:57:14,783 INFO L195 NwaCegarLoop]: trace histogram [36, 34, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:57:14,799 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:57:14,984 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:57:14,984 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:57:14,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:57:14,984 INFO L85 PathProgramCache]: Analyzing trace with hash -385546477, now seen corresponding path program 34 times [2022-04-28 03:57:14,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:57:14,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [549401230] [2022-04-28 03:57:15,076 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:57:15,268 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:57:15,269 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:57:15,271 INFO L85 PathProgramCache]: Analyzing trace with hash -481243985, now seen corresponding path program 1 times [2022-04-28 03:57:15,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:57:15,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096749055] [2022-04-28 03:57:15,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:57:15,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:57:15,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:15,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:57:15,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:15,350 INFO L290 TraceCheckUtils]: 0: Hoare triple {16742#(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(17, 2);call #Ultimate.allocInit(12, 3); {16731#true} is VALID [2022-04-28 03:57:15,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {16731#true} assume true; {16731#true} is VALID [2022-04-28 03:57:15,350 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16731#true} {16731#true} #41#return; {16731#true} is VALID [2022-04-28 03:57:15,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {16731#true} call ULTIMATE.init(); {16742#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:57:15,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {16742#(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(17, 2);call #Ultimate.allocInit(12, 3); {16731#true} is VALID [2022-04-28 03:57:15,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {16731#true} assume true; {16731#true} is VALID [2022-04-28 03:57:15,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16731#true} {16731#true} #41#return; {16731#true} is VALID [2022-04-28 03:57:15,351 INFO L272 TraceCheckUtils]: 4: Hoare triple {16731#true} call #t~ret4 := main(); {16731#true} is VALID [2022-04-28 03:57:15,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {16731#true} ~x~0 := 0;~y~0 := 500000; {16736#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:57:15,351 INFO L290 TraceCheckUtils]: 6: Hoare triple {16736#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [181] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1205 v_main_~x~0_1204))) (or (and (< v_main_~x~0_1204 500001) (< v_main_~x~0_1205 v_main_~x~0_1204)) (and (not (< v_main_~x~0_1205 500000)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_1205} OutVars{main_~x~0=v_main_~x~0_1204} AuxVars[] AssignedVars[main_~x~0] {16737#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:57:15,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {16737#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [182] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16737#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:57:15,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {16737#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [183] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~y~0_865 v_main_~y~0_864)) (.cse2 (= v_main_~x~0_1207 v_main_~x~0_1206)) (.cse0 (<= 500000 v_main_~x~0_1207))) (or (and (< v_main_~x~0_1206 1000001) (= (+ v_main_~x~0_1206 v_main_~y~0_865) (+ v_main_~x~0_1207 v_main_~y~0_864)) (< v_main_~x~0_1207 v_main_~x~0_1206) .cse0) (and .cse1 .cse2) (and .cse1 .cse2 (or (not .cse0) (not (< v_main_~x~0_1207 1000000)))))) InVars {main_~x~0=v_main_~x~0_1207, main_~y~0=v_main_~y~0_865} OutVars{main_~x~0=v_main_~x~0_1206, main_~y~0=v_main_~y~0_864} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {16738#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:57:15,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {16738#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [180] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {16739#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-28 03:57:15,354 INFO L272 TraceCheckUtils]: 10: Hoare triple {16739#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {16740#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:57:15,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {16740#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {16741#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:57:15,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {16741#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {16732#false} is VALID [2022-04-28 03:57:15,354 INFO L290 TraceCheckUtils]: 13: Hoare triple {16732#false} assume !false; {16732#false} is VALID [2022-04-28 03:57:15,354 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:57:15,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:57:15,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096749055] [2022-04-28 03:57:15,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096749055] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:57:15,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985675436] [2022-04-28 03:57:15,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:57:15,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:57:15,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:57:15,356 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:57:15,356 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:57:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:15,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:57:15,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:15,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:57:15,709 INFO L272 TraceCheckUtils]: 0: Hoare triple {16731#true} call ULTIMATE.init(); {16731#true} is VALID [2022-04-28 03:57:15,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {16731#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(17, 2);call #Ultimate.allocInit(12, 3); {16731#true} is VALID [2022-04-28 03:57:15,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {16731#true} assume true; {16731#true} is VALID [2022-04-28 03:57:15,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16731#true} {16731#true} #41#return; {16731#true} is VALID [2022-04-28 03:57:15,709 INFO L272 TraceCheckUtils]: 4: Hoare triple {16731#true} call #t~ret4 := main(); {16731#true} is VALID [2022-04-28 03:57:15,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {16731#true} ~x~0 := 0;~y~0 := 500000; {16761#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:57:15,710 INFO L290 TraceCheckUtils]: 6: Hoare triple {16761#(and (<= main_~x~0 0) (= main_~y~0 500000))} [181] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1205 v_main_~x~0_1204))) (or (and (< v_main_~x~0_1204 500001) (< v_main_~x~0_1205 v_main_~x~0_1204)) (and (not (< v_main_~x~0_1205 500000)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_1205} OutVars{main_~x~0=v_main_~x~0_1204} AuxVars[] AssignedVars[main_~x~0] {16765#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:57:15,710 INFO L290 TraceCheckUtils]: 7: Hoare triple {16765#(and (= main_~y~0 500000) (< main_~x~0 500001))} [182] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16765#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:57:15,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {16765#(and (= main_~y~0 500000) (< main_~x~0 500001))} [183] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~y~0_865 v_main_~y~0_864)) (.cse2 (= v_main_~x~0_1207 v_main_~x~0_1206)) (.cse0 (<= 500000 v_main_~x~0_1207))) (or (and (< v_main_~x~0_1206 1000001) (= (+ v_main_~x~0_1206 v_main_~y~0_865) (+ v_main_~x~0_1207 v_main_~y~0_864)) (< v_main_~x~0_1207 v_main_~x~0_1206) .cse0) (and .cse1 .cse2) (and .cse1 .cse2 (or (not .cse0) (not (< v_main_~x~0_1207 1000000)))))) InVars {main_~x~0=v_main_~x~0_1207, main_~y~0=v_main_~y~0_865} OutVars{main_~x~0=v_main_~x~0_1206, main_~y~0=v_main_~y~0_864} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {16772#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:57:15,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {16772#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [180] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {16776#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:57:15,712 INFO L272 TraceCheckUtils]: 10: Hoare triple {16776#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {16780#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:57:15,713 INFO L290 TraceCheckUtils]: 11: Hoare triple {16780#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16784#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:57:15,713 INFO L290 TraceCheckUtils]: 12: Hoare triple {16784#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16732#false} is VALID [2022-04-28 03:57:15,713 INFO L290 TraceCheckUtils]: 13: Hoare triple {16732#false} assume !false; {16732#false} is VALID [2022-04-28 03:57:15,713 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:57:15,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:57:16,013 INFO L290 TraceCheckUtils]: 13: Hoare triple {16732#false} assume !false; {16732#false} is VALID [2022-04-28 03:57:16,021 INFO L290 TraceCheckUtils]: 12: Hoare triple {16784#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16732#false} is VALID [2022-04-28 03:57:16,021 INFO L290 TraceCheckUtils]: 11: Hoare triple {16780#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16784#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:57:16,022 INFO L272 TraceCheckUtils]: 10: Hoare triple {16739#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {16780#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:57:16,022 INFO L290 TraceCheckUtils]: 9: Hoare triple {16803#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [180] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {16739#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-28 03:57:16,023 INFO L290 TraceCheckUtils]: 8: Hoare triple {16807#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [183] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~y~0_865 v_main_~y~0_864)) (.cse2 (= v_main_~x~0_1207 v_main_~x~0_1206)) (.cse0 (<= 500000 v_main_~x~0_1207))) (or (and (< v_main_~x~0_1206 1000001) (= (+ v_main_~x~0_1206 v_main_~y~0_865) (+ v_main_~x~0_1207 v_main_~y~0_864)) (< v_main_~x~0_1207 v_main_~x~0_1206) .cse0) (and .cse1 .cse2) (and .cse1 .cse2 (or (not .cse0) (not (< v_main_~x~0_1207 1000000)))))) InVars {main_~x~0=v_main_~x~0_1207, main_~y~0=v_main_~y~0_865} OutVars{main_~x~0=v_main_~x~0_1206, main_~y~0=v_main_~y~0_864} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {16803#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:57:16,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {16807#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [182] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16807#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:57:16,024 INFO L290 TraceCheckUtils]: 6: Hoare triple {16814#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} [181] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1205 v_main_~x~0_1204))) (or (and (< v_main_~x~0_1204 500001) (< v_main_~x~0_1205 v_main_~x~0_1204)) (and (not (< v_main_~x~0_1205 500000)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_1205} OutVars{main_~x~0=v_main_~x~0_1204} AuxVars[] AssignedVars[main_~x~0] {16807#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:57:16,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {16731#true} ~x~0 := 0;~y~0 := 500000; {16814#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:57:16,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {16731#true} call #t~ret4 := main(); {16731#true} is VALID [2022-04-28 03:57:16,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16731#true} {16731#true} #41#return; {16731#true} is VALID [2022-04-28 03:57:16,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {16731#true} assume true; {16731#true} is VALID [2022-04-28 03:57:16,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {16731#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(17, 2);call #Ultimate.allocInit(12, 3); {16731#true} is VALID [2022-04-28 03:57:16,025 INFO L272 TraceCheckUtils]: 0: Hoare triple {16731#true} call ULTIMATE.init(); {16731#true} is VALID [2022-04-28 03:57:16,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:57:16,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985675436] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:57:16,025 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:57:16,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 03:57:17,436 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:57:17,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [549401230] [2022-04-28 03:57:17,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [549401230] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:57:17,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:57:17,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-28 03:57:17,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903903701] [2022-04-28 03:57:17,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:57:17,437 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.9268292682926829) internal successors, (79), 40 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:57:17,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:57:17,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 41 states have (on average 1.9268292682926829) internal successors, (79), 40 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:57:17,500 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:57:17,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-28 03:57:17,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:57:17,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-28 03:57:17,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=2492, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 03:57:17,501 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand has 42 states, 41 states have (on average 1.9268292682926829) internal successors, (79), 40 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:57:22,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:57:22,229 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2022-04-28 03:57:22,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-28 03:57:22,229 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.9268292682926829) internal successors, (79), 40 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:57:22,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:57:22,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.9268292682926829) internal successors, (79), 40 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:57:22,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 99 transitions. [2022-04-28 03:57:22,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.9268292682926829) internal successors, (79), 40 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:57:22,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 99 transitions. [2022-04-28 03:57:22,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 99 transitions. [2022-04-28 03:57:22,307 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:57:22,308 INFO L225 Difference]: With dead ends: 94 [2022-04-28 03:57:22,308 INFO L226 Difference]: Without dead ends: 87 [2022-04-28 03:57:22,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1738 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=775, Invalid=7415, Unknown=0, NotChecked=0, Total=8190 [2022-04-28 03:57:22,309 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 79 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 2668 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 2745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 2668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:57:22,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 63 Invalid, 2745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 2668 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-28 03:57:22,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-28 03:57:22,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-04-28 03:57:22,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:57:22,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 87 states, 82 states have (on average 1.048780487804878) internal successors, (86), 82 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:22,529 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 87 states, 82 states have (on average 1.048780487804878) internal successors, (86), 82 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:22,529 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 87 states, 82 states have (on average 1.048780487804878) internal successors, (86), 82 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:22,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:57:22,530 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2022-04-28 03:57:22,530 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2022-04-28 03:57:22,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:57:22,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:57:22,530 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 82 states have (on average 1.048780487804878) internal successors, (86), 82 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 87 states. [2022-04-28 03:57:22,531 INFO L87 Difference]: Start difference. First operand has 87 states, 82 states have (on average 1.048780487804878) internal successors, (86), 82 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 87 states. [2022-04-28 03:57:22,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:57:22,531 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2022-04-28 03:57:22,531 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2022-04-28 03:57:22,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:57:22,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:57:22,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:57:22,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:57:22,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.048780487804878) internal successors, (86), 82 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:22,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2022-04-28 03:57:22,532 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 83 [2022-04-28 03:57:22,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:57:22,533 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2022-04-28 03:57:22,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.9268292682926829) internal successors, (79), 40 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:57:22,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 90 transitions. [2022-04-28 03:57:22,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:57:22,612 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2022-04-28 03:57:22,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-28 03:57:22,613 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:57:22,613 INFO L195 NwaCegarLoop]: trace histogram [37, 35, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:57:22,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-04-28 03:57:22,813 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:57:22,813 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:57:22,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:57:22,813 INFO L85 PathProgramCache]: Analyzing trace with hash -906544082, now seen corresponding path program 35 times [2022-04-28 03:57:22,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:57:22,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [459482654] [2022-04-28 03:57:26,868 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:57:26,907 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:57:31,039 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:57:31,150 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:57:31,151 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:57:31,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1568288175, now seen corresponding path program 1 times [2022-04-28 03:57:31,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:57:31,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686540364] [2022-04-28 03:57:31,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:57:31,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:57:31,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:31,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:57:31,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:31,235 INFO L290 TraceCheckUtils]: 0: Hoare triple {17492#(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(17, 2);call #Ultimate.allocInit(12, 3); {17481#true} is VALID [2022-04-28 03:57:31,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {17481#true} assume true; {17481#true} is VALID [2022-04-28 03:57:31,235 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17481#true} {17481#true} #41#return; {17481#true} is VALID [2022-04-28 03:57:31,236 INFO L272 TraceCheckUtils]: 0: Hoare triple {17481#true} call ULTIMATE.init(); {17492#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:57:31,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {17492#(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(17, 2);call #Ultimate.allocInit(12, 3); {17481#true} is VALID [2022-04-28 03:57:31,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {17481#true} assume true; {17481#true} is VALID [2022-04-28 03:57:31,236 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17481#true} {17481#true} #41#return; {17481#true} is VALID [2022-04-28 03:57:31,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {17481#true} call #t~ret4 := main(); {17481#true} is VALID [2022-04-28 03:57:31,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {17481#true} ~x~0 := 0;~y~0 := 500000; {17486#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:57:31,237 INFO L290 TraceCheckUtils]: 6: Hoare triple {17486#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [185] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1258 v_main_~x~0_1257))) (or .cse0 (and (< v_main_~x~0_1258 v_main_~x~0_1257) (< v_main_~x~0_1257 500001)) (and .cse0 (<= 500000 v_main_~x~0_1258)))) InVars {main_~x~0=v_main_~x~0_1258} OutVars{main_~x~0=v_main_~x~0_1257} AuxVars[] AssignedVars[main_~x~0] {17487#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:57:31,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {17487#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [186] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17487#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:57:31,238 INFO L290 TraceCheckUtils]: 8: Hoare triple {17487#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [187] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~y~0_908 v_main_~y~0_907)) (.cse0 (<= 500000 v_main_~x~0_1260))) (or (and (or (not (< v_main_~x~0_1260 1000000)) (not .cse0)) .cse1 (= v_main_~x~0_1259 v_main_~x~0_1260)) (and (= v_main_~x~0_1260 v_main_~x~0_1259) .cse1) (let ((.cse2 (+ v_main_~x~0_1260 v_main_~y~0_907))) (and (< .cse2 (+ v_main_~y~0_908 1000001)) (< v_main_~y~0_908 v_main_~y~0_907) .cse0 (= (+ v_main_~x~0_1259 v_main_~y~0_908) .cse2))))) InVars {main_~x~0=v_main_~x~0_1260, main_~y~0=v_main_~y~0_908} OutVars{main_~x~0=v_main_~x~0_1259, main_~y~0=v_main_~y~0_907} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {17488#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:57:31,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {17488#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [184] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {17489#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:57:31,240 INFO L272 TraceCheckUtils]: 10: Hoare triple {17489#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {17490#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:57:31,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {17490#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {17491#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:57:31,240 INFO L290 TraceCheckUtils]: 12: Hoare triple {17491#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {17482#false} is VALID [2022-04-28 03:57:31,240 INFO L290 TraceCheckUtils]: 13: Hoare triple {17482#false} assume !false; {17482#false} is VALID [2022-04-28 03:57:31,240 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:57:31,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:57:31,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686540364] [2022-04-28 03:57:31,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686540364] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:57:31,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735485852] [2022-04-28 03:57:31,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:57:31,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:57:31,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:57:31,242 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:57:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:31,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:57:31,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:31,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:57:31,291 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:57:31,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {17481#true} call ULTIMATE.init(); {17481#true} is VALID [2022-04-28 03:57:31,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {17481#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(17, 2);call #Ultimate.allocInit(12, 3); {17481#true} is VALID [2022-04-28 03:57:31,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {17481#true} assume true; {17481#true} is VALID [2022-04-28 03:57:31,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17481#true} {17481#true} #41#return; {17481#true} is VALID [2022-04-28 03:57:31,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {17481#true} call #t~ret4 := main(); {17481#true} is VALID [2022-04-28 03:57:31,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {17481#true} ~x~0 := 0;~y~0 := 500000; {17511#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:57:31,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {17511#(and (<= main_~x~0 0) (= main_~y~0 500000))} [185] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1258 v_main_~x~0_1257))) (or .cse0 (and (< v_main_~x~0_1258 v_main_~x~0_1257) (< v_main_~x~0_1257 500001)) (and .cse0 (<= 500000 v_main_~x~0_1258)))) InVars {main_~x~0=v_main_~x~0_1258} OutVars{main_~x~0=v_main_~x~0_1257} AuxVars[] AssignedVars[main_~x~0] {17515#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:57:31,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {17515#(and (= main_~y~0 500000) (< main_~x~0 500001))} [186] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17515#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:57:31,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {17515#(and (= main_~y~0 500000) (< main_~x~0 500001))} [187] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~y~0_908 v_main_~y~0_907)) (.cse0 (<= 500000 v_main_~x~0_1260))) (or (and (or (not (< v_main_~x~0_1260 1000000)) (not .cse0)) .cse1 (= v_main_~x~0_1259 v_main_~x~0_1260)) (and (= v_main_~x~0_1260 v_main_~x~0_1259) .cse1) (let ((.cse2 (+ v_main_~x~0_1260 v_main_~y~0_907))) (and (< .cse2 (+ v_main_~y~0_908 1000001)) (< v_main_~y~0_908 v_main_~y~0_907) .cse0 (= (+ v_main_~x~0_1259 v_main_~y~0_908) .cse2))))) InVars {main_~x~0=v_main_~x~0_1260, main_~y~0=v_main_~y~0_908} OutVars{main_~x~0=v_main_~x~0_1259, main_~y~0=v_main_~y~0_907} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {17522#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:57:31,631 INFO L290 TraceCheckUtils]: 9: Hoare triple {17522#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [184] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {17526#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:57:31,631 INFO L272 TraceCheckUtils]: 10: Hoare triple {17526#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {17530#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:57:31,632 INFO L290 TraceCheckUtils]: 11: Hoare triple {17530#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17534#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:57:31,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {17534#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17482#false} is VALID [2022-04-28 03:57:31,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {17482#false} assume !false; {17482#false} is VALID [2022-04-28 03:57:31,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:57:31,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:57:31,935 INFO L290 TraceCheckUtils]: 13: Hoare triple {17482#false} assume !false; {17482#false} is VALID [2022-04-28 03:57:31,936 INFO L290 TraceCheckUtils]: 12: Hoare triple {17534#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17482#false} is VALID [2022-04-28 03:57:31,936 INFO L290 TraceCheckUtils]: 11: Hoare triple {17530#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17534#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:57:31,936 INFO L272 TraceCheckUtils]: 10: Hoare triple {17489#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {17530#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:57:31,937 INFO L290 TraceCheckUtils]: 9: Hoare triple {17553#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [184] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {17489#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:57:31,938 INFO L290 TraceCheckUtils]: 8: Hoare triple {17557#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [187] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~y~0_908 v_main_~y~0_907)) (.cse0 (<= 500000 v_main_~x~0_1260))) (or (and (or (not (< v_main_~x~0_1260 1000000)) (not .cse0)) .cse1 (= v_main_~x~0_1259 v_main_~x~0_1260)) (and (= v_main_~x~0_1260 v_main_~x~0_1259) .cse1) (let ((.cse2 (+ v_main_~x~0_1260 v_main_~y~0_907))) (and (< .cse2 (+ v_main_~y~0_908 1000001)) (< v_main_~y~0_908 v_main_~y~0_907) .cse0 (= (+ v_main_~x~0_1259 v_main_~y~0_908) .cse2))))) InVars {main_~x~0=v_main_~x~0_1260, main_~y~0=v_main_~y~0_908} OutVars{main_~x~0=v_main_~x~0_1259, main_~y~0=v_main_~y~0_907} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {17553#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:57:31,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {17557#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [186] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17557#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:57:31,939 INFO L290 TraceCheckUtils]: 6: Hoare triple {17564#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [185] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1258 v_main_~x~0_1257))) (or .cse0 (and (< v_main_~x~0_1258 v_main_~x~0_1257) (< v_main_~x~0_1257 500001)) (and .cse0 (<= 500000 v_main_~x~0_1258)))) InVars {main_~x~0=v_main_~x~0_1258} OutVars{main_~x~0=v_main_~x~0_1257} AuxVars[] AssignedVars[main_~x~0] {17557#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:57:31,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {17481#true} ~x~0 := 0;~y~0 := 500000; {17564#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:57:31,939 INFO L272 TraceCheckUtils]: 4: Hoare triple {17481#true} call #t~ret4 := main(); {17481#true} is VALID [2022-04-28 03:57:31,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17481#true} {17481#true} #41#return; {17481#true} is VALID [2022-04-28 03:57:31,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {17481#true} assume true; {17481#true} is VALID [2022-04-28 03:57:31,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {17481#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(17, 2);call #Ultimate.allocInit(12, 3); {17481#true} is VALID [2022-04-28 03:57:31,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {17481#true} call ULTIMATE.init(); {17481#true} is VALID [2022-04-28 03:57:31,940 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:57:31,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735485852] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:57:31,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:57:31,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 03:57:33,416 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:57:33,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [459482654] [2022-04-28 03:57:33,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [459482654] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:57:33,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:57:33,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-28 03:57:33,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907074436] [2022-04-28 03:57:33,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:57:33,417 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 41 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:57:33,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:57:33,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 41 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:57:33,474 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:57:33,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-28 03:57:33,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:57:33,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-28 03:57:33,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=2592, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 03:57:33,475 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand has 43 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 41 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:57:39,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:57:39,000 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2022-04-28 03:57:39,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-28 03:57:39,001 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 41 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:57:39,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:57:39,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 41 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:57:39,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 101 transitions. [2022-04-28 03:57:39,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 41 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:57:39,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 101 transitions. [2022-04-28 03:57:39,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 101 transitions. [2022-04-28 03:57:39,081 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:57:39,082 INFO L225 Difference]: With dead ends: 96 [2022-04-28 03:57:39,082 INFO L226 Difference]: Without dead ends: 89 [2022-04-28 03:57:39,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1802 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=794, Invalid=7762, Unknown=0, NotChecked=0, Total=8556 [2022-04-28 03:57:39,083 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 81 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 3176 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 3255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 3176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:57:39,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 198 Invalid, 3255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 3176 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 03:57:39,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-28 03:57:39,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-04-28 03:57:39,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:57:39,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 89 states, 84 states have (on average 1.0476190476190477) internal successors, (88), 84 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:39,301 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 89 states, 84 states have (on average 1.0476190476190477) internal successors, (88), 84 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:39,301 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 89 states, 84 states have (on average 1.0476190476190477) internal successors, (88), 84 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:39,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:57:39,302 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2022-04-28 03:57:39,302 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2022-04-28 03:57:39,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:57:39,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:57:39,302 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 84 states have (on average 1.0476190476190477) internal successors, (88), 84 states have internal predecessors, (88), 3 states have call successors, (3), 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:57:39,302 INFO L87 Difference]: Start difference. First operand has 89 states, 84 states have (on average 1.0476190476190477) internal successors, (88), 84 states have internal predecessors, (88), 3 states have call successors, (3), 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:57:39,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:57:39,303 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2022-04-28 03:57:39,303 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2022-04-28 03:57:39,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:57:39,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:57:39,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:57:39,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:57:39,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 84 states have (on average 1.0476190476190477) internal successors, (88), 84 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:39,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2022-04-28 03:57:39,304 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 85 [2022-04-28 03:57:39,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:57:39,304 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2022-04-28 03:57:39,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 41 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:57:39,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 92 transitions. [2022-04-28 03:57:39,394 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:57:39,394 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2022-04-28 03:57:39,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-28 03:57:39,394 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:57:39,394 INFO L195 NwaCegarLoop]: trace histogram [38, 36, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:57:39,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-04-28 03:57:39,607 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:57:39,607 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:57:39,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:57:39,608 INFO L85 PathProgramCache]: Analyzing trace with hash 925931145, now seen corresponding path program 36 times [2022-04-28 03:57:39,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:57:39,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [146430594] [2022-04-28 03:57:43,668 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:57:43,715 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:57:43,928 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:57:43,929 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:57:43,931 INFO L85 PathProgramCache]: Analyzing trace with hash -677146961, now seen corresponding path program 1 times [2022-04-28 03:57:43,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:57:43,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114575570] [2022-04-28 03:57:43,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:57:43,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:57:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:44,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:57:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:44,027 INFO L290 TraceCheckUtils]: 0: Hoare triple {18257#(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(17, 2);call #Ultimate.allocInit(12, 3); {18246#true} is VALID [2022-04-28 03:57:44,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {18246#true} assume true; {18246#true} is VALID [2022-04-28 03:57:44,027 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18246#true} {18246#true} #41#return; {18246#true} is VALID [2022-04-28 03:57:44,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {18246#true} call ULTIMATE.init(); {18257#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:57:44,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {18257#(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(17, 2);call #Ultimate.allocInit(12, 3); {18246#true} is VALID [2022-04-28 03:57:44,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {18246#true} assume true; {18246#true} is VALID [2022-04-28 03:57:44,028 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18246#true} {18246#true} #41#return; {18246#true} is VALID [2022-04-28 03:57:44,028 INFO L272 TraceCheckUtils]: 4: Hoare triple {18246#true} call #t~ret4 := main(); {18246#true} is VALID [2022-04-28 03:57:44,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {18246#true} ~x~0 := 0;~y~0 := 500000; {18251#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:57:44,029 INFO L290 TraceCheckUtils]: 6: Hoare triple {18251#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [189] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1312 v_main_~x~0_1311))) (or (and (not (< v_main_~x~0_1312 500000)) .cse0) (and (< v_main_~x~0_1311 500001) (< v_main_~x~0_1312 v_main_~x~0_1311)) .cse0)) InVars {main_~x~0=v_main_~x~0_1312} OutVars{main_~x~0=v_main_~x~0_1311} AuxVars[] AssignedVars[main_~x~0] {18252#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:57:44,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {18252#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [190] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18252#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:57:44,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {18252#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [191] L11-2-->L10-2_primed: Formula: (let ((.cse2 (= v_main_~y~0_952 v_main_~y~0_951)) (.cse1 (<= 500000 v_main_~x~0_1314)) (.cse3 (= v_main_~x~0_1314 v_main_~x~0_1313))) (or (let ((.cse0 (+ v_main_~x~0_1314 v_main_~y~0_951))) (and (= (+ v_main_~x~0_1313 v_main_~y~0_952) .cse0) .cse1 (< v_main_~y~0_952 v_main_~y~0_951) (< .cse0 (+ v_main_~y~0_952 1000001)))) (and .cse2 .cse3) (and .cse2 (or (not (< v_main_~x~0_1314 1000000)) (not .cse1)) .cse3))) InVars {main_~x~0=v_main_~x~0_1314, main_~y~0=v_main_~y~0_952} OutVars{main_~x~0=v_main_~x~0_1313, main_~y~0=v_main_~y~0_951} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {18253#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} is VALID [2022-04-28 03:57:44,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {18253#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} [188] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {18254#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:57:44,031 INFO L272 TraceCheckUtils]: 10: Hoare triple {18254#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {18255#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:57:44,031 INFO L290 TraceCheckUtils]: 11: Hoare triple {18255#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {18256#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:57:44,031 INFO L290 TraceCheckUtils]: 12: Hoare triple {18256#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {18247#false} is VALID [2022-04-28 03:57:44,031 INFO L290 TraceCheckUtils]: 13: Hoare triple {18247#false} assume !false; {18247#false} is VALID [2022-04-28 03:57:44,032 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:57:44,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:57:44,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114575570] [2022-04-28 03:57:44,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114575570] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:57:44,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98503742] [2022-04-28 03:57:44,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:57:44,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:57:44,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:57:44,033 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:57:44,033 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:57:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:44,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:57:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:44,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:57:44,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {18246#true} call ULTIMATE.init(); {18246#true} is VALID [2022-04-28 03:57:44,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {18246#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(17, 2);call #Ultimate.allocInit(12, 3); {18246#true} is VALID [2022-04-28 03:57:44,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {18246#true} assume true; {18246#true} is VALID [2022-04-28 03:57:44,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18246#true} {18246#true} #41#return; {18246#true} is VALID [2022-04-28 03:57:44,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {18246#true} call #t~ret4 := main(); {18246#true} is VALID [2022-04-28 03:57:44,403 INFO L290 TraceCheckUtils]: 5: Hoare triple {18246#true} ~x~0 := 0;~y~0 := 500000; {18276#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:57:44,403 INFO L290 TraceCheckUtils]: 6: Hoare triple {18276#(and (<= main_~x~0 0) (= main_~y~0 500000))} [189] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1312 v_main_~x~0_1311))) (or (and (not (< v_main_~x~0_1312 500000)) .cse0) (and (< v_main_~x~0_1311 500001) (< v_main_~x~0_1312 v_main_~x~0_1311)) .cse0)) InVars {main_~x~0=v_main_~x~0_1312} OutVars{main_~x~0=v_main_~x~0_1311} AuxVars[] AssignedVars[main_~x~0] {18280#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:57:44,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {18280#(and (= main_~y~0 500000) (< main_~x~0 500001))} [190] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18280#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:57:44,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {18280#(and (= main_~y~0 500000) (< main_~x~0 500001))} [191] L11-2-->L10-2_primed: Formula: (let ((.cse2 (= v_main_~y~0_952 v_main_~y~0_951)) (.cse1 (<= 500000 v_main_~x~0_1314)) (.cse3 (= v_main_~x~0_1314 v_main_~x~0_1313))) (or (let ((.cse0 (+ v_main_~x~0_1314 v_main_~y~0_951))) (and (= (+ v_main_~x~0_1313 v_main_~y~0_952) .cse0) .cse1 (< v_main_~y~0_952 v_main_~y~0_951) (< .cse0 (+ v_main_~y~0_952 1000001)))) (and .cse2 .cse3) (and .cse2 (or (not (< v_main_~x~0_1314 1000000)) (not .cse1)) .cse3))) InVars {main_~x~0=v_main_~x~0_1314, main_~y~0=v_main_~y~0_952} OutVars{main_~x~0=v_main_~x~0_1313, main_~y~0=v_main_~y~0_951} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {18287#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:57:44,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {18287#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [188] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {18291#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:57:44,406 INFO L272 TraceCheckUtils]: 10: Hoare triple {18291#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {18295#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:57:44,406 INFO L290 TraceCheckUtils]: 11: Hoare triple {18295#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18299#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:57:44,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {18299#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18247#false} is VALID [2022-04-28 03:57:44,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {18247#false} assume !false; {18247#false} is VALID [2022-04-28 03:57:44,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:57:44,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:57:44,728 INFO L290 TraceCheckUtils]: 13: Hoare triple {18247#false} assume !false; {18247#false} is VALID [2022-04-28 03:57:44,728 INFO L290 TraceCheckUtils]: 12: Hoare triple {18299#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18247#false} is VALID [2022-04-28 03:57:44,729 INFO L290 TraceCheckUtils]: 11: Hoare triple {18295#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18299#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:57:44,729 INFO L272 TraceCheckUtils]: 10: Hoare triple {18254#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {18295#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:57:44,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {18318#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [188] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {18254#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:57:44,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {18322#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [191] L11-2-->L10-2_primed: Formula: (let ((.cse2 (= v_main_~y~0_952 v_main_~y~0_951)) (.cse1 (<= 500000 v_main_~x~0_1314)) (.cse3 (= v_main_~x~0_1314 v_main_~x~0_1313))) (or (let ((.cse0 (+ v_main_~x~0_1314 v_main_~y~0_951))) (and (= (+ v_main_~x~0_1313 v_main_~y~0_952) .cse0) .cse1 (< v_main_~y~0_952 v_main_~y~0_951) (< .cse0 (+ v_main_~y~0_952 1000001)))) (and .cse2 .cse3) (and .cse2 (or (not (< v_main_~x~0_1314 1000000)) (not .cse1)) .cse3))) InVars {main_~x~0=v_main_~x~0_1314, main_~y~0=v_main_~y~0_952} OutVars{main_~x~0=v_main_~x~0_1313, main_~y~0=v_main_~y~0_951} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {18318#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:57:44,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {18322#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [190] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18322#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:57:44,732 INFO L290 TraceCheckUtils]: 6: Hoare triple {18329#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [189] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1312 v_main_~x~0_1311))) (or (and (not (< v_main_~x~0_1312 500000)) .cse0) (and (< v_main_~x~0_1311 500001) (< v_main_~x~0_1312 v_main_~x~0_1311)) .cse0)) InVars {main_~x~0=v_main_~x~0_1312} OutVars{main_~x~0=v_main_~x~0_1311} AuxVars[] AssignedVars[main_~x~0] {18322#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:57:44,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {18246#true} ~x~0 := 0;~y~0 := 500000; {18329#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:57:44,732 INFO L272 TraceCheckUtils]: 4: Hoare triple {18246#true} call #t~ret4 := main(); {18246#true} is VALID [2022-04-28 03:57:44,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18246#true} {18246#true} #41#return; {18246#true} is VALID [2022-04-28 03:57:44,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {18246#true} assume true; {18246#true} is VALID [2022-04-28 03:57:44,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {18246#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(17, 2);call #Ultimate.allocInit(12, 3); {18246#true} is VALID [2022-04-28 03:57:44,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {18246#true} call ULTIMATE.init(); {18246#true} is VALID [2022-04-28 03:57:44,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:57:44,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98503742] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:57:44,733 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:57:44,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 03:57:46,319 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:57:46,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [146430594] [2022-04-28 03:57:46,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [146430594] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:57:46,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:57:46,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-28 03:57:46,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244004666] [2022-04-28 03:57:46,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:57:46,320 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.930232558139535) internal successors, (83), 42 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:57:46,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:57:46,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 43 states have (on average 1.930232558139535) internal successors, (83), 42 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:57:46,381 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:57:46,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-28 03:57:46,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:57:46,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-28 03:57:46,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=2694, Unknown=0, NotChecked=0, Total=3080 [2022-04-28 03:57:46,382 INFO L87 Difference]: Start difference. First operand 89 states and 92 transitions. Second operand has 44 states, 43 states have (on average 1.930232558139535) internal successors, (83), 42 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:57:51,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:57:51,720 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2022-04-28 03:57:51,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-28 03:57:51,721 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.930232558139535) internal successors, (83), 42 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:57:51,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:57:51,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.930232558139535) internal successors, (83), 42 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:57:51,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 103 transitions. [2022-04-28 03:57:51,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.930232558139535) internal successors, (83), 42 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:57:51,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 103 transitions. [2022-04-28 03:57:51,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 103 transitions. [2022-04-28 03:57:51,841 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:57:51,842 INFO L225 Difference]: With dead ends: 98 [2022-04-28 03:57:51,842 INFO L226 Difference]: Without dead ends: 91 [2022-04-28 03:57:51,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1867 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=813, Invalid=8117, Unknown=0, NotChecked=0, Total=8930 [2022-04-28 03:57:51,843 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 83 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 3039 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 3120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 3039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:57:51,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 98 Invalid, 3120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 3039 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 03:57:51,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-28 03:57:52,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-04-28 03:57:52,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:57:52,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 91 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 86 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:52,068 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 91 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 86 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:52,068 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 91 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 86 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:52,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:57:52,069 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2022-04-28 03:57:52,069 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2022-04-28 03:57:52,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:57:52,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:57:52,069 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 86 states have internal predecessors, (90), 3 states have call successors, (3), 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:57:52,069 INFO L87 Difference]: Start difference. First operand has 91 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 86 states have internal predecessors, (90), 3 states have call successors, (3), 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:57:52,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:57:52,070 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2022-04-28 03:57:52,070 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2022-04-28 03:57:52,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:57:52,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:57:52,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:57:52,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:57:52,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 86 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:52,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 94 transitions. [2022-04-28 03:57:52,071 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 94 transitions. Word has length 87 [2022-04-28 03:57:52,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:57:52,071 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 94 transitions. [2022-04-28 03:57:52,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.930232558139535) internal successors, (83), 42 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:57:52,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 94 transitions. [2022-04-28 03:57:52,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:57:52,159 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2022-04-28 03:57:52,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-28 03:57:52,159 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:57:52,159 INFO L195 NwaCegarLoop]: trace histogram [39, 37, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:57:52,177 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:57:52,360 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:57:52,360 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:57:52,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:57:52,361 INFO L85 PathProgramCache]: Analyzing trace with hash 998032932, now seen corresponding path program 37 times [2022-04-28 03:57:52,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:57:52,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [731241330] [2022-04-28 03:57:56,419 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:57:56,458 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:57:56,675 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:57:56,676 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:57:56,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1372385199, now seen corresponding path program 1 times [2022-04-28 03:57:56,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:57:56,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142902953] [2022-04-28 03:57:56,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:57:56,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:57:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:56,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:57:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:56,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {19037#(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(17, 2);call #Ultimate.allocInit(12, 3); {19026#true} is VALID [2022-04-28 03:57:56,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {19026#true} assume true; {19026#true} is VALID [2022-04-28 03:57:56,755 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19026#true} {19026#true} #41#return; {19026#true} is VALID [2022-04-28 03:57:56,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {19026#true} call ULTIMATE.init(); {19037#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:57:56,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {19037#(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(17, 2);call #Ultimate.allocInit(12, 3); {19026#true} is VALID [2022-04-28 03:57:56,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {19026#true} assume true; {19026#true} is VALID [2022-04-28 03:57:56,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19026#true} {19026#true} #41#return; {19026#true} is VALID [2022-04-28 03:57:56,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {19026#true} call #t~ret4 := main(); {19026#true} is VALID [2022-04-28 03:57:56,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {19026#true} ~x~0 := 0;~y~0 := 500000; {19031#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:57:56,756 INFO L290 TraceCheckUtils]: 6: Hoare triple {19031#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [193] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1367 v_main_~x~0_1366))) (or (and (< v_main_~x~0_1367 v_main_~x~0_1366) (< v_main_~x~0_1366 500001)) .cse0 (and .cse0 (<= 500000 v_main_~x~0_1367)))) InVars {main_~x~0=v_main_~x~0_1367} OutVars{main_~x~0=v_main_~x~0_1366} AuxVars[] AssignedVars[main_~x~0] {19032#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:57:56,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {19032#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [194] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19032#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:57:56,757 INFO L290 TraceCheckUtils]: 8: Hoare triple {19032#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [195] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1369 v_main_~x~0_1368)) (.cse1 (= v_main_~y~0_997 v_main_~y~0_996)) (.cse2 (<= 500000 v_main_~x~0_1369))) (or (and .cse0 .cse1) (and .cse0 .cse1 (or (not (< v_main_~x~0_1369 1000000)) (not .cse2))) (and (< v_main_~x~0_1369 v_main_~x~0_1368) .cse2 (= (+ v_main_~x~0_1369 v_main_~y~0_996) (+ v_main_~x~0_1368 v_main_~y~0_997)) (< v_main_~x~0_1368 1000001)))) InVars {main_~x~0=v_main_~x~0_1369, main_~y~0=v_main_~y~0_997} OutVars{main_~x~0=v_main_~x~0_1368, main_~y~0=v_main_~y~0_996} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {19033#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:57:56,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {19033#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [192] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {19034#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:57:56,758 INFO L272 TraceCheckUtils]: 10: Hoare triple {19034#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {19035#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:57:56,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {19035#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {19036#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:57:56,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {19036#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {19027#false} is VALID [2022-04-28 03:57:56,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {19027#false} assume !false; {19027#false} is VALID [2022-04-28 03:57:56,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:57:56,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:57:56,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142902953] [2022-04-28 03:57:56,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142902953] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:57:56,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271541309] [2022-04-28 03:57:56,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:57:56,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:57:56,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:57:56,760 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:57:56,761 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:57:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:56,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:57:56,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:56,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:57:57,100 INFO L272 TraceCheckUtils]: 0: Hoare triple {19026#true} call ULTIMATE.init(); {19026#true} is VALID [2022-04-28 03:57:57,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {19026#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(17, 2);call #Ultimate.allocInit(12, 3); {19026#true} is VALID [2022-04-28 03:57:57,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {19026#true} assume true; {19026#true} is VALID [2022-04-28 03:57:57,101 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19026#true} {19026#true} #41#return; {19026#true} is VALID [2022-04-28 03:57:57,101 INFO L272 TraceCheckUtils]: 4: Hoare triple {19026#true} call #t~ret4 := main(); {19026#true} is VALID [2022-04-28 03:57:57,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {19026#true} ~x~0 := 0;~y~0 := 500000; {19056#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:57:57,102 INFO L290 TraceCheckUtils]: 6: Hoare triple {19056#(and (<= main_~x~0 0) (= main_~y~0 500000))} [193] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1367 v_main_~x~0_1366))) (or (and (< v_main_~x~0_1367 v_main_~x~0_1366) (< v_main_~x~0_1366 500001)) .cse0 (and .cse0 (<= 500000 v_main_~x~0_1367)))) InVars {main_~x~0=v_main_~x~0_1367} OutVars{main_~x~0=v_main_~x~0_1366} AuxVars[] AssignedVars[main_~x~0] {19060#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:57:57,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {19060#(and (= main_~y~0 500000) (< main_~x~0 500001))} [194] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19060#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:57:57,103 INFO L290 TraceCheckUtils]: 8: Hoare triple {19060#(and (= main_~y~0 500000) (< main_~x~0 500001))} [195] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1369 v_main_~x~0_1368)) (.cse1 (= v_main_~y~0_997 v_main_~y~0_996)) (.cse2 (<= 500000 v_main_~x~0_1369))) (or (and .cse0 .cse1) (and .cse0 .cse1 (or (not (< v_main_~x~0_1369 1000000)) (not .cse2))) (and (< v_main_~x~0_1369 v_main_~x~0_1368) .cse2 (= (+ v_main_~x~0_1369 v_main_~y~0_996) (+ v_main_~x~0_1368 v_main_~y~0_997)) (< v_main_~x~0_1368 1000001)))) InVars {main_~x~0=v_main_~x~0_1369, main_~y~0=v_main_~y~0_997} OutVars{main_~x~0=v_main_~x~0_1368, main_~y~0=v_main_~y~0_996} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {19067#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:57:57,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {19067#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [192] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {19071#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:57:57,104 INFO L272 TraceCheckUtils]: 10: Hoare triple {19071#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {19075#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:57:57,104 INFO L290 TraceCheckUtils]: 11: Hoare triple {19075#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19079#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:57:57,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {19079#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19027#false} is VALID [2022-04-28 03:57:57,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {19027#false} assume !false; {19027#false} is VALID [2022-04-28 03:57:57,105 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:57:57,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:57:57,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {19027#false} assume !false; {19027#false} is VALID [2022-04-28 03:57:57,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {19079#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19027#false} is VALID [2022-04-28 03:57:57,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {19075#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19079#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:57:57,413 INFO L272 TraceCheckUtils]: 10: Hoare triple {19034#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {19075#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:57:57,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {19098#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [192] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {19034#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:57:57,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {19102#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [195] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1369 v_main_~x~0_1368)) (.cse1 (= v_main_~y~0_997 v_main_~y~0_996)) (.cse2 (<= 500000 v_main_~x~0_1369))) (or (and .cse0 .cse1) (and .cse0 .cse1 (or (not (< v_main_~x~0_1369 1000000)) (not .cse2))) (and (< v_main_~x~0_1369 v_main_~x~0_1368) .cse2 (= (+ v_main_~x~0_1369 v_main_~y~0_996) (+ v_main_~x~0_1368 v_main_~y~0_997)) (< v_main_~x~0_1368 1000001)))) InVars {main_~x~0=v_main_~x~0_1369, main_~y~0=v_main_~y~0_997} OutVars{main_~x~0=v_main_~x~0_1368, main_~y~0=v_main_~y~0_996} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {19098#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:57:57,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {19102#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [194] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19102#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:57:57,415 INFO L290 TraceCheckUtils]: 6: Hoare triple {19109#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [193] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1367 v_main_~x~0_1366))) (or (and (< v_main_~x~0_1367 v_main_~x~0_1366) (< v_main_~x~0_1366 500001)) .cse0 (and .cse0 (<= 500000 v_main_~x~0_1367)))) InVars {main_~x~0=v_main_~x~0_1367} OutVars{main_~x~0=v_main_~x~0_1366} AuxVars[] AssignedVars[main_~x~0] {19102#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:57:57,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {19026#true} ~x~0 := 0;~y~0 := 500000; {19109#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:57:57,416 INFO L272 TraceCheckUtils]: 4: Hoare triple {19026#true} call #t~ret4 := main(); {19026#true} is VALID [2022-04-28 03:57:57,416 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19026#true} {19026#true} #41#return; {19026#true} is VALID [2022-04-28 03:57:57,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {19026#true} assume true; {19026#true} is VALID [2022-04-28 03:57:57,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {19026#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(17, 2);call #Ultimate.allocInit(12, 3); {19026#true} is VALID [2022-04-28 03:57:57,416 INFO L272 TraceCheckUtils]: 0: Hoare triple {19026#true} call ULTIMATE.init(); {19026#true} is VALID [2022-04-28 03:57:57,416 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:57:57,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271541309] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:57:57,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:57:57,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 03:57:58,992 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:57:58,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [731241330] [2022-04-28 03:57:58,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [731241330] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:57:58,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:57:58,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-04-28 03:57:58,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203331476] [2022-04-28 03:57:58,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:57:58,992 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 43 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:57:58,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:57:58,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 45 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 43 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:57:59,052 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:57:59,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-04-28 03:57:59,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:57:59,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-04-28 03:57:59,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=2798, Unknown=0, NotChecked=0, Total=3192 [2022-04-28 03:57:59,053 INFO L87 Difference]: Start difference. First operand 91 states and 94 transitions. Second operand has 45 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 43 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:58:04,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:04,723 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2022-04-28 03:58:04,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-28 03:58:04,723 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 43 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:58:04,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:58:04,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 43 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:58:04,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 105 transitions. [2022-04-28 03:58:04,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 43 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:58:04,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 105 transitions. [2022-04-28 03:58:04,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 105 transitions. [2022-04-28 03:58:04,804 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:58:04,805 INFO L225 Difference]: With dead ends: 100 [2022-04-28 03:58:04,805 INFO L226 Difference]: Without dead ends: 93 [2022-04-28 03:58:04,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1933 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=832, Invalid=8480, Unknown=0, NotChecked=0, Total=9312 [2022-04-28 03:58:04,806 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 85 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 3130 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 3213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 3130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:58:04,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 38 Invalid, 3213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 3130 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 03:58:04,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-28 03:58:05,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-28 03:58:05,056 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:58:05,056 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 88 states have (on average 1.0454545454545454) internal successors, (92), 88 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:05,056 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 88 states have (on average 1.0454545454545454) internal successors, (92), 88 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:05,056 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 88 states have (on average 1.0454545454545454) internal successors, (92), 88 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:05,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:05,057 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2022-04-28 03:58:05,057 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2022-04-28 03:58:05,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:58:05,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:58:05,058 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 88 states have (on average 1.0454545454545454) internal successors, (92), 88 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 93 states. [2022-04-28 03:58:05,058 INFO L87 Difference]: Start difference. First operand has 93 states, 88 states have (on average 1.0454545454545454) internal successors, (92), 88 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 93 states. [2022-04-28 03:58:05,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:05,058 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2022-04-28 03:58:05,058 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2022-04-28 03:58:05,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:58:05,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:58:05,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:58:05,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:58:05,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 88 states have (on average 1.0454545454545454) internal successors, (92), 88 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:05,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2022-04-28 03:58:05,060 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 89 [2022-04-28 03:58:05,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:58:05,060 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2022-04-28 03:58:05,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 43 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:58:05,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 93 states and 96 transitions. [2022-04-28 03:58:05,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:58:05,147 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2022-04-28 03:58:05,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-28 03:58:05,147 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:58:05,147 INFO L195 NwaCegarLoop]: trace histogram [40, 38, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:58:05,164 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:58:05,364 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:58:05,364 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:58:05,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:58:05,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1568373503, now seen corresponding path program 38 times [2022-04-28 03:58:05,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:58:05,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1403637676] [2022-04-28 03:58:07,425 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:58:07,466 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:58:07,664 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:58:07,665 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:58:07,667 INFO L85 PathProgramCache]: Analyzing trace with hash -873049937, now seen corresponding path program 1 times [2022-04-28 03:58:07,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:58:07,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623930604] [2022-04-28 03:58:07,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:58:07,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:58:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:07,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:58:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:07,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {19832#(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(17, 2);call #Ultimate.allocInit(12, 3); {19821#true} is VALID [2022-04-28 03:58:07,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {19821#true} assume true; {19821#true} is VALID [2022-04-28 03:58:07,772 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19821#true} {19821#true} #41#return; {19821#true} is VALID [2022-04-28 03:58:07,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {19821#true} call ULTIMATE.init(); {19832#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:58:07,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {19832#(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(17, 2);call #Ultimate.allocInit(12, 3); {19821#true} is VALID [2022-04-28 03:58:07,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {19821#true} assume true; {19821#true} is VALID [2022-04-28 03:58:07,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19821#true} {19821#true} #41#return; {19821#true} is VALID [2022-04-28 03:58:07,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {19821#true} call #t~ret4 := main(); {19821#true} is VALID [2022-04-28 03:58:07,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {19821#true} ~x~0 := 0;~y~0 := 500000; {19826#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:58:07,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {19826#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [197] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1423 v_main_~x~0_1422))) (or (and (not (< v_main_~x~0_1423 500000)) .cse0) .cse0 (and (< v_main_~x~0_1422 500001) (< v_main_~x~0_1423 v_main_~x~0_1422)))) InVars {main_~x~0=v_main_~x~0_1423} OutVars{main_~x~0=v_main_~x~0_1422} AuxVars[] AssignedVars[main_~x~0] {19827#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:58:07,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {19827#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [198] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19827#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:58:07,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {19827#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [199] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1425 v_main_~x~0_1424)) (.cse2 (= v_main_~y~0_1043 v_main_~y~0_1042)) (.cse1 (<= 500000 v_main_~x~0_1425))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_1425 1000000))) .cse2) (and .cse0 .cse2) (let ((.cse3 (+ v_main_~x~0_1425 v_main_~y~0_1042))) (and (< .cse3 (+ 1000001 v_main_~y~0_1043)) (= .cse3 (+ v_main_~x~0_1424 v_main_~y~0_1043)) .cse1 (< v_main_~y~0_1043 v_main_~y~0_1042))))) InVars {main_~x~0=v_main_~x~0_1425, main_~y~0=v_main_~y~0_1043} OutVars{main_~x~0=v_main_~x~0_1424, main_~y~0=v_main_~y~0_1042} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {19828#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:58:07,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {19828#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [196] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {19829#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:58:07,776 INFO L272 TraceCheckUtils]: 10: Hoare triple {19829#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {19830#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:58:07,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {19830#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {19831#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:58:07,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {19831#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {19822#false} is VALID [2022-04-28 03:58:07,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {19822#false} assume !false; {19822#false} is VALID [2022-04-28 03:58:07,777 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:58:07,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:58:07,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623930604] [2022-04-28 03:58:07,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623930604] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:58:07,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756905915] [2022-04-28 03:58:07,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:58:07,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:58:07,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:58:07,778 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:58:07,779 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:58:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:07,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:58:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:07,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:58:08,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {19821#true} call ULTIMATE.init(); {19821#true} is VALID [2022-04-28 03:58:08,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {19821#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(17, 2);call #Ultimate.allocInit(12, 3); {19821#true} is VALID [2022-04-28 03:58:08,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {19821#true} assume true; {19821#true} is VALID [2022-04-28 03:58:08,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19821#true} {19821#true} #41#return; {19821#true} is VALID [2022-04-28 03:58:08,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {19821#true} call #t~ret4 := main(); {19821#true} is VALID [2022-04-28 03:58:08,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {19821#true} ~x~0 := 0;~y~0 := 500000; {19851#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:58:08,147 INFO L290 TraceCheckUtils]: 6: Hoare triple {19851#(and (<= main_~x~0 0) (= main_~y~0 500000))} [197] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1423 v_main_~x~0_1422))) (or (and (not (< v_main_~x~0_1423 500000)) .cse0) .cse0 (and (< v_main_~x~0_1422 500001) (< v_main_~x~0_1423 v_main_~x~0_1422)))) InVars {main_~x~0=v_main_~x~0_1423} OutVars{main_~x~0=v_main_~x~0_1422} AuxVars[] AssignedVars[main_~x~0] {19855#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:58:08,148 INFO L290 TraceCheckUtils]: 7: Hoare triple {19855#(and (= main_~y~0 500000) (< main_~x~0 500001))} [198] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19855#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:58:08,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {19855#(and (= main_~y~0 500000) (< main_~x~0 500001))} [199] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1425 v_main_~x~0_1424)) (.cse2 (= v_main_~y~0_1043 v_main_~y~0_1042)) (.cse1 (<= 500000 v_main_~x~0_1425))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_1425 1000000))) .cse2) (and .cse0 .cse2) (let ((.cse3 (+ v_main_~x~0_1425 v_main_~y~0_1042))) (and (< .cse3 (+ 1000001 v_main_~y~0_1043)) (= .cse3 (+ v_main_~x~0_1424 v_main_~y~0_1043)) .cse1 (< v_main_~y~0_1043 v_main_~y~0_1042))))) InVars {main_~x~0=v_main_~x~0_1425, main_~y~0=v_main_~y~0_1043} OutVars{main_~x~0=v_main_~x~0_1424, main_~y~0=v_main_~y~0_1042} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {19862#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:58:08,149 INFO L290 TraceCheckUtils]: 9: Hoare triple {19862#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [196] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {19866#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:58:08,150 INFO L272 TraceCheckUtils]: 10: Hoare triple {19866#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {19870#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:58:08,150 INFO L290 TraceCheckUtils]: 11: Hoare triple {19870#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19874#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:58:08,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {19874#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19822#false} is VALID [2022-04-28 03:58:08,150 INFO L290 TraceCheckUtils]: 13: Hoare triple {19822#false} assume !false; {19822#false} is VALID [2022-04-28 03:58:08,150 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:58:08,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:58:08,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {19822#false} assume !false; {19822#false} is VALID [2022-04-28 03:58:08,455 INFO L290 TraceCheckUtils]: 12: Hoare triple {19874#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19822#false} is VALID [2022-04-28 03:58:08,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {19870#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19874#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:58:08,456 INFO L272 TraceCheckUtils]: 10: Hoare triple {19829#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {19870#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:58:08,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {19893#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [196] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {19829#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:58:08,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {19897#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [199] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1425 v_main_~x~0_1424)) (.cse2 (= v_main_~y~0_1043 v_main_~y~0_1042)) (.cse1 (<= 500000 v_main_~x~0_1425))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_1425 1000000))) .cse2) (and .cse0 .cse2) (let ((.cse3 (+ v_main_~x~0_1425 v_main_~y~0_1042))) (and (< .cse3 (+ 1000001 v_main_~y~0_1043)) (= .cse3 (+ v_main_~x~0_1424 v_main_~y~0_1043)) .cse1 (< v_main_~y~0_1043 v_main_~y~0_1042))))) InVars {main_~x~0=v_main_~x~0_1425, main_~y~0=v_main_~y~0_1043} OutVars{main_~x~0=v_main_~x~0_1424, main_~y~0=v_main_~y~0_1042} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {19893#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:58:08,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {19897#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [198] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19897#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:58:08,459 INFO L290 TraceCheckUtils]: 6: Hoare triple {19904#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [197] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1423 v_main_~x~0_1422))) (or (and (not (< v_main_~x~0_1423 500000)) .cse0) .cse0 (and (< v_main_~x~0_1422 500001) (< v_main_~x~0_1423 v_main_~x~0_1422)))) InVars {main_~x~0=v_main_~x~0_1423} OutVars{main_~x~0=v_main_~x~0_1422} AuxVars[] AssignedVars[main_~x~0] {19897#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:58:08,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {19821#true} ~x~0 := 0;~y~0 := 500000; {19904#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:58:08,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {19821#true} call #t~ret4 := main(); {19821#true} is VALID [2022-04-28 03:58:08,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19821#true} {19821#true} #41#return; {19821#true} is VALID [2022-04-28 03:58:08,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {19821#true} assume true; {19821#true} is VALID [2022-04-28 03:58:08,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {19821#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(17, 2);call #Ultimate.allocInit(12, 3); {19821#true} is VALID [2022-04-28 03:58:08,462 INFO L272 TraceCheckUtils]: 0: Hoare triple {19821#true} call ULTIMATE.init(); {19821#true} is VALID [2022-04-28 03:58:08,462 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:58:08,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756905915] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:58:08,463 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:58:08,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 03:58:10,184 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:58:10,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1403637676] [2022-04-28 03:58:10,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1403637676] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:58:10,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:58:10,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-28 03:58:10,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805408887] [2022-04-28 03:58:10,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:58:10,185 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 44 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:58:10,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:58:10,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 44 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:58:10,251 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:58:10,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-28 03:58:10,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:58:10,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-28 03:58:10,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=402, Invalid=2904, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 03:58:10,253 INFO L87 Difference]: Start difference. First operand 93 states and 96 transitions. Second operand has 46 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 44 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:58:16,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:16,490 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2022-04-28 03:58:16,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-28 03:58:16,490 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 44 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:58:16,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:58:16,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 44 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:58:16,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 107 transitions. [2022-04-28 03:58:16,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 44 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:58:16,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 107 transitions. [2022-04-28 03:58:16,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 107 transitions. [2022-04-28 03:58:16,572 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:58:16,573 INFO L225 Difference]: With dead ends: 102 [2022-04-28 03:58:16,573 INFO L226 Difference]: Without dead ends: 95 [2022-04-28 03:58:16,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2000 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=851, Invalid=8851, Unknown=0, NotChecked=0, Total=9702 [2022-04-28 03:58:16,574 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 87 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 3481 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 3566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 3481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:58:16,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 158 Invalid, 3566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 3481 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-28 03:58:16,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-28 03:58:16,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-04-28 03:58:16,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:58:16,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 95 states, 90 states have (on average 1.0444444444444445) internal successors, (94), 90 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:16,817 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 95 states, 90 states have (on average 1.0444444444444445) internal successors, (94), 90 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:16,817 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 95 states, 90 states have (on average 1.0444444444444445) internal successors, (94), 90 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:16,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:16,818 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2022-04-28 03:58:16,818 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2022-04-28 03:58:16,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:58:16,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:58:16,819 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 90 states have (on average 1.0444444444444445) internal successors, (94), 90 states have internal predecessors, (94), 3 states have call successors, (3), 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:58:16,819 INFO L87 Difference]: Start difference. First operand has 95 states, 90 states have (on average 1.0444444444444445) internal successors, (94), 90 states have internal predecessors, (94), 3 states have call successors, (3), 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:58:16,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:16,819 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2022-04-28 03:58:16,819 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2022-04-28 03:58:16,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:58:16,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:58:16,820 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:58:16,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:58:16,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.0444444444444445) internal successors, (94), 90 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:16,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 98 transitions. [2022-04-28 03:58:16,821 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 98 transitions. Word has length 91 [2022-04-28 03:58:16,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:58:16,821 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 98 transitions. [2022-04-28 03:58:16,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 44 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:58:16,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 98 transitions. [2022-04-28 03:58:16,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:58:16,903 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2022-04-28 03:58:16,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-28 03:58:16,903 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:58:16,903 INFO L195 NwaCegarLoop]: trace histogram [41, 39, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:58:16,919 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:58:17,119 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:58:17,119 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:58:17,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:58:17,119 INFO L85 PathProgramCache]: Analyzing trace with hash -90151654, now seen corresponding path program 39 times [2022-04-28 03:58:17,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:58:17,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1621407564] [2022-04-28 03:58:21,172 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:58:21,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:58:21,421 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:58:21,422 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:58:21,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1176482223, now seen corresponding path program 1 times [2022-04-28 03:58:21,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:58:21,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923044073] [2022-04-28 03:58:21,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:58:21,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:58:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:21,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:58:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:21,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {20642#(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(17, 2);call #Ultimate.allocInit(12, 3); {20631#true} is VALID [2022-04-28 03:58:21,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {20631#true} assume true; {20631#true} is VALID [2022-04-28 03:58:21,508 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20631#true} {20631#true} #41#return; {20631#true} is VALID [2022-04-28 03:58:21,508 INFO L272 TraceCheckUtils]: 0: Hoare triple {20631#true} call ULTIMATE.init(); {20642#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:58:21,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {20642#(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(17, 2);call #Ultimate.allocInit(12, 3); {20631#true} is VALID [2022-04-28 03:58:21,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {20631#true} assume true; {20631#true} is VALID [2022-04-28 03:58:21,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20631#true} {20631#true} #41#return; {20631#true} is VALID [2022-04-28 03:58:21,509 INFO L272 TraceCheckUtils]: 4: Hoare triple {20631#true} call #t~ret4 := main(); {20631#true} is VALID [2022-04-28 03:58:21,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {20631#true} ~x~0 := 0;~y~0 := 500000; {20636#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:58:21,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {20636#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [201] L11-2-->L10-2_primed: Formula: (or (= v_main_~x~0_1480 v_main_~x~0_1479) (and (<= 500000 v_main_~x~0_1480) (= v_main_~x~0_1479 v_main_~x~0_1480)) (and (< v_main_~x~0_1480 v_main_~x~0_1479) (< v_main_~x~0_1479 500001))) InVars {main_~x~0=v_main_~x~0_1480} OutVars{main_~x~0=v_main_~x~0_1479} AuxVars[] AssignedVars[main_~x~0] {20637#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:58:21,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {20637#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [202] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20637#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:58:21,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {20637#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [203] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_1482)) (.cse0 (= v_main_~x~0_1482 v_main_~x~0_1481))) (or (and (= v_main_~y~0_1090 v_main_~y~0_1089) .cse0) (and .cse1 (< v_main_~x~0_1481 1000001) (< v_main_~x~0_1482 v_main_~x~0_1481) (= (+ v_main_~x~0_1482 v_main_~y~0_1089) (+ v_main_~x~0_1481 v_main_~y~0_1090))) (and (or (not (< v_main_~x~0_1482 1000000)) (not .cse1)) (= v_main_~y~0_1089 v_main_~y~0_1090) .cse0))) InVars {main_~x~0=v_main_~x~0_1482, main_~y~0=v_main_~y~0_1090} OutVars{main_~x~0=v_main_~x~0_1481, main_~y~0=v_main_~y~0_1089} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {20638#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:58:21,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {20638#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [200] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {20639#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:58:21,512 INFO L272 TraceCheckUtils]: 10: Hoare triple {20639#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {20640#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:58:21,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {20640#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {20641#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:58:21,513 INFO L290 TraceCheckUtils]: 12: Hoare triple {20641#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {20632#false} is VALID [2022-04-28 03:58:21,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {20632#false} assume !false; {20632#false} is VALID [2022-04-28 03:58:21,513 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:58:21,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:58:21,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923044073] [2022-04-28 03:58:21,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923044073] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:58:21,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408026740] [2022-04-28 03:58:21,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:58:21,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:58:21,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:58:21,524 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:58:21,525 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:58:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:21,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:58:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:21,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:58:21,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {20631#true} call ULTIMATE.init(); {20631#true} is VALID [2022-04-28 03:58:21,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {20631#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(17, 2);call #Ultimate.allocInit(12, 3); {20631#true} is VALID [2022-04-28 03:58:21,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {20631#true} assume true; {20631#true} is VALID [2022-04-28 03:58:21,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20631#true} {20631#true} #41#return; {20631#true} is VALID [2022-04-28 03:58:21,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {20631#true} call #t~ret4 := main(); {20631#true} is VALID [2022-04-28 03:58:21,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {20631#true} ~x~0 := 0;~y~0 := 500000; {20661#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:58:21,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {20661#(and (<= main_~x~0 0) (= main_~y~0 500000))} [201] L11-2-->L10-2_primed: Formula: (or (= v_main_~x~0_1480 v_main_~x~0_1479) (and (<= 500000 v_main_~x~0_1480) (= v_main_~x~0_1479 v_main_~x~0_1480)) (and (< v_main_~x~0_1480 v_main_~x~0_1479) (< v_main_~x~0_1479 500001))) InVars {main_~x~0=v_main_~x~0_1480} OutVars{main_~x~0=v_main_~x~0_1479} AuxVars[] AssignedVars[main_~x~0] {20665#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:58:21,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {20665#(and (= main_~y~0 500000) (< main_~x~0 500001))} [202] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20665#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:58:21,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {20665#(and (= main_~y~0 500000) (< main_~x~0 500001))} [203] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_1482)) (.cse0 (= v_main_~x~0_1482 v_main_~x~0_1481))) (or (and (= v_main_~y~0_1090 v_main_~y~0_1089) .cse0) (and .cse1 (< v_main_~x~0_1481 1000001) (< v_main_~x~0_1482 v_main_~x~0_1481) (= (+ v_main_~x~0_1482 v_main_~y~0_1089) (+ v_main_~x~0_1481 v_main_~y~0_1090))) (and (or (not (< v_main_~x~0_1482 1000000)) (not .cse1)) (= v_main_~y~0_1089 v_main_~y~0_1090) .cse0))) InVars {main_~x~0=v_main_~x~0_1482, main_~y~0=v_main_~y~0_1090} OutVars{main_~x~0=v_main_~x~0_1481, main_~y~0=v_main_~y~0_1089} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {20672#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:58:21,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {20672#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [200] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {20676#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:58:21,943 INFO L272 TraceCheckUtils]: 10: Hoare triple {20676#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {20680#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:58:21,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {20680#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20684#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:58:21,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {20684#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20632#false} is VALID [2022-04-28 03:58:21,944 INFO L290 TraceCheckUtils]: 13: Hoare triple {20632#false} assume !false; {20632#false} is VALID [2022-04-28 03:58:21,944 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:58:21,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:58:22,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {20632#false} assume !false; {20632#false} is VALID [2022-04-28 03:58:22,254 INFO L290 TraceCheckUtils]: 12: Hoare triple {20684#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20632#false} is VALID [2022-04-28 03:58:22,255 INFO L290 TraceCheckUtils]: 11: Hoare triple {20680#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20684#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:58:22,255 INFO L272 TraceCheckUtils]: 10: Hoare triple {20639#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {20680#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:58:22,256 INFO L290 TraceCheckUtils]: 9: Hoare triple {20703#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [200] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {20639#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:58:22,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {20707#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [203] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_1482)) (.cse0 (= v_main_~x~0_1482 v_main_~x~0_1481))) (or (and (= v_main_~y~0_1090 v_main_~y~0_1089) .cse0) (and .cse1 (< v_main_~x~0_1481 1000001) (< v_main_~x~0_1482 v_main_~x~0_1481) (= (+ v_main_~x~0_1482 v_main_~y~0_1089) (+ v_main_~x~0_1481 v_main_~y~0_1090))) (and (or (not (< v_main_~x~0_1482 1000000)) (not .cse1)) (= v_main_~y~0_1089 v_main_~y~0_1090) .cse0))) InVars {main_~x~0=v_main_~x~0_1482, main_~y~0=v_main_~y~0_1090} OutVars{main_~x~0=v_main_~x~0_1481, main_~y~0=v_main_~y~0_1089} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {20703#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:58:22,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {20707#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [202] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20707#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:58:22,257 INFO L290 TraceCheckUtils]: 6: Hoare triple {20714#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [201] L11-2-->L10-2_primed: Formula: (or (= v_main_~x~0_1480 v_main_~x~0_1479) (and (<= 500000 v_main_~x~0_1480) (= v_main_~x~0_1479 v_main_~x~0_1480)) (and (< v_main_~x~0_1480 v_main_~x~0_1479) (< v_main_~x~0_1479 500001))) InVars {main_~x~0=v_main_~x~0_1480} OutVars{main_~x~0=v_main_~x~0_1479} AuxVars[] AssignedVars[main_~x~0] {20707#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:58:22,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {20631#true} ~x~0 := 0;~y~0 := 500000; {20714#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:58:22,258 INFO L272 TraceCheckUtils]: 4: Hoare triple {20631#true} call #t~ret4 := main(); {20631#true} is VALID [2022-04-28 03:58:22,258 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20631#true} {20631#true} #41#return; {20631#true} is VALID [2022-04-28 03:58:22,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {20631#true} assume true; {20631#true} is VALID [2022-04-28 03:58:22,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {20631#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(17, 2);call #Ultimate.allocInit(12, 3); {20631#true} is VALID [2022-04-28 03:58:22,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {20631#true} call ULTIMATE.init(); {20631#true} is VALID [2022-04-28 03:58:22,258 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:58:22,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408026740] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:58:22,259 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:58:22,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 03:58:23,981 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:58:23,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1621407564] [2022-04-28 03:58:23,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1621407564] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:58:23,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:58:23,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-04-28 03:58:23,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947879050] [2022-04-28 03:58:23,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:58:23,982 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.934782608695652) internal successors, (89), 45 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:58:23,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:58:23,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 47 states, 46 states have (on average 1.934782608695652) internal successors, (89), 45 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:58:24,046 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:58:24,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-28 03:58:24,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:58:24,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-28 03:58:24,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=3012, Unknown=0, NotChecked=0, Total=3422 [2022-04-28 03:58:24,047 INFO L87 Difference]: Start difference. First operand 95 states and 98 transitions. Second operand has 47 states, 46 states have (on average 1.934782608695652) internal successors, (89), 45 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:58:30,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:30,359 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2022-04-28 03:58:30,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-28 03:58:30,360 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.934782608695652) internal successors, (89), 45 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:58:30,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:58:30,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.934782608695652) internal successors, (89), 45 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:58:30,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 109 transitions. [2022-04-28 03:58:30,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.934782608695652) internal successors, (89), 45 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:58:30,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 109 transitions. [2022-04-28 03:58:30,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 109 transitions. [2022-04-28 03:58:30,448 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:58:30,449 INFO L225 Difference]: With dead ends: 104 [2022-04-28 03:58:30,449 INFO L226 Difference]: Without dead ends: 97 [2022-04-28 03:58:30,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2068 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=870, Invalid=9230, Unknown=0, NotChecked=0, Total=10100 [2022-04-28 03:58:30,450 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 89 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 3576 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 3663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 3576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:58:30,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 128 Invalid, 3663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 3576 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-28 03:58:30,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-28 03:58:30,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-04-28 03:58:30,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:58:30,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 97 states, 92 states have (on average 1.0434782608695652) internal successors, (96), 92 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:30,694 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 97 states, 92 states have (on average 1.0434782608695652) internal successors, (96), 92 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:30,694 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 97 states, 92 states have (on average 1.0434782608695652) internal successors, (96), 92 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:30,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:30,695 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2022-04-28 03:58:30,695 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2022-04-28 03:58:30,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:58:30,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:58:30,695 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 92 states have (on average 1.0434782608695652) internal successors, (96), 92 states have internal predecessors, (96), 3 states have call successors, (3), 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:58:30,695 INFO L87 Difference]: Start difference. First operand has 97 states, 92 states have (on average 1.0434782608695652) internal successors, (96), 92 states have internal predecessors, (96), 3 states have call successors, (3), 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:58:30,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:30,696 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2022-04-28 03:58:30,696 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2022-04-28 03:58:30,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:58:30,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:58:30,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:58:30,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:58:30,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 92 states have (on average 1.0434782608695652) internal successors, (96), 92 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:30,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 100 transitions. [2022-04-28 03:58:30,697 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 100 transitions. Word has length 93 [2022-04-28 03:58:30,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:58:30,697 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 100 transitions. [2022-04-28 03:58:30,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.934782608695652) internal successors, (89), 45 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:58:30,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 100 transitions. [2022-04-28 03:58:31,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:58:31,020 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2022-04-28 03:58:31,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-28 03:58:31,020 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:58:31,020 INFO L195 NwaCegarLoop]: trace histogram [42, 40, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:58:31,036 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:58:31,220 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:58:31,221 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:58:31,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:58:31,221 INFO L85 PathProgramCache]: Analyzing trace with hash -499960715, now seen corresponding path program 40 times [2022-04-28 03:58:31,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:58:31,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [330321604] [2022-04-28 03:58:35,291 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:58:35,338 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:58:35,536 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:58:35,538 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:58:35,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1068952913, now seen corresponding path program 1 times [2022-04-28 03:58:35,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:58:35,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114495510] [2022-04-28 03:58:35,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:58:35,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:58:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:35,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:58:35,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:35,633 INFO L290 TraceCheckUtils]: 0: Hoare triple {21467#(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(17, 2);call #Ultimate.allocInit(12, 3); {21456#true} is VALID [2022-04-28 03:58:35,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {21456#true} assume true; {21456#true} is VALID [2022-04-28 03:58:35,633 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21456#true} {21456#true} #41#return; {21456#true} is VALID [2022-04-28 03:58:35,634 INFO L272 TraceCheckUtils]: 0: Hoare triple {21456#true} call ULTIMATE.init(); {21467#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:58:35,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {21467#(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(17, 2);call #Ultimate.allocInit(12, 3); {21456#true} is VALID [2022-04-28 03:58:35,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {21456#true} assume true; {21456#true} is VALID [2022-04-28 03:58:35,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21456#true} {21456#true} #41#return; {21456#true} is VALID [2022-04-28 03:58:35,634 INFO L272 TraceCheckUtils]: 4: Hoare triple {21456#true} call #t~ret4 := main(); {21456#true} is VALID [2022-04-28 03:58:35,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {21456#true} ~x~0 := 0;~y~0 := 500000; {21461#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:58:35,635 INFO L290 TraceCheckUtils]: 6: Hoare triple {21461#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [205] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1538 v_main_~x~0_1537))) (or .cse0 (and (< v_main_~x~0_1538 v_main_~x~0_1537) (< v_main_~x~0_1537 500001)) (and .cse0 (not (< v_main_~x~0_1538 500000))))) InVars {main_~x~0=v_main_~x~0_1538} OutVars{main_~x~0=v_main_~x~0_1537} AuxVars[] AssignedVars[main_~x~0] {21462#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:58:35,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {21462#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [206] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21462#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:58:35,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {21462#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [207] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_1138 v_main_~y~0_1137)) (.cse2 (<= 500000 v_main_~x~0_1540))) (or (and .cse0 (= v_main_~x~0_1540 v_main_~x~0_1539)) (let ((.cse1 (+ v_main_~x~0_1540 v_main_~y~0_1137))) (and (< .cse1 (+ 1000001 v_main_~y~0_1138)) .cse2 (< v_main_~y~0_1138 v_main_~y~0_1137) (= (+ v_main_~x~0_1539 v_main_~y~0_1138) .cse1))) (and .cse0 (= v_main_~x~0_1539 v_main_~x~0_1540) (or (not .cse2) (not (< v_main_~x~0_1540 1000000)))))) InVars {main_~x~0=v_main_~x~0_1540, main_~y~0=v_main_~y~0_1138} OutVars{main_~x~0=v_main_~x~0_1539, main_~y~0=v_main_~y~0_1137} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {21463#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:58:35,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {21463#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [204] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {21464#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:58:35,637 INFO L272 TraceCheckUtils]: 10: Hoare triple {21464#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {21465#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:58:35,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {21465#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {21466#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:58:35,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {21466#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {21457#false} is VALID [2022-04-28 03:58:35,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {21457#false} assume !false; {21457#false} is VALID [2022-04-28 03:58:35,638 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:58:35,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:58:35,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114495510] [2022-04-28 03:58:35,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114495510] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:58:35,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460093011] [2022-04-28 03:58:35,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:58:35,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:58:35,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:58:35,639 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:58:35,640 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:58:35,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:35,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:58:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:35,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:58:36,001 INFO L272 TraceCheckUtils]: 0: Hoare triple {21456#true} call ULTIMATE.init(); {21456#true} is VALID [2022-04-28 03:58:36,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {21456#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(17, 2);call #Ultimate.allocInit(12, 3); {21456#true} is VALID [2022-04-28 03:58:36,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {21456#true} assume true; {21456#true} is VALID [2022-04-28 03:58:36,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21456#true} {21456#true} #41#return; {21456#true} is VALID [2022-04-28 03:58:36,002 INFO L272 TraceCheckUtils]: 4: Hoare triple {21456#true} call #t~ret4 := main(); {21456#true} is VALID [2022-04-28 03:58:36,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {21456#true} ~x~0 := 0;~y~0 := 500000; {21486#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:58:36,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {21486#(and (<= main_~x~0 0) (= main_~y~0 500000))} [205] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1538 v_main_~x~0_1537))) (or .cse0 (and (< v_main_~x~0_1538 v_main_~x~0_1537) (< v_main_~x~0_1537 500001)) (and .cse0 (not (< v_main_~x~0_1538 500000))))) InVars {main_~x~0=v_main_~x~0_1538} OutVars{main_~x~0=v_main_~x~0_1537} AuxVars[] AssignedVars[main_~x~0] {21490#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:58:36,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {21490#(and (= main_~y~0 500000) (< main_~x~0 500001))} [206] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21490#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:58:36,004 INFO L290 TraceCheckUtils]: 8: Hoare triple {21490#(and (= main_~y~0 500000) (< main_~x~0 500001))} [207] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_1138 v_main_~y~0_1137)) (.cse2 (<= 500000 v_main_~x~0_1540))) (or (and .cse0 (= v_main_~x~0_1540 v_main_~x~0_1539)) (let ((.cse1 (+ v_main_~x~0_1540 v_main_~y~0_1137))) (and (< .cse1 (+ 1000001 v_main_~y~0_1138)) .cse2 (< v_main_~y~0_1138 v_main_~y~0_1137) (= (+ v_main_~x~0_1539 v_main_~y~0_1138) .cse1))) (and .cse0 (= v_main_~x~0_1539 v_main_~x~0_1540) (or (not .cse2) (not (< v_main_~x~0_1540 1000000)))))) InVars {main_~x~0=v_main_~x~0_1540, main_~y~0=v_main_~y~0_1138} OutVars{main_~x~0=v_main_~x~0_1539, main_~y~0=v_main_~y~0_1137} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {21497#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:58:36,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {21497#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [204] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {21501#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:58:36,005 INFO L272 TraceCheckUtils]: 10: Hoare triple {21501#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {21505#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:58:36,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {21505#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21509#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:58:36,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {21509#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21457#false} is VALID [2022-04-28 03:58:36,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {21457#false} assume !false; {21457#false} is VALID [2022-04-28 03:58:36,006 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:58:36,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:58:36,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {21457#false} assume !false; {21457#false} is VALID [2022-04-28 03:58:36,312 INFO L290 TraceCheckUtils]: 12: Hoare triple {21509#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21457#false} is VALID [2022-04-28 03:58:36,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {21505#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21509#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:58:36,313 INFO L272 TraceCheckUtils]: 10: Hoare triple {21464#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {21505#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:58:36,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {21528#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [204] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {21464#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:58:36,314 INFO L290 TraceCheckUtils]: 8: Hoare triple {21532#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [207] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_1138 v_main_~y~0_1137)) (.cse2 (<= 500000 v_main_~x~0_1540))) (or (and .cse0 (= v_main_~x~0_1540 v_main_~x~0_1539)) (let ((.cse1 (+ v_main_~x~0_1540 v_main_~y~0_1137))) (and (< .cse1 (+ 1000001 v_main_~y~0_1138)) .cse2 (< v_main_~y~0_1138 v_main_~y~0_1137) (= (+ v_main_~x~0_1539 v_main_~y~0_1138) .cse1))) (and .cse0 (= v_main_~x~0_1539 v_main_~x~0_1540) (or (not .cse2) (not (< v_main_~x~0_1540 1000000)))))) InVars {main_~x~0=v_main_~x~0_1540, main_~y~0=v_main_~y~0_1138} OutVars{main_~x~0=v_main_~x~0_1539, main_~y~0=v_main_~y~0_1137} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {21528#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:58:36,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {21532#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [206] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21532#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:58:36,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {21539#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [205] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1538 v_main_~x~0_1537))) (or .cse0 (and (< v_main_~x~0_1538 v_main_~x~0_1537) (< v_main_~x~0_1537 500001)) (and .cse0 (not (< v_main_~x~0_1538 500000))))) InVars {main_~x~0=v_main_~x~0_1538} OutVars{main_~x~0=v_main_~x~0_1537} AuxVars[] AssignedVars[main_~x~0] {21532#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:58:36,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {21456#true} ~x~0 := 0;~y~0 := 500000; {21539#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:58:36,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {21456#true} call #t~ret4 := main(); {21456#true} is VALID [2022-04-28 03:58:36,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21456#true} {21456#true} #41#return; {21456#true} is VALID [2022-04-28 03:58:36,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {21456#true} assume true; {21456#true} is VALID [2022-04-28 03:58:36,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {21456#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(17, 2);call #Ultimate.allocInit(12, 3); {21456#true} is VALID [2022-04-28 03:58:36,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {21456#true} call ULTIMATE.init(); {21456#true} is VALID [2022-04-28 03:58:36,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:58:36,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460093011] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:58:36,316 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:58:36,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 03:58:38,079 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:58:38,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [330321604] [2022-04-28 03:58:38,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [330321604] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:58:38,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:58:38,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-04-28 03:58:38,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193710424] [2022-04-28 03:58:38,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:58:38,080 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.9361702127659575) internal successors, (91), 46 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:58:38,080 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:58:38,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 48 states, 47 states have (on average 1.9361702127659575) internal successors, (91), 46 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:58:38,145 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:58:38,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-28 03:58:38,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:58:38,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-28 03:58:38,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=418, Invalid=3122, Unknown=0, NotChecked=0, Total=3540 [2022-04-28 03:58:38,145 INFO L87 Difference]: Start difference. First operand 97 states and 100 transitions. Second operand has 48 states, 47 states have (on average 1.9361702127659575) internal successors, (91), 46 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:58:44,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:44,525 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2022-04-28 03:58:44,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-28 03:58:44,525 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.9361702127659575) internal successors, (91), 46 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:58:44,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:58:44,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.9361702127659575) internal successors, (91), 46 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:58:44,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 111 transitions. [2022-04-28 03:58:44,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.9361702127659575) internal successors, (91), 46 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:58:44,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 111 transitions. [2022-04-28 03:58:44,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 111 transitions. [2022-04-28 03:58:44,614 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:58:44,614 INFO L225 Difference]: With dead ends: 106 [2022-04-28 03:58:44,614 INFO L226 Difference]: Without dead ends: 99 [2022-04-28 03:58:44,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2137 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=889, Invalid=9617, Unknown=0, NotChecked=0, Total=10506 [2022-04-28 03:58:44,615 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 91 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 3663 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 3752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 3663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:58:44,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 58 Invalid, 3752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 3663 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-28 03:58:44,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-28 03:58:44,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-04-28 03:58:44,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:58:44,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 99 states, 94 states have (on average 1.0425531914893618) internal successors, (98), 94 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:44,865 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 99 states, 94 states have (on average 1.0425531914893618) internal successors, (98), 94 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:44,866 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 99 states, 94 states have (on average 1.0425531914893618) internal successors, (98), 94 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:44,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:44,866 INFO L93 Difference]: Finished difference Result 99 states and 102 transitions. [2022-04-28 03:58:44,867 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2022-04-28 03:58:44,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:58:44,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:58:44,867 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 94 states have (on average 1.0425531914893618) internal successors, (98), 94 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 99 states. [2022-04-28 03:58:44,867 INFO L87 Difference]: Start difference. First operand has 99 states, 94 states have (on average 1.0425531914893618) internal successors, (98), 94 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 99 states. [2022-04-28 03:58:44,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:44,868 INFO L93 Difference]: Finished difference Result 99 states and 102 transitions. [2022-04-28 03:58:44,868 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2022-04-28 03:58:44,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:58:44,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:58:44,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:58:44,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:58:44,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.0425531914893618) internal successors, (98), 94 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:44,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 102 transitions. [2022-04-28 03:58:44,869 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 102 transitions. Word has length 95 [2022-04-28 03:58:44,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:58:44,869 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 102 transitions. [2022-04-28 03:58:44,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 1.9361702127659575) internal successors, (91), 46 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:58:44,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 102 transitions. [2022-04-28 03:58:44,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:58:44,957 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2022-04-28 03:58:44,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-28 03:58:44,958 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:58:44,958 INFO L195 NwaCegarLoop]: trace histogram [43, 41, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:58:44,973 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:58:45,158 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:58:45,158 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:58:45,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:58:45,159 INFO L85 PathProgramCache]: Analyzing trace with hash 810522896, now seen corresponding path program 41 times [2022-04-28 03:58:45,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:58:45,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [737909509] [2022-04-28 03:58:45,241 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:58:49,354 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:58:49,452 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:58:49,453 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:58:49,455 INFO L85 PathProgramCache]: Analyzing trace with hash 980579247, now seen corresponding path program 1 times [2022-04-28 03:58:49,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:58:49,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622928259] [2022-04-28 03:58:49,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:58:49,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:58:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:49,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:58:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:49,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {22307#(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(17, 2);call #Ultimate.allocInit(12, 3); {22296#true} is VALID [2022-04-28 03:58:49,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {22296#true} assume true; {22296#true} is VALID [2022-04-28 03:58:49,548 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22296#true} {22296#true} #41#return; {22296#true} is VALID [2022-04-28 03:58:49,549 INFO L272 TraceCheckUtils]: 0: Hoare triple {22296#true} call ULTIMATE.init(); {22307#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:58:49,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {22307#(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(17, 2);call #Ultimate.allocInit(12, 3); {22296#true} is VALID [2022-04-28 03:58:49,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {22296#true} assume true; {22296#true} is VALID [2022-04-28 03:58:49,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22296#true} {22296#true} #41#return; {22296#true} is VALID [2022-04-28 03:58:49,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {22296#true} call #t~ret4 := main(); {22296#true} is VALID [2022-04-28 03:58:49,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {22296#true} ~x~0 := 0;~y~0 := 500000; {22301#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:58:49,550 INFO L290 TraceCheckUtils]: 6: Hoare triple {22301#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [209] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1597 v_main_~x~0_1596))) (or (and .cse0 (not (< v_main_~x~0_1597 500000))) .cse0 (and (< v_main_~x~0_1597 v_main_~x~0_1596) (< v_main_~x~0_1596 500001)))) InVars {main_~x~0=v_main_~x~0_1597} OutVars{main_~x~0=v_main_~x~0_1596} AuxVars[] AssignedVars[main_~x~0] {22302#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:58:49,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {22302#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [210] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22302#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:58:49,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {22302#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [211] L11-2-->L10-2_primed: Formula: (let ((.cse3 (<= 500000 v_main_~x~0_1599)) (.cse0 (= v_main_~x~0_1599 v_main_~x~0_1598)) (.cse1 (= v_main_~y~0_1187 v_main_~y~0_1186))) (or (and .cse0 .cse1) (let ((.cse2 (+ v_main_~x~0_1599 v_main_~y~0_1186))) (and (= (+ v_main_~x~0_1598 v_main_~y~0_1187) .cse2) (< v_main_~y~0_1187 v_main_~y~0_1186) (< .cse2 (+ 1000001 v_main_~y~0_1187)) .cse3)) (and (or (not .cse3) (not (< v_main_~x~0_1599 1000000))) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1599, main_~y~0=v_main_~y~0_1187} OutVars{main_~x~0=v_main_~x~0_1598, main_~y~0=v_main_~y~0_1186} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {22303#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} is VALID [2022-04-28 03:58:49,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {22303#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} [208] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {22304#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:58:49,552 INFO L272 TraceCheckUtils]: 10: Hoare triple {22304#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {22305#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:58:49,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {22305#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {22306#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:58:49,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {22306#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {22297#false} is VALID [2022-04-28 03:58:49,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {22297#false} assume !false; {22297#false} is VALID [2022-04-28 03:58:49,553 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:58:49,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:58:49,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622928259] [2022-04-28 03:58:49,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622928259] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:58:49,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276778614] [2022-04-28 03:58:49,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:58:49,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:58:49,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:58:49,555 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:58:49,564 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:58:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:49,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:58:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:49,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:58:49,914 INFO L272 TraceCheckUtils]: 0: Hoare triple {22296#true} call ULTIMATE.init(); {22296#true} is VALID [2022-04-28 03:58:49,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {22296#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(17, 2);call #Ultimate.allocInit(12, 3); {22296#true} is VALID [2022-04-28 03:58:49,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {22296#true} assume true; {22296#true} is VALID [2022-04-28 03:58:49,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22296#true} {22296#true} #41#return; {22296#true} is VALID [2022-04-28 03:58:49,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {22296#true} call #t~ret4 := main(); {22296#true} is VALID [2022-04-28 03:58:49,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {22296#true} ~x~0 := 0;~y~0 := 500000; {22326#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:58:49,915 INFO L290 TraceCheckUtils]: 6: Hoare triple {22326#(and (<= main_~x~0 0) (= main_~y~0 500000))} [209] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1597 v_main_~x~0_1596))) (or (and .cse0 (not (< v_main_~x~0_1597 500000))) .cse0 (and (< v_main_~x~0_1597 v_main_~x~0_1596) (< v_main_~x~0_1596 500001)))) InVars {main_~x~0=v_main_~x~0_1597} OutVars{main_~x~0=v_main_~x~0_1596} AuxVars[] AssignedVars[main_~x~0] {22330#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:58:49,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {22330#(and (= main_~y~0 500000) (< main_~x~0 500001))} [210] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22330#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:58:49,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {22330#(and (= main_~y~0 500000) (< main_~x~0 500001))} [211] L11-2-->L10-2_primed: Formula: (let ((.cse3 (<= 500000 v_main_~x~0_1599)) (.cse0 (= v_main_~x~0_1599 v_main_~x~0_1598)) (.cse1 (= v_main_~y~0_1187 v_main_~y~0_1186))) (or (and .cse0 .cse1) (let ((.cse2 (+ v_main_~x~0_1599 v_main_~y~0_1186))) (and (= (+ v_main_~x~0_1598 v_main_~y~0_1187) .cse2) (< v_main_~y~0_1187 v_main_~y~0_1186) (< .cse2 (+ 1000001 v_main_~y~0_1187)) .cse3)) (and (or (not .cse3) (not (< v_main_~x~0_1599 1000000))) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1599, main_~y~0=v_main_~y~0_1187} OutVars{main_~x~0=v_main_~x~0_1598, main_~y~0=v_main_~y~0_1186} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {22337#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:58:49,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {22337#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [208] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {22341#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:58:49,917 INFO L272 TraceCheckUtils]: 10: Hoare triple {22341#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {22345#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:58:49,918 INFO L290 TraceCheckUtils]: 11: Hoare triple {22345#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22349#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:58:49,918 INFO L290 TraceCheckUtils]: 12: Hoare triple {22349#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22297#false} is VALID [2022-04-28 03:58:49,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {22297#false} assume !false; {22297#false} is VALID [2022-04-28 03:58:49,918 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:58:49,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:58:50,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {22297#false} assume !false; {22297#false} is VALID [2022-04-28 03:58:50,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {22349#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22297#false} is VALID [2022-04-28 03:58:50,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {22345#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22349#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:58:50,231 INFO L272 TraceCheckUtils]: 10: Hoare triple {22304#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {22345#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:58:50,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {22368#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [208] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {22304#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:58:50,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {22372#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [211] L11-2-->L10-2_primed: Formula: (let ((.cse3 (<= 500000 v_main_~x~0_1599)) (.cse0 (= v_main_~x~0_1599 v_main_~x~0_1598)) (.cse1 (= v_main_~y~0_1187 v_main_~y~0_1186))) (or (and .cse0 .cse1) (let ((.cse2 (+ v_main_~x~0_1599 v_main_~y~0_1186))) (and (= (+ v_main_~x~0_1598 v_main_~y~0_1187) .cse2) (< v_main_~y~0_1187 v_main_~y~0_1186) (< .cse2 (+ 1000001 v_main_~y~0_1187)) .cse3)) (and (or (not .cse3) (not (< v_main_~x~0_1599 1000000))) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1599, main_~y~0=v_main_~y~0_1187} OutVars{main_~x~0=v_main_~x~0_1598, main_~y~0=v_main_~y~0_1186} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {22368#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:58:50,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {22372#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [210] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22372#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:58:50,233 INFO L290 TraceCheckUtils]: 6: Hoare triple {22379#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [209] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1597 v_main_~x~0_1596))) (or (and .cse0 (not (< v_main_~x~0_1597 500000))) .cse0 (and (< v_main_~x~0_1597 v_main_~x~0_1596) (< v_main_~x~0_1596 500001)))) InVars {main_~x~0=v_main_~x~0_1597} OutVars{main_~x~0=v_main_~x~0_1596} AuxVars[] AssignedVars[main_~x~0] {22372#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:58:50,233 INFO L290 TraceCheckUtils]: 5: Hoare triple {22296#true} ~x~0 := 0;~y~0 := 500000; {22379#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:58:50,233 INFO L272 TraceCheckUtils]: 4: Hoare triple {22296#true} call #t~ret4 := main(); {22296#true} is VALID [2022-04-28 03:58:50,233 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22296#true} {22296#true} #41#return; {22296#true} is VALID [2022-04-28 03:58:50,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {22296#true} assume true; {22296#true} is VALID [2022-04-28 03:58:50,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {22296#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(17, 2);call #Ultimate.allocInit(12, 3); {22296#true} is VALID [2022-04-28 03:58:50,234 INFO L272 TraceCheckUtils]: 0: Hoare triple {22296#true} call ULTIMATE.init(); {22296#true} is VALID [2022-04-28 03:58:50,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:58:50,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276778614] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:58:50,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:58:50,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 03:58:52,066 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:58:52,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [737909509] [2022-04-28 03:58:52,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [737909509] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:58:52,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:58:52,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-04-28 03:58:52,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452248793] [2022-04-28 03:58:52,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:58:52,067 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 1.9375) internal successors, (93), 47 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:58:52,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:58:52,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 49 states, 48 states have (on average 1.9375) internal successors, (93), 47 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:58:52,134 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:58:52,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-04-28 03:58:52,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:58:52,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-04-28 03:58:52,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=426, Invalid=3234, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 03:58:52,135 INFO L87 Difference]: Start difference. First operand 99 states and 102 transitions. Second operand has 49 states, 48 states have (on average 1.9375) internal successors, (93), 47 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:58:58,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:58,990 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2022-04-28 03:58:58,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-28 03:58:58,991 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 1.9375) internal successors, (93), 47 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:58:58,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:58:58,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.9375) internal successors, (93), 47 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:58:58,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 113 transitions. [2022-04-28 03:58:58,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.9375) internal successors, (93), 47 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:58:58,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 113 transitions. [2022-04-28 03:58:58,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 113 transitions. [2022-04-28 03:58:59,080 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:58:59,081 INFO L225 Difference]: With dead ends: 108 [2022-04-28 03:58:59,081 INFO L226 Difference]: Without dead ends: 101 [2022-04-28 03:58:59,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2207 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=908, Invalid=10012, Unknown=0, NotChecked=0, Total=10920 [2022-04-28 03:58:59,082 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 93 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 3878 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 3969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 3878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:58:59,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 78 Invalid, 3969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 3878 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-04-28 03:58:59,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-28 03:58:59,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-04-28 03:58:59,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:58:59,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 101 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 96 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:59,344 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 101 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 96 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:59,345 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 101 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 96 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:59,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:59,345 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions. [2022-04-28 03:58:59,345 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2022-04-28 03:58:59,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:58:59,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:58:59,346 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 96 states have internal predecessors, (100), 3 states have call successors, (3), 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:58:59,346 INFO L87 Difference]: Start difference. First operand has 101 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 96 states have internal predecessors, (100), 3 states have call successors, (3), 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:58:59,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:59,347 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions. [2022-04-28 03:58:59,347 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2022-04-28 03:58:59,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:58:59,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:58:59,347 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:58:59,347 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:58:59,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 96 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:59,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions. [2022-04-28 03:58:59,348 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 104 transitions. Word has length 97 [2022-04-28 03:58:59,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:58:59,348 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 104 transitions. [2022-04-28 03:58:59,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 1.9375) internal successors, (93), 47 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:58:59,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 104 transitions. [2022-04-28 03:58:59,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:58:59,437 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2022-04-28 03:58:59,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-28 03:58:59,438 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:58:59,438 INFO L195 NwaCegarLoop]: trace histogram [44, 42, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:58:59,453 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:58:59,645 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:58:59,645 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:58:59,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:58:59,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1759855339, now seen corresponding path program 42 times [2022-04-28 03:58:59,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:58:59,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [663366850] [2022-04-28 03:58:59,739 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:59:03,853 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:59:03,976 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:59:03,978 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:59:03,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1264855889, now seen corresponding path program 1 times [2022-04-28 03:59:03,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:59:03,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88722089] [2022-04-28 03:59:03,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:59:03,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:59:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:59:04,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:59:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:59:04,069 INFO L290 TraceCheckUtils]: 0: Hoare triple {23162#(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(17, 2);call #Ultimate.allocInit(12, 3); {23151#true} is VALID [2022-04-28 03:59:04,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {23151#true} assume true; {23151#true} is VALID [2022-04-28 03:59:04,069 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23151#true} {23151#true} #41#return; {23151#true} is VALID [2022-04-28 03:59:04,070 INFO L272 TraceCheckUtils]: 0: Hoare triple {23151#true} call ULTIMATE.init(); {23162#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:59:04,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {23162#(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(17, 2);call #Ultimate.allocInit(12, 3); {23151#true} is VALID [2022-04-28 03:59:04,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {23151#true} assume true; {23151#true} is VALID [2022-04-28 03:59:04,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23151#true} {23151#true} #41#return; {23151#true} is VALID [2022-04-28 03:59:04,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {23151#true} call #t~ret4 := main(); {23151#true} is VALID [2022-04-28 03:59:04,070 INFO L290 TraceCheckUtils]: 5: Hoare triple {23151#true} ~x~0 := 0;~y~0 := 500000; {23156#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:59:04,078 INFO L290 TraceCheckUtils]: 6: Hoare triple {23156#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [213] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1657 v_main_~x~0_1656))) (or (and (<= 500000 v_main_~x~0_1657) .cse0) (and (< v_main_~x~0_1656 500001) (< v_main_~x~0_1657 v_main_~x~0_1656)) .cse0)) InVars {main_~x~0=v_main_~x~0_1657} OutVars{main_~x~0=v_main_~x~0_1656} AuxVars[] AssignedVars[main_~x~0] {23157#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:59:04,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {23157#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [214] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23157#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:59:04,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {23157#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [215] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_1659 v_main_~x~0_1658)) (.cse2 (= v_main_~y~0_1237 v_main_~y~0_1236)) (.cse0 (<= 500000 v_main_~x~0_1659))) (or (and (< v_main_~x~0_1658 1000001) (= (+ v_main_~x~0_1659 v_main_~y~0_1236) (+ v_main_~x~0_1658 v_main_~y~0_1237)) (< v_main_~x~0_1659 v_main_~x~0_1658) .cse0) (and .cse1 .cse2) (and .cse1 .cse2 (or (not (< v_main_~x~0_1659 1000000)) (not .cse0))))) InVars {main_~x~0=v_main_~x~0_1659, main_~y~0=v_main_~y~0_1237} OutVars{main_~x~0=v_main_~x~0_1658, main_~y~0=v_main_~y~0_1236} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {23158#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:59:04,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {23158#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [212] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {23159#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-28 03:59:04,081 INFO L272 TraceCheckUtils]: 10: Hoare triple {23159#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {23160#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:59:04,081 INFO L290 TraceCheckUtils]: 11: Hoare triple {23160#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {23161#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:59:04,081 INFO L290 TraceCheckUtils]: 12: Hoare triple {23161#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {23152#false} is VALID [2022-04-28 03:59:04,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {23152#false} assume !false; {23152#false} is VALID [2022-04-28 03:59:04,082 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:59:04,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:59:04,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88722089] [2022-04-28 03:59:04,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88722089] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:59:04,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147151263] [2022-04-28 03:59:04,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:59:04,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:59:04,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:59:04,083 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:59:04,085 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:59:04,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:59:04,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:59:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:59:04,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:59:04,465 INFO L272 TraceCheckUtils]: 0: Hoare triple {23151#true} call ULTIMATE.init(); {23151#true} is VALID [2022-04-28 03:59:04,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {23151#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(17, 2);call #Ultimate.allocInit(12, 3); {23151#true} is VALID [2022-04-28 03:59:04,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {23151#true} assume true; {23151#true} is VALID [2022-04-28 03:59:04,465 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23151#true} {23151#true} #41#return; {23151#true} is VALID [2022-04-28 03:59:04,465 INFO L272 TraceCheckUtils]: 4: Hoare triple {23151#true} call #t~ret4 := main(); {23151#true} is VALID [2022-04-28 03:59:04,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {23151#true} ~x~0 := 0;~y~0 := 500000; {23181#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:59:04,466 INFO L290 TraceCheckUtils]: 6: Hoare triple {23181#(and (<= main_~x~0 0) (= main_~y~0 500000))} [213] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1657 v_main_~x~0_1656))) (or (and (<= 500000 v_main_~x~0_1657) .cse0) (and (< v_main_~x~0_1656 500001) (< v_main_~x~0_1657 v_main_~x~0_1656)) .cse0)) InVars {main_~x~0=v_main_~x~0_1657} OutVars{main_~x~0=v_main_~x~0_1656} AuxVars[] AssignedVars[main_~x~0] {23185#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:59:04,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {23185#(and (= main_~y~0 500000) (< main_~x~0 500001))} [214] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23185#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:59:04,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {23185#(and (= main_~y~0 500000) (< main_~x~0 500001))} [215] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_1659 v_main_~x~0_1658)) (.cse2 (= v_main_~y~0_1237 v_main_~y~0_1236)) (.cse0 (<= 500000 v_main_~x~0_1659))) (or (and (< v_main_~x~0_1658 1000001) (= (+ v_main_~x~0_1659 v_main_~y~0_1236) (+ v_main_~x~0_1658 v_main_~y~0_1237)) (< v_main_~x~0_1659 v_main_~x~0_1658) .cse0) (and .cse1 .cse2) (and .cse1 .cse2 (or (not (< v_main_~x~0_1659 1000000)) (not .cse0))))) InVars {main_~x~0=v_main_~x~0_1659, main_~y~0=v_main_~y~0_1237} OutVars{main_~x~0=v_main_~x~0_1658, main_~y~0=v_main_~y~0_1236} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {23192#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:59:04,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {23192#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [212] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {23196#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:59:04,468 INFO L272 TraceCheckUtils]: 10: Hoare triple {23196#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {23200#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:59:04,469 INFO L290 TraceCheckUtils]: 11: Hoare triple {23200#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {23204#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:59:04,469 INFO L290 TraceCheckUtils]: 12: Hoare triple {23204#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {23152#false} is VALID [2022-04-28 03:59:04,469 INFO L290 TraceCheckUtils]: 13: Hoare triple {23152#false} assume !false; {23152#false} is VALID [2022-04-28 03:59:04,469 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:59:04,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:59:04,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {23152#false} assume !false; {23152#false} is VALID [2022-04-28 03:59:04,768 INFO L290 TraceCheckUtils]: 12: Hoare triple {23204#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {23152#false} is VALID [2022-04-28 03:59:04,768 INFO L290 TraceCheckUtils]: 11: Hoare triple {23200#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {23204#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:59:04,769 INFO L272 TraceCheckUtils]: 10: Hoare triple {23159#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {23200#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:59:04,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {23223#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [212] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {23159#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-28 03:59:04,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {23227#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [215] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_1659 v_main_~x~0_1658)) (.cse2 (= v_main_~y~0_1237 v_main_~y~0_1236)) (.cse0 (<= 500000 v_main_~x~0_1659))) (or (and (< v_main_~x~0_1658 1000001) (= (+ v_main_~x~0_1659 v_main_~y~0_1236) (+ v_main_~x~0_1658 v_main_~y~0_1237)) (< v_main_~x~0_1659 v_main_~x~0_1658) .cse0) (and .cse1 .cse2) (and .cse1 .cse2 (or (not (< v_main_~x~0_1659 1000000)) (not .cse0))))) InVars {main_~x~0=v_main_~x~0_1659, main_~y~0=v_main_~y~0_1237} OutVars{main_~x~0=v_main_~x~0_1658, main_~y~0=v_main_~y~0_1236} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {23223#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:59:04,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {23227#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [214] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23227#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:59:04,771 INFO L290 TraceCheckUtils]: 6: Hoare triple {23234#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))))} [213] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1657 v_main_~x~0_1656))) (or (and (<= 500000 v_main_~x~0_1657) .cse0) (and (< v_main_~x~0_1656 500001) (< v_main_~x~0_1657 v_main_~x~0_1656)) .cse0)) InVars {main_~x~0=v_main_~x~0_1657} OutVars{main_~x~0=v_main_~x~0_1656} AuxVars[] AssignedVars[main_~x~0] {23227#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 03:59:04,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {23151#true} ~x~0 := 0;~y~0 := 500000; {23234#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))))} is VALID [2022-04-28 03:59:04,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {23151#true} call #t~ret4 := main(); {23151#true} is VALID [2022-04-28 03:59:04,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23151#true} {23151#true} #41#return; {23151#true} is VALID [2022-04-28 03:59:04,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {23151#true} assume true; {23151#true} is VALID [2022-04-28 03:59:04,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {23151#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(17, 2);call #Ultimate.allocInit(12, 3); {23151#true} is VALID [2022-04-28 03:59:04,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {23151#true} call ULTIMATE.init(); {23151#true} is VALID [2022-04-28 03:59:04,772 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:59:04,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147151263] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:59:04,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:59:04,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 03:59:06,685 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:59:06,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [663366850] [2022-04-28 03:59:06,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [663366850] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:59:06,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:59:06,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2022-04-28 03:59:06,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202426133] [2022-04-28 03:59:06,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:59:06,686 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 48 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:59:06,686 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:59:06,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 48 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:59:06,754 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:59:06,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-28 03:59:06,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:59:06,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-28 03:59:06,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=434, Invalid=3348, Unknown=0, NotChecked=0, Total=3782 [2022-04-28 03:59:06,755 INFO L87 Difference]: Start difference. First operand 101 states and 104 transitions. Second operand has 50 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 48 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:59:14,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:59:14,188 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2022-04-28 03:59:14,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-28 03:59:14,188 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 48 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:59:14,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:59:14,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 48 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:59:14,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 115 transitions. [2022-04-28 03:59:14,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 48 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:59:14,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 115 transitions. [2022-04-28 03:59:14,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 115 transitions. [2022-04-28 03:59:14,280 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:59:14,281 INFO L225 Difference]: With dead ends: 110 [2022-04-28 03:59:14,281 INFO L226 Difference]: Without dead ends: 103 [2022-04-28 03:59:14,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2278 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=927, Invalid=10415, Unknown=0, NotChecked=0, Total=11342 [2022-04-28 03:59:14,282 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 95 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 4215 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 4308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 4215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:59:14,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 188 Invalid, 4308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 4215 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-28 03:59:14,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-28 03:59:14,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-04-28 03:59:14,545 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:59:14,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 103 states, 98 states have (on average 1.0408163265306123) internal successors, (102), 98 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:59:14,546 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 103 states, 98 states have (on average 1.0408163265306123) internal successors, (102), 98 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:59:14,546 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 103 states, 98 states have (on average 1.0408163265306123) internal successors, (102), 98 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:59:14,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:59:14,547 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2022-04-28 03:59:14,547 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 106 transitions. [2022-04-28 03:59:14,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:59:14,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:59:14,547 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 98 states have (on average 1.0408163265306123) internal successors, (102), 98 states have internal predecessors, (102), 3 states have call successors, (3), 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:59:14,547 INFO L87 Difference]: Start difference. First operand has 103 states, 98 states have (on average 1.0408163265306123) internal successors, (102), 98 states have internal predecessors, (102), 3 states have call successors, (3), 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:59:14,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:59:14,548 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2022-04-28 03:59:14,548 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 106 transitions. [2022-04-28 03:59:14,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:59:14,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:59:14,548 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:59:14,548 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:59:14,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.0408163265306123) internal successors, (102), 98 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:59:14,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 106 transitions. [2022-04-28 03:59:14,549 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 106 transitions. Word has length 99 [2022-04-28 03:59:14,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:59:14,549 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 106 transitions. [2022-04-28 03:59:14,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 48 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:59:14,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 106 transitions. [2022-04-28 03:59:14,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:59:14,638 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 106 transitions. [2022-04-28 03:59:14,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-28 03:59:14,638 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:59:14,638 INFO L195 NwaCegarLoop]: trace histogram [45, 43, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:59:14,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-04-28 03:59:14,839 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:59:14,839 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:59:14,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:59:14,839 INFO L85 PathProgramCache]: Analyzing trace with hash -759700986, now seen corresponding path program 43 times [2022-04-28 03:59:14,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:59:14,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [778390915] [2022-04-28 03:59:18,910 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:59:18,952 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:59:19,136 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:59:19,137 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:59:19,139 INFO L85 PathProgramCache]: Analyzing trace with hash 784676271, now seen corresponding path program 1 times [2022-04-28 03:59:19,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:59:19,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599259080] [2022-04-28 03:59:19,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:59:19,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:59:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:59:19,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:59:19,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:59:19,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {24032#(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(17, 2);call #Ultimate.allocInit(12, 3); {24021#true} is VALID [2022-04-28 03:59:19,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {24021#true} assume true; {24021#true} is VALID [2022-04-28 03:59:19,231 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24021#true} {24021#true} #41#return; {24021#true} is VALID [2022-04-28 03:59:19,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {24021#true} call ULTIMATE.init(); {24032#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:59:19,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {24032#(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(17, 2);call #Ultimate.allocInit(12, 3); {24021#true} is VALID [2022-04-28 03:59:19,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {24021#true} assume true; {24021#true} is VALID [2022-04-28 03:59:19,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24021#true} {24021#true} #41#return; {24021#true} is VALID [2022-04-28 03:59:19,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {24021#true} call #t~ret4 := main(); {24021#true} is VALID [2022-04-28 03:59:19,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {24021#true} ~x~0 := 0;~y~0 := 500000; {24026#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:59:19,232 INFO L290 TraceCheckUtils]: 6: Hoare triple {24026#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [217] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1718 v_main_~x~0_1717))) (or .cse0 (and .cse0 (<= 500000 v_main_~x~0_1718)) (and (< v_main_~x~0_1717 500001) (< v_main_~x~0_1718 v_main_~x~0_1717)))) InVars {main_~x~0=v_main_~x~0_1718} OutVars{main_~x~0=v_main_~x~0_1717} AuxVars[] AssignedVars[main_~x~0] {24027#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:59:19,233 INFO L290 TraceCheckUtils]: 7: Hoare triple {24027#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [218] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24027#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:59:19,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {24027#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [219] L11-2-->L10-2_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_1720)) (.cse0 (= v_main_~y~0_1288 v_main_~y~0_1287))) (or (and (= v_main_~x~0_1720 v_main_~x~0_1719) .cse0) (let ((.cse1 (+ v_main_~x~0_1720 v_main_~y~0_1287))) (and (< v_main_~y~0_1288 v_main_~y~0_1287) (< .cse1 (+ 1000001 v_main_~y~0_1288)) .cse2 (= .cse1 (+ v_main_~x~0_1719 v_main_~y~0_1288)))) (and (or (not .cse2) (not (< v_main_~x~0_1720 1000000))) (= v_main_~x~0_1719 v_main_~x~0_1720) .cse0))) InVars {main_~x~0=v_main_~x~0_1720, main_~y~0=v_main_~y~0_1288} OutVars{main_~x~0=v_main_~x~0_1719, main_~y~0=v_main_~y~0_1287} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {24028#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:59:19,234 INFO L290 TraceCheckUtils]: 9: Hoare triple {24028#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [216] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {24029#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:59:19,234 INFO L272 TraceCheckUtils]: 10: Hoare triple {24029#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {24030#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:59:19,235 INFO L290 TraceCheckUtils]: 11: Hoare triple {24030#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {24031#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:59:19,235 INFO L290 TraceCheckUtils]: 12: Hoare triple {24031#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {24022#false} is VALID [2022-04-28 03:59:19,235 INFO L290 TraceCheckUtils]: 13: Hoare triple {24022#false} assume !false; {24022#false} is VALID [2022-04-28 03:59:19,235 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:59:19,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:59:19,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599259080] [2022-04-28 03:59:19,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599259080] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:59:19,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934270437] [2022-04-28 03:59:19,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:59:19,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:59:19,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:59:19,237 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:59:19,239 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:59:19,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:59:19,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:59:19,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:59:19,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:59:19,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {24021#true} call ULTIMATE.init(); {24021#true} is VALID [2022-04-28 03:59:19,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {24021#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(17, 2);call #Ultimate.allocInit(12, 3); {24021#true} is VALID [2022-04-28 03:59:19,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {24021#true} assume true; {24021#true} is VALID [2022-04-28 03:59:19,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24021#true} {24021#true} #41#return; {24021#true} is VALID [2022-04-28 03:59:19,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {24021#true} call #t~ret4 := main(); {24021#true} is VALID [2022-04-28 03:59:19,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {24021#true} ~x~0 := 0;~y~0 := 500000; {24051#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:59:19,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {24051#(and (<= main_~x~0 0) (= main_~y~0 500000))} [217] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1718 v_main_~x~0_1717))) (or .cse0 (and .cse0 (<= 500000 v_main_~x~0_1718)) (and (< v_main_~x~0_1717 500001) (< v_main_~x~0_1718 v_main_~x~0_1717)))) InVars {main_~x~0=v_main_~x~0_1718} OutVars{main_~x~0=v_main_~x~0_1717} AuxVars[] AssignedVars[main_~x~0] {24055#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:59:19,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {24055#(and (= main_~y~0 500000) (< main_~x~0 500001))} [218] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24055#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:59:19,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {24055#(and (= main_~y~0 500000) (< main_~x~0 500001))} [219] L11-2-->L10-2_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_1720)) (.cse0 (= v_main_~y~0_1288 v_main_~y~0_1287))) (or (and (= v_main_~x~0_1720 v_main_~x~0_1719) .cse0) (let ((.cse1 (+ v_main_~x~0_1720 v_main_~y~0_1287))) (and (< v_main_~y~0_1288 v_main_~y~0_1287) (< .cse1 (+ 1000001 v_main_~y~0_1288)) .cse2 (= .cse1 (+ v_main_~x~0_1719 v_main_~y~0_1288)))) (and (or (not .cse2) (not (< v_main_~x~0_1720 1000000))) (= v_main_~x~0_1719 v_main_~x~0_1720) .cse0))) InVars {main_~x~0=v_main_~x~0_1720, main_~y~0=v_main_~y~0_1288} OutVars{main_~x~0=v_main_~x~0_1719, main_~y~0=v_main_~y~0_1287} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {24062#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:59:19,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {24062#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [216] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {24066#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:59:19,628 INFO L272 TraceCheckUtils]: 10: Hoare triple {24066#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {24070#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:59:19,629 INFO L290 TraceCheckUtils]: 11: Hoare triple {24070#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {24074#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:59:19,629 INFO L290 TraceCheckUtils]: 12: Hoare triple {24074#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24022#false} is VALID [2022-04-28 03:59:19,629 INFO L290 TraceCheckUtils]: 13: Hoare triple {24022#false} assume !false; {24022#false} is VALID [2022-04-28 03:59:19,629 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:59:19,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:59:19,951 INFO L290 TraceCheckUtils]: 13: Hoare triple {24022#false} assume !false; {24022#false} is VALID [2022-04-28 03:59:19,952 INFO L290 TraceCheckUtils]: 12: Hoare triple {24074#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24022#false} is VALID [2022-04-28 03:59:19,952 INFO L290 TraceCheckUtils]: 11: Hoare triple {24070#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {24074#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:59:19,953 INFO L272 TraceCheckUtils]: 10: Hoare triple {24029#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {24070#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:59:19,953 INFO L290 TraceCheckUtils]: 9: Hoare triple {24028#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [216] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {24029#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:59:19,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {24096#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [219] L11-2-->L10-2_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_1720)) (.cse0 (= v_main_~y~0_1288 v_main_~y~0_1287))) (or (and (= v_main_~x~0_1720 v_main_~x~0_1719) .cse0) (let ((.cse1 (+ v_main_~x~0_1720 v_main_~y~0_1287))) (and (< v_main_~y~0_1288 v_main_~y~0_1287) (< .cse1 (+ 1000001 v_main_~y~0_1288)) .cse2 (= .cse1 (+ v_main_~x~0_1719 v_main_~y~0_1288)))) (and (or (not .cse2) (not (< v_main_~x~0_1720 1000000))) (= v_main_~x~0_1719 v_main_~x~0_1720) .cse0))) InVars {main_~x~0=v_main_~x~0_1720, main_~y~0=v_main_~y~0_1288} OutVars{main_~x~0=v_main_~x~0_1719, main_~y~0=v_main_~y~0_1287} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {24028#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:59:19,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {24096#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [218] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24096#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:59:19,955 INFO L290 TraceCheckUtils]: 6: Hoare triple {24103#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [217] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1718 v_main_~x~0_1717))) (or .cse0 (and .cse0 (<= 500000 v_main_~x~0_1718)) (and (< v_main_~x~0_1717 500001) (< v_main_~x~0_1718 v_main_~x~0_1717)))) InVars {main_~x~0=v_main_~x~0_1718} OutVars{main_~x~0=v_main_~x~0_1717} AuxVars[] AssignedVars[main_~x~0] {24096#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:59:19,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {24021#true} ~x~0 := 0;~y~0 := 500000; {24103#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:59:19,956 INFO L272 TraceCheckUtils]: 4: Hoare triple {24021#true} call #t~ret4 := main(); {24021#true} is VALID [2022-04-28 03:59:19,956 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24021#true} {24021#true} #41#return; {24021#true} is VALID [2022-04-28 03:59:19,956 INFO L290 TraceCheckUtils]: 2: Hoare triple {24021#true} assume true; {24021#true} is VALID [2022-04-28 03:59:19,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {24021#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(17, 2);call #Ultimate.allocInit(12, 3); {24021#true} is VALID [2022-04-28 03:59:19,956 INFO L272 TraceCheckUtils]: 0: Hoare triple {24021#true} call ULTIMATE.init(); {24021#true} is VALID [2022-04-28 03:59:19,956 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:59:19,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934270437] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:59:19,956 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:59:19,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 03:59:21,902 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:59:21,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [778390915] [2022-04-28 03:59:21,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [778390915] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:59:21,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:59:21,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2022-04-28 03:59:21,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182385281] [2022-04-28 03:59:21,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:59:21,903 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.94) internal successors, (97), 49 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:59:21,903 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:59:21,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 51 states, 50 states have (on average 1.94) internal successors, (97), 49 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:59:21,972 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:59:21,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-04-28 03:59:21,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:59:21,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-04-28 03:59:21,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=3397, Unknown=0, NotChecked=0, Total=3782 [2022-04-28 03:59:21,973 INFO L87 Difference]: Start difference. First operand 103 states and 106 transitions. Second operand has 51 states, 50 states have (on average 1.94) internal successors, (97), 49 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:59:29,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:59:29,291 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2022-04-28 03:59:29,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-28 03:59:29,291 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.94) internal successors, (97), 49 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:59:29,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:59:29,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.94) internal successors, (97), 49 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:59:29,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 117 transitions. [2022-04-28 03:59:29,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.94) internal successors, (97), 49 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:59:29,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 117 transitions. [2022-04-28 03:59:29,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 117 transitions. [2022-04-28 03:59:29,413 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:59:29,414 INFO L225 Difference]: With dead ends: 112 [2022-04-28 03:59:29,414 INFO L226 Difference]: Without dead ends: 105 [2022-04-28 03:59:29,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2249 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=843, Invalid=10713, Unknown=0, NotChecked=0, Total=11556 [2022-04-28 03:59:29,416 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 97 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 4205 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 4300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 4205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:59:29,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 103 Invalid, 4300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 4205 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-28 03:59:29,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-04-28 03:59:29,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-04-28 03:59:29,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:59:29,690 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 105 states, 100 states have (on average 1.04) internal successors, (104), 100 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:59:29,690 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 105 states, 100 states have (on average 1.04) internal successors, (104), 100 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:59:29,690 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 105 states, 100 states have (on average 1.04) internal successors, (104), 100 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:59:29,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:59:29,691 INFO L93 Difference]: Finished difference Result 105 states and 108 transitions. [2022-04-28 03:59:29,691 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 108 transitions. [2022-04-28 03:59:29,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:59:29,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:59:29,692 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 100 states have (on average 1.04) internal successors, (104), 100 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 105 states. [2022-04-28 03:59:29,692 INFO L87 Difference]: Start difference. First operand has 105 states, 100 states have (on average 1.04) internal successors, (104), 100 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 105 states. [2022-04-28 03:59:29,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:59:29,692 INFO L93 Difference]: Finished difference Result 105 states and 108 transitions. [2022-04-28 03:59:29,692 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 108 transitions. [2022-04-28 03:59:29,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:59:29,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:59:29,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:59:29,693 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:59:29,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 100 states have (on average 1.04) internal successors, (104), 100 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:59:29,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 108 transitions. [2022-04-28 03:59:29,694 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 108 transitions. Word has length 101 [2022-04-28 03:59:29,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:59:29,694 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 108 transitions. [2022-04-28 03:59:29,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.94) internal successors, (97), 49 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:59:29,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 105 states and 108 transitions. [2022-04-28 03:59:29,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:59:29,786 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 108 transitions. [2022-04-28 03:59:29,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-28 03:59:29,786 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:59:29,786 INFO L195 NwaCegarLoop]: trace histogram [46, 44, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:59:29,802 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:59:29,987 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:59:29,987 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:59:29,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:59:29,987 INFO L85 PathProgramCache]: Analyzing trace with hash 308225633, now seen corresponding path program 44 times [2022-04-28 03:59:29,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:59:29,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1125229150] [2022-04-28 03:59:34,043 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:59:34,083 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:59:34,291 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:59:34,292 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:59:34,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1460758865, now seen corresponding path program 1 times [2022-04-28 03:59:34,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:59:34,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302049784] [2022-04-28 03:59:34,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:59:34,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:59:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:59:34,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:59:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:59:34,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {24916#(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(17, 2);call #Ultimate.allocInit(12, 3); {24905#true} is VALID [2022-04-28 03:59:34,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {24905#true} assume true; {24905#true} is VALID [2022-04-28 03:59:34,397 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24905#true} {24905#true} #41#return; {24905#true} is VALID [2022-04-28 03:59:34,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {24905#true} call ULTIMATE.init(); {24916#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:59:34,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {24916#(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(17, 2);call #Ultimate.allocInit(12, 3); {24905#true} is VALID [2022-04-28 03:59:34,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {24905#true} assume true; {24905#true} is VALID [2022-04-28 03:59:34,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24905#true} {24905#true} #41#return; {24905#true} is VALID [2022-04-28 03:59:34,397 INFO L272 TraceCheckUtils]: 4: Hoare triple {24905#true} call #t~ret4 := main(); {24905#true} is VALID [2022-04-28 03:59:34,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {24905#true} ~x~0 := 0;~y~0 := 500000; {24910#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:59:34,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {24910#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [221] L11-2-->L10-2_primed: Formula: (or (and (< v_main_~x~0_1780 v_main_~x~0_1779) (< v_main_~x~0_1779 500001)) (= v_main_~x~0_1780 v_main_~x~0_1779) (and (not (< v_main_~x~0_1780 500000)) (= v_main_~x~0_1779 v_main_~x~0_1780))) InVars {main_~x~0=v_main_~x~0_1780} OutVars{main_~x~0=v_main_~x~0_1779} AuxVars[] AssignedVars[main_~x~0] {24911#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:59:34,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {24911#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [222] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24911#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:59:34,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {24911#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [223] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_1782)) (.cse1 (= v_main_~x~0_1782 v_main_~x~0_1781)) (.cse2 (= v_main_~y~0_1340 v_main_~y~0_1339))) (or (and (or (not .cse0) (not (< v_main_~x~0_1782 1000000))) .cse1 .cse2) (let ((.cse3 (+ v_main_~x~0_1782 v_main_~y~0_1339))) (and (< .cse3 (+ 1000001 v_main_~y~0_1340)) (= (+ v_main_~x~0_1781 v_main_~y~0_1340) .cse3) (< v_main_~y~0_1340 v_main_~y~0_1339) .cse0)) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_1782, main_~y~0=v_main_~y~0_1340} OutVars{main_~x~0=v_main_~x~0_1781, main_~y~0=v_main_~y~0_1339} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {24912#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:59:34,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {24912#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [220] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {24913#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:59:34,400 INFO L272 TraceCheckUtils]: 10: Hoare triple {24913#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {24914#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:59:34,401 INFO L290 TraceCheckUtils]: 11: Hoare triple {24914#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {24915#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:59:34,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {24915#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {24906#false} is VALID [2022-04-28 03:59:34,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {24906#false} assume !false; {24906#false} is VALID [2022-04-28 03:59:34,401 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:59:34,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:59:34,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302049784] [2022-04-28 03:59:34,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302049784] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:59:34,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159074996] [2022-04-28 03:59:34,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:59:34,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:59:34,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:59:34,403 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:59:34,403 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:59:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:59:34,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:59:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:59:34,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:59:34,777 INFO L272 TraceCheckUtils]: 0: Hoare triple {24905#true} call ULTIMATE.init(); {24905#true} is VALID [2022-04-28 03:59:34,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {24905#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(17, 2);call #Ultimate.allocInit(12, 3); {24905#true} is VALID [2022-04-28 03:59:34,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {24905#true} assume true; {24905#true} is VALID [2022-04-28 03:59:34,777 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24905#true} {24905#true} #41#return; {24905#true} is VALID [2022-04-28 03:59:34,777 INFO L272 TraceCheckUtils]: 4: Hoare triple {24905#true} call #t~ret4 := main(); {24905#true} is VALID [2022-04-28 03:59:34,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {24905#true} ~x~0 := 0;~y~0 := 500000; {24935#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:59:34,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {24935#(and (<= main_~x~0 0) (= main_~y~0 500000))} [221] L11-2-->L10-2_primed: Formula: (or (and (< v_main_~x~0_1780 v_main_~x~0_1779) (< v_main_~x~0_1779 500001)) (= v_main_~x~0_1780 v_main_~x~0_1779) (and (not (< v_main_~x~0_1780 500000)) (= v_main_~x~0_1779 v_main_~x~0_1780))) InVars {main_~x~0=v_main_~x~0_1780} OutVars{main_~x~0=v_main_~x~0_1779} AuxVars[] AssignedVars[main_~x~0] {24939#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:59:34,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {24939#(and (= main_~y~0 500000) (< main_~x~0 500001))} [222] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24939#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:59:34,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {24939#(and (= main_~y~0 500000) (< main_~x~0 500001))} [223] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_1782)) (.cse1 (= v_main_~x~0_1782 v_main_~x~0_1781)) (.cse2 (= v_main_~y~0_1340 v_main_~y~0_1339))) (or (and (or (not .cse0) (not (< v_main_~x~0_1782 1000000))) .cse1 .cse2) (let ((.cse3 (+ v_main_~x~0_1782 v_main_~y~0_1339))) (and (< .cse3 (+ 1000001 v_main_~y~0_1340)) (= (+ v_main_~x~0_1781 v_main_~y~0_1340) .cse3) (< v_main_~y~0_1340 v_main_~y~0_1339) .cse0)) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_1782, main_~y~0=v_main_~y~0_1340} OutVars{main_~x~0=v_main_~x~0_1781, main_~y~0=v_main_~y~0_1339} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {24946#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:59:34,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {24946#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [220] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {24950#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:59:34,780 INFO L272 TraceCheckUtils]: 10: Hoare triple {24950#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {24954#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:59:34,780 INFO L290 TraceCheckUtils]: 11: Hoare triple {24954#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {24958#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:59:34,781 INFO L290 TraceCheckUtils]: 12: Hoare triple {24958#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24906#false} is VALID [2022-04-28 03:59:34,781 INFO L290 TraceCheckUtils]: 13: Hoare triple {24906#false} assume !false; {24906#false} is VALID [2022-04-28 03:59:34,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:59:34,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:59:35,093 INFO L290 TraceCheckUtils]: 13: Hoare triple {24906#false} assume !false; {24906#false} is VALID [2022-04-28 03:59:35,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {24958#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24906#false} is VALID [2022-04-28 03:59:35,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {24954#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {24958#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:59:35,095 INFO L272 TraceCheckUtils]: 10: Hoare triple {24913#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {24954#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:59:35,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {24977#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [220] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {24913#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:59:35,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {24981#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [223] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_1782)) (.cse1 (= v_main_~x~0_1782 v_main_~x~0_1781)) (.cse2 (= v_main_~y~0_1340 v_main_~y~0_1339))) (or (and (or (not .cse0) (not (< v_main_~x~0_1782 1000000))) .cse1 .cse2) (let ((.cse3 (+ v_main_~x~0_1782 v_main_~y~0_1339))) (and (< .cse3 (+ 1000001 v_main_~y~0_1340)) (= (+ v_main_~x~0_1781 v_main_~y~0_1340) .cse3) (< v_main_~y~0_1340 v_main_~y~0_1339) .cse0)) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_1782, main_~y~0=v_main_~y~0_1340} OutVars{main_~x~0=v_main_~x~0_1781, main_~y~0=v_main_~y~0_1339} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {24977#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:59:35,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {24981#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [222] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24981#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:59:35,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {24988#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [221] L11-2-->L10-2_primed: Formula: (or (and (< v_main_~x~0_1780 v_main_~x~0_1779) (< v_main_~x~0_1779 500001)) (= v_main_~x~0_1780 v_main_~x~0_1779) (and (not (< v_main_~x~0_1780 500000)) (= v_main_~x~0_1779 v_main_~x~0_1780))) InVars {main_~x~0=v_main_~x~0_1780} OutVars{main_~x~0=v_main_~x~0_1779} AuxVars[] AssignedVars[main_~x~0] {24981#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:59:35,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {24905#true} ~x~0 := 0;~y~0 := 500000; {24988#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:59:35,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {24905#true} call #t~ret4 := main(); {24905#true} is VALID [2022-04-28 03:59:35,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24905#true} {24905#true} #41#return; {24905#true} is VALID [2022-04-28 03:59:35,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {24905#true} assume true; {24905#true} is VALID [2022-04-28 03:59:35,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {24905#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(17, 2);call #Ultimate.allocInit(12, 3); {24905#true} is VALID [2022-04-28 03:59:35,098 INFO L272 TraceCheckUtils]: 0: Hoare triple {24905#true} call ULTIMATE.init(); {24905#true} is VALID [2022-04-28 03:59:35,098 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:59:35,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159074996] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:59:35,098 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:59:35,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 03:59:37,087 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:59:37,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1125229150] [2022-04-28 03:59:37,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1125229150] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:59:37,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:59:37,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2022-04-28 03:59:37,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994048650] [2022-04-28 03:59:37,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:59:37,088 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.9411764705882353) internal successors, (99), 50 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:59:37,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:59:37,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 52 states, 51 states have (on average 1.9411764705882353) internal successors, (99), 50 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:59:37,158 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:59:37,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-04-28 03:59:37,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:59:37,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-04-28 03:59:37,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=450, Invalid=3582, Unknown=0, NotChecked=0, Total=4032 [2022-04-28 03:59:37,159 INFO L87 Difference]: Start difference. First operand 105 states and 108 transitions. Second operand has 52 states, 51 states have (on average 1.9411764705882353) internal successors, (99), 50 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:59:44,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:59:44,712 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2022-04-28 03:59:44,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-28 03:59:44,712 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.9411764705882353) internal successors, (99), 50 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:59:44,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:59:44,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.9411764705882353) internal successors, (99), 50 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:59:44,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 119 transitions. [2022-04-28 03:59:44,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.9411764705882353) internal successors, (99), 50 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:59:44,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 119 transitions. [2022-04-28 03:59:44,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 119 transitions. [2022-04-28 03:59:44,816 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:59:44,817 INFO L225 Difference]: With dead ends: 114 [2022-04-28 03:59:44,817 INFO L226 Difference]: Without dead ends: 107 [2022-04-28 03:59:44,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2423 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=965, Invalid=11245, Unknown=0, NotChecked=0, Total=12210 [2022-04-28 03:59:44,819 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 99 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 4353 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 4450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 4353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:59:44,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 88 Invalid, 4450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 4353 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-28 03:59:44,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-28 03:59:45,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-04-28 03:59:45,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:59:45,172 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 107 states, 102 states have (on average 1.0392156862745099) internal successors, (106), 102 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:59:45,172 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 107 states, 102 states have (on average 1.0392156862745099) internal successors, (106), 102 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:59:45,172 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 107 states, 102 states have (on average 1.0392156862745099) internal successors, (106), 102 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:59:45,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:59:45,173 INFO L93 Difference]: Finished difference Result 107 states and 110 transitions. [2022-04-28 03:59:45,173 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2022-04-28 03:59:45,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:59:45,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:59:45,173 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 102 states have (on average 1.0392156862745099) internal successors, (106), 102 states have internal predecessors, (106), 3 states have call successors, (3), 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:59:45,173 INFO L87 Difference]: Start difference. First operand has 107 states, 102 states have (on average 1.0392156862745099) internal successors, (106), 102 states have internal predecessors, (106), 3 states have call successors, (3), 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:59:45,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:59:45,174 INFO L93 Difference]: Finished difference Result 107 states and 110 transitions. [2022-04-28 03:59:45,174 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2022-04-28 03:59:45,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:59:45,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:59:45,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:59:45,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:59:45,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 102 states have (on average 1.0392156862745099) internal successors, (106), 102 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:59:45,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 110 transitions. [2022-04-28 03:59:45,176 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 110 transitions. Word has length 103 [2022-04-28 03:59:45,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:59:45,176 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 110 transitions. [2022-04-28 03:59:45,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 1.9411764705882353) internal successors, (99), 50 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:59:45,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 107 states and 110 transitions. [2022-04-28 03:59:45,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:59:45,265 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2022-04-28 03:59:45,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-28 03:59:45,266 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:59:45,266 INFO L195 NwaCegarLoop]: trace histogram [47, 45, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:59:45,281 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:59:45,466 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:59:45,466 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:59:45,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:59:45,467 INFO L85 PathProgramCache]: Analyzing trace with hash 88522748, now seen corresponding path program 45 times [2022-04-28 03:59:45,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:59:45,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1027231895] [2022-04-28 03:59:45,566 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:59:45,736 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:59:45,737 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:59:45,739 INFO L85 PathProgramCache]: Analyzing trace with hash 588773295, now seen corresponding path program 1 times [2022-04-28 03:59:45,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:59:45,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111624671] [2022-04-28 03:59:45,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:59:45,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:59:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:59:45,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:59:45,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:59:45,832 INFO L290 TraceCheckUtils]: 0: Hoare triple {25816#(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(17, 2);call #Ultimate.allocInit(12, 3); {25805#true} is VALID [2022-04-28 03:59:45,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {25805#true} assume true; {25805#true} is VALID [2022-04-28 03:59:45,832 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25805#true} {25805#true} #41#return; {25805#true} is VALID [2022-04-28 03:59:45,832 INFO L272 TraceCheckUtils]: 0: Hoare triple {25805#true} call ULTIMATE.init(); {25816#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:59:45,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {25816#(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(17, 2);call #Ultimate.allocInit(12, 3); {25805#true} is VALID [2022-04-28 03:59:45,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {25805#true} assume true; {25805#true} is VALID [2022-04-28 03:59:45,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25805#true} {25805#true} #41#return; {25805#true} is VALID [2022-04-28 03:59:45,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {25805#true} call #t~ret4 := main(); {25805#true} is VALID [2022-04-28 03:59:45,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {25805#true} ~x~0 := 0;~y~0 := 500000; {25810#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 03:59:45,834 INFO L290 TraceCheckUtils]: 6: Hoare triple {25810#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [225] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1843 v_main_~x~0_1842))) (or .cse0 (and (< v_main_~x~0_1842 500001) (< v_main_~x~0_1843 v_main_~x~0_1842)) (and (not (< v_main_~x~0_1843 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_1843} OutVars{main_~x~0=v_main_~x~0_1842} AuxVars[] AssignedVars[main_~x~0] {25811#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:59:45,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {25811#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [226] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25811#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:59:45,835 INFO L290 TraceCheckUtils]: 8: Hoare triple {25811#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [227] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1845 v_main_~x~0_1844)) (.cse1 (= v_main_~y~0_1393 v_main_~y~0_1392)) (.cse2 (<= 500000 v_main_~x~0_1845))) (or (and .cse0 .cse1) (and .cse0 (or (not .cse2) (not (< v_main_~x~0_1845 1000000))) .cse1) (let ((.cse3 (+ v_main_~x~0_1845 v_main_~y~0_1392))) (and (< v_main_~y~0_1393 v_main_~y~0_1392) .cse2 (= .cse3 (+ v_main_~x~0_1844 v_main_~y~0_1393)) (< .cse3 (+ 1000001 v_main_~y~0_1393)))))) InVars {main_~x~0=v_main_~x~0_1845, main_~y~0=v_main_~y~0_1393} OutVars{main_~x~0=v_main_~x~0_1844, main_~y~0=v_main_~y~0_1392} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {25812#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} is VALID [2022-04-28 03:59:45,835 INFO L290 TraceCheckUtils]: 9: Hoare triple {25812#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} [224] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {25813#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:59:45,836 INFO L272 TraceCheckUtils]: 10: Hoare triple {25813#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {25814#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:59:45,836 INFO L290 TraceCheckUtils]: 11: Hoare triple {25814#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {25815#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:59:45,837 INFO L290 TraceCheckUtils]: 12: Hoare triple {25815#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {25806#false} is VALID [2022-04-28 03:59:45,837 INFO L290 TraceCheckUtils]: 13: Hoare triple {25806#false} assume !false; {25806#false} is VALID [2022-04-28 03:59:45,837 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:59:45,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:59:45,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111624671] [2022-04-28 03:59:45,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111624671] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:59:45,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864901125] [2022-04-28 03:59:45,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:59:45,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:59:45,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:59:45,838 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:59:45,839 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:59:45,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:59:45,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:59:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:59:45,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:59:46,210 INFO L272 TraceCheckUtils]: 0: Hoare triple {25805#true} call ULTIMATE.init(); {25805#true} is VALID [2022-04-28 03:59:46,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {25805#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(17, 2);call #Ultimate.allocInit(12, 3); {25805#true} is VALID [2022-04-28 03:59:46,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {25805#true} assume true; {25805#true} is VALID [2022-04-28 03:59:46,211 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25805#true} {25805#true} #41#return; {25805#true} is VALID [2022-04-28 03:59:46,211 INFO L272 TraceCheckUtils]: 4: Hoare triple {25805#true} call #t~ret4 := main(); {25805#true} is VALID [2022-04-28 03:59:46,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {25805#true} ~x~0 := 0;~y~0 := 500000; {25835#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 03:59:46,212 INFO L290 TraceCheckUtils]: 6: Hoare triple {25835#(and (<= main_~x~0 0) (= main_~y~0 500000))} [225] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1843 v_main_~x~0_1842))) (or .cse0 (and (< v_main_~x~0_1842 500001) (< v_main_~x~0_1843 v_main_~x~0_1842)) (and (not (< v_main_~x~0_1843 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_1843} OutVars{main_~x~0=v_main_~x~0_1842} AuxVars[] AssignedVars[main_~x~0] {25839#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:59:46,212 INFO L290 TraceCheckUtils]: 7: Hoare triple {25839#(and (= main_~y~0 500000) (< main_~x~0 500001))} [226] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25839#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 03:59:46,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {25839#(and (= main_~y~0 500000) (< main_~x~0 500001))} [227] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1845 v_main_~x~0_1844)) (.cse1 (= v_main_~y~0_1393 v_main_~y~0_1392)) (.cse2 (<= 500000 v_main_~x~0_1845))) (or (and .cse0 .cse1) (and .cse0 (or (not .cse2) (not (< v_main_~x~0_1845 1000000))) .cse1) (let ((.cse3 (+ v_main_~x~0_1845 v_main_~y~0_1392))) (and (< v_main_~y~0_1393 v_main_~y~0_1392) .cse2 (= .cse3 (+ v_main_~x~0_1844 v_main_~y~0_1393)) (< .cse3 (+ 1000001 v_main_~y~0_1393)))))) InVars {main_~x~0=v_main_~x~0_1845, main_~y~0=v_main_~y~0_1393} OutVars{main_~x~0=v_main_~x~0_1844, main_~y~0=v_main_~y~0_1392} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {25846#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:59:46,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {25846#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [224] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {25850#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:59:46,214 INFO L272 TraceCheckUtils]: 10: Hoare triple {25850#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {25854#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:59:46,214 INFO L290 TraceCheckUtils]: 11: Hoare triple {25854#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25858#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:59:46,215 INFO L290 TraceCheckUtils]: 12: Hoare triple {25858#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25806#false} is VALID [2022-04-28 03:59:46,215 INFO L290 TraceCheckUtils]: 13: Hoare triple {25806#false} assume !false; {25806#false} is VALID [2022-04-28 03:59:46,215 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:59:46,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:59:46,510 INFO L290 TraceCheckUtils]: 13: Hoare triple {25806#false} assume !false; {25806#false} is VALID [2022-04-28 03:59:46,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {25858#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25806#false} is VALID [2022-04-28 03:59:46,511 INFO L290 TraceCheckUtils]: 11: Hoare triple {25854#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25858#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:59:46,511 INFO L272 TraceCheckUtils]: 10: Hoare triple {25813#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {25854#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:59:46,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {25877#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [224] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {25813#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 03:59:46,512 INFO L290 TraceCheckUtils]: 8: Hoare triple {25881#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [227] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1845 v_main_~x~0_1844)) (.cse1 (= v_main_~y~0_1393 v_main_~y~0_1392)) (.cse2 (<= 500000 v_main_~x~0_1845))) (or (and .cse0 .cse1) (and .cse0 (or (not .cse2) (not (< v_main_~x~0_1845 1000000))) .cse1) (let ((.cse3 (+ v_main_~x~0_1845 v_main_~y~0_1392))) (and (< v_main_~y~0_1393 v_main_~y~0_1392) .cse2 (= .cse3 (+ v_main_~x~0_1844 v_main_~y~0_1393)) (< .cse3 (+ 1000001 v_main_~y~0_1393)))))) InVars {main_~x~0=v_main_~x~0_1845, main_~y~0=v_main_~y~0_1393} OutVars{main_~x~0=v_main_~x~0_1844, main_~y~0=v_main_~y~0_1392} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {25877#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:59:46,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {25881#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [226] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25881#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:59:46,513 INFO L290 TraceCheckUtils]: 6: Hoare triple {25888#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [225] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1843 v_main_~x~0_1842))) (or .cse0 (and (< v_main_~x~0_1842 500001) (< v_main_~x~0_1843 v_main_~x~0_1842)) (and (not (< v_main_~x~0_1843 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_1843} OutVars{main_~x~0=v_main_~x~0_1842} AuxVars[] AssignedVars[main_~x~0] {25881#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:59:46,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {25805#true} ~x~0 := 0;~y~0 := 500000; {25888#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 03:59:46,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {25805#true} call #t~ret4 := main(); {25805#true} is VALID [2022-04-28 03:59:46,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25805#true} {25805#true} #41#return; {25805#true} is VALID [2022-04-28 03:59:46,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {25805#true} assume true; {25805#true} is VALID [2022-04-28 03:59:46,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {25805#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(17, 2);call #Ultimate.allocInit(12, 3); {25805#true} is VALID [2022-04-28 03:59:46,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {25805#true} call ULTIMATE.init(); {25805#true} is VALID [2022-04-28 03:59:46,514 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:59:46,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864901125] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:59:46,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:59:46,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 03:59:48,624 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:59:48,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1027231895] [2022-04-28 03:59:48,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1027231895] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:59:48,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:59:48,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2022-04-28 03:59:48,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610661307] [2022-04-28 03:59:48,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:59:48,625 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.9423076923076923) internal successors, (101), 51 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:59:48,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:59:48,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 53 states, 52 states have (on average 1.9423076923076923) internal successors, (101), 51 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:59:48,705 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:59:48,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-04-28 03:59:48,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:59:48,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-04-28 03:59:48,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=458, Invalid=3702, Unknown=0, NotChecked=0, Total=4160 [2022-04-28 03:59:48,706 INFO L87 Difference]: Start difference. First operand 107 states and 110 transitions. Second operand has 53 states, 52 states have (on average 1.9423076923076923) internal successors, (101), 51 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:59:56,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:59:56,937 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2022-04-28 03:59:56,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-04-28 03:59:56,937 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.9423076923076923) internal successors, (101), 51 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:59:56,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:59:56,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.9423076923076923) internal successors, (101), 51 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:59:56,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 121 transitions. [2022-04-28 03:59:56,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.9423076923076923) internal successors, (101), 51 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:59:56,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 121 transitions. [2022-04-28 03:59:56,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 121 transitions. [2022-04-28 03:59:57,031 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:59:57,032 INFO L225 Difference]: With dead ends: 116 [2022-04-28 03:59:57,032 INFO L226 Difference]: Without dead ends: 109 [2022-04-28 03:59:57,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2497 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=984, Invalid=11672, Unknown=0, NotChecked=0, Total=12656 [2022-04-28 03:59:57,033 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 101 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 4615 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 4714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 4615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:59:57,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 123 Invalid, 4714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 4615 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-04-28 03:59:57,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-28 03:59:57,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-04-28 03:59:57,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:59:57,311 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 109 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 104 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:59:57,312 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 109 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 104 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:59:57,312 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 109 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 104 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:59:57,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:59:57,313 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2022-04-28 03:59:57,313 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 112 transitions. [2022-04-28 03:59:57,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:59:57,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:59:57,313 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 104 states have internal predecessors, (108), 3 states have call successors, (3), 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:59:57,313 INFO L87 Difference]: Start difference. First operand has 109 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 104 states have internal predecessors, (108), 3 states have call successors, (3), 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:59:57,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:59:57,314 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2022-04-28 03:59:57,314 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 112 transitions. [2022-04-28 03:59:57,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:59:57,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:59:57,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:59:57,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:59:57,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 104 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:59:57,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 112 transitions. [2022-04-28 03:59:57,315 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 112 transitions. Word has length 105 [2022-04-28 03:59:57,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:59:57,315 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 112 transitions. [2022-04-28 03:59:57,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 1.9423076923076923) internal successors, (101), 51 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:59:57,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 112 transitions. [2022-04-28 03:59:57,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:59:57,415 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 112 transitions. [2022-04-28 03:59:57,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-28 03:59:57,415 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:59:57,415 INFO L195 NwaCegarLoop]: trace histogram [48, 46, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:59:57,431 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:59:57,616 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:59:57,616 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:59:57,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:59:57,616 INFO L85 PathProgramCache]: Analyzing trace with hash -592552233, now seen corresponding path program 46 times [2022-04-28 03:59:57,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:59:57,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [734248918] [2022-04-28 03:59:57,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 04:00:01,828 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:00:01,930 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 04:00:01,931 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:00:01,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1656661841, now seen corresponding path program 1 times [2022-04-28 04:00:01,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:00:01,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486842265] [2022-04-28 04:00:01,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:00:01,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:00:01,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:00:02,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:00:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:00:02,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {26731#(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(17, 2);call #Ultimate.allocInit(12, 3); {26720#true} is VALID [2022-04-28 04:00:02,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {26720#true} assume true; {26720#true} is VALID [2022-04-28 04:00:02,032 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26720#true} {26720#true} #41#return; {26720#true} is VALID [2022-04-28 04:00:02,032 INFO L272 TraceCheckUtils]: 0: Hoare triple {26720#true} call ULTIMATE.init(); {26731#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:00:02,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {26731#(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(17, 2);call #Ultimate.allocInit(12, 3); {26720#true} is VALID [2022-04-28 04:00:02,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {26720#true} assume true; {26720#true} is VALID [2022-04-28 04:00:02,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26720#true} {26720#true} #41#return; {26720#true} is VALID [2022-04-28 04:00:02,033 INFO L272 TraceCheckUtils]: 4: Hoare triple {26720#true} call #t~ret4 := main(); {26720#true} is VALID [2022-04-28 04:00:02,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {26720#true} ~x~0 := 0;~y~0 := 500000; {26725#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 04:00:02,033 INFO L290 TraceCheckUtils]: 6: Hoare triple {26725#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [229] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1907 v_main_~x~0_1906))) (or .cse0 (and (< v_main_~x~0_1907 v_main_~x~0_1906) (< v_main_~x~0_1906 500001)) (and (<= 500000 v_main_~x~0_1907) .cse0))) InVars {main_~x~0=v_main_~x~0_1907} OutVars{main_~x~0=v_main_~x~0_1906} AuxVars[] AssignedVars[main_~x~0] {26726#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 04:00:02,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {26726#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [230] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26726#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 04:00:02,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {26726#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [231] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1909 v_main_~x~0_1908)) (.cse1 (= v_main_~y~0_1447 v_main_~y~0_1446)) (.cse2 (<= 500000 v_main_~x~0_1909))) (or (and .cse0 .cse1) (let ((.cse3 (+ v_main_~x~0_1909 v_main_~y~0_1446))) (and .cse2 (= (+ v_main_~x~0_1908 v_main_~y~0_1447) .cse3) (< v_main_~y~0_1447 v_main_~y~0_1446) (< .cse3 (+ 1000001 v_main_~y~0_1447)))) (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_1909 1000000)))))) InVars {main_~x~0=v_main_~x~0_1909, main_~y~0=v_main_~y~0_1447} OutVars{main_~x~0=v_main_~x~0_1908, main_~y~0=v_main_~y~0_1446} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {26727#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} is VALID [2022-04-28 04:00:02,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {26727#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} [228] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {26728#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:00:02,036 INFO L272 TraceCheckUtils]: 10: Hoare triple {26728#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {26729#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:00:02,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {26729#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {26730#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:00:02,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {26730#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {26721#false} is VALID [2022-04-28 04:00:02,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {26721#false} assume !false; {26721#false} is VALID [2022-04-28 04:00:02,036 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 04:00:02,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:00:02,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486842265] [2022-04-28 04:00:02,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486842265] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:00:02,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164762379] [2022-04-28 04:00:02,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:00:02,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:00:02,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:00:02,038 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 04:00:02,039 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 04:00:02,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:00:02,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 04:00:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:00:02,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:00:02,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {26720#true} call ULTIMATE.init(); {26720#true} is VALID [2022-04-28 04:00:02,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {26720#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(17, 2);call #Ultimate.allocInit(12, 3); {26720#true} is VALID [2022-04-28 04:00:02,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {26720#true} assume true; {26720#true} is VALID [2022-04-28 04:00:02,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26720#true} {26720#true} #41#return; {26720#true} is VALID [2022-04-28 04:00:02,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {26720#true} call #t~ret4 := main(); {26720#true} is VALID [2022-04-28 04:00:02,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {26720#true} ~x~0 := 0;~y~0 := 500000; {26750#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 04:00:02,385 INFO L290 TraceCheckUtils]: 6: Hoare triple {26750#(and (<= main_~x~0 0) (= main_~y~0 500000))} [229] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1907 v_main_~x~0_1906))) (or .cse0 (and (< v_main_~x~0_1907 v_main_~x~0_1906) (< v_main_~x~0_1906 500001)) (and (<= 500000 v_main_~x~0_1907) .cse0))) InVars {main_~x~0=v_main_~x~0_1907} OutVars{main_~x~0=v_main_~x~0_1906} AuxVars[] AssignedVars[main_~x~0] {26754#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 04:00:02,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {26754#(and (= main_~y~0 500000) (< main_~x~0 500001))} [230] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26754#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 04:00:02,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {26754#(and (= main_~y~0 500000) (< main_~x~0 500001))} [231] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1909 v_main_~x~0_1908)) (.cse1 (= v_main_~y~0_1447 v_main_~y~0_1446)) (.cse2 (<= 500000 v_main_~x~0_1909))) (or (and .cse0 .cse1) (let ((.cse3 (+ v_main_~x~0_1909 v_main_~y~0_1446))) (and .cse2 (= (+ v_main_~x~0_1908 v_main_~y~0_1447) .cse3) (< v_main_~y~0_1447 v_main_~y~0_1446) (< .cse3 (+ 1000001 v_main_~y~0_1447)))) (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_1909 1000000)))))) InVars {main_~x~0=v_main_~x~0_1909, main_~y~0=v_main_~y~0_1447} OutVars{main_~x~0=v_main_~x~0_1908, main_~y~0=v_main_~y~0_1446} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {26761#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:00:02,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {26761#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [228] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {26765#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:00:02,387 INFO L272 TraceCheckUtils]: 10: Hoare triple {26765#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {26769#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:00:02,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {26769#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {26773#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:00:02,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {26773#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {26721#false} is VALID [2022-04-28 04:00:02,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {26721#false} assume !false; {26721#false} is VALID [2022-04-28 04:00:02,388 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 04:00:02,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:00:02,686 INFO L290 TraceCheckUtils]: 13: Hoare triple {26721#false} assume !false; {26721#false} is VALID [2022-04-28 04:00:02,686 INFO L290 TraceCheckUtils]: 12: Hoare triple {26773#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {26721#false} is VALID [2022-04-28 04:00:02,687 INFO L290 TraceCheckUtils]: 11: Hoare triple {26769#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {26773#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:00:02,687 INFO L272 TraceCheckUtils]: 10: Hoare triple {26728#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {26769#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:00:02,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {26792#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [228] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {26728#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:00:02,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {26796#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [231] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1909 v_main_~x~0_1908)) (.cse1 (= v_main_~y~0_1447 v_main_~y~0_1446)) (.cse2 (<= 500000 v_main_~x~0_1909))) (or (and .cse0 .cse1) (let ((.cse3 (+ v_main_~x~0_1909 v_main_~y~0_1446))) (and .cse2 (= (+ v_main_~x~0_1908 v_main_~y~0_1447) .cse3) (< v_main_~y~0_1447 v_main_~y~0_1446) (< .cse3 (+ 1000001 v_main_~y~0_1447)))) (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_1909 1000000)))))) InVars {main_~x~0=v_main_~x~0_1909, main_~y~0=v_main_~y~0_1447} OutVars{main_~x~0=v_main_~x~0_1908, main_~y~0=v_main_~y~0_1446} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {26792#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:00:02,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {26796#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [230] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26796#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:00:02,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {26803#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [229] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1907 v_main_~x~0_1906))) (or .cse0 (and (< v_main_~x~0_1907 v_main_~x~0_1906) (< v_main_~x~0_1906 500001)) (and (<= 500000 v_main_~x~0_1907) .cse0))) InVars {main_~x~0=v_main_~x~0_1907} OutVars{main_~x~0=v_main_~x~0_1906} AuxVars[] AssignedVars[main_~x~0] {26796#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:00:02,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {26720#true} ~x~0 := 0;~y~0 := 500000; {26803#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:00:02,693 INFO L272 TraceCheckUtils]: 4: Hoare triple {26720#true} call #t~ret4 := main(); {26720#true} is VALID [2022-04-28 04:00:02,693 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26720#true} {26720#true} #41#return; {26720#true} is VALID [2022-04-28 04:00:02,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {26720#true} assume true; {26720#true} is VALID [2022-04-28 04:00:02,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {26720#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(17, 2);call #Ultimate.allocInit(12, 3); {26720#true} is VALID [2022-04-28 04:00:02,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {26720#true} call ULTIMATE.init(); {26720#true} is VALID [2022-04-28 04:00:02,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 04:00:02,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164762379] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:00:02,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:00:02,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 04:00:04,890 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:00:04,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [734248918] [2022-04-28 04:00:04,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [734248918] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:00:04,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:00:04,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2022-04-28 04:00:04,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645786144] [2022-04-28 04:00:04,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:00:04,891 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.9433962264150944) internal successors, (103), 52 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 04:00:04,891 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:00:04,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 54 states, 53 states have (on average 1.9433962264150944) internal successors, (103), 52 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 04:00:04,965 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 04:00:04,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-04-28 04:00:04,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:00:04,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-04-28 04:00:04,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=466, Invalid=3824, Unknown=0, NotChecked=0, Total=4290 [2022-04-28 04:00:04,966 INFO L87 Difference]: Start difference. First operand 109 states and 112 transitions. Second operand has 54 states, 53 states have (on average 1.9433962264150944) internal successors, (103), 52 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 04:00:13,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:00:13,767 INFO L93 Difference]: Finished difference Result 118 states and 123 transitions. [2022-04-28 04:00:13,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-28 04:00:13,768 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.9433962264150944) internal successors, (103), 52 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 04:00:13,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:00:13,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.9433962264150944) internal successors, (103), 52 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 04:00:13,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 123 transitions. [2022-04-28 04:00:13,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.9433962264150944) internal successors, (103), 52 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 04:00:13,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 123 transitions. [2022-04-28 04:00:13,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 123 transitions. [2022-04-28 04:00:13,868 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 04:00:13,869 INFO L225 Difference]: With dead ends: 118 [2022-04-28 04:00:13,869 INFO L226 Difference]: Without dead ends: 111 [2022-04-28 04:00:13,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2572 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1003, Invalid=12107, Unknown=0, NotChecked=0, Total=13110 [2022-04-28 04:00:13,870 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 103 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 4925 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 5026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 4925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-28 04:00:13,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 138 Invalid, 5026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 4925 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-04-28 04:00:13,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-28 04:00:14,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-04-28 04:00:14,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:00:14,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 111 states, 106 states have (on average 1.0377358490566038) internal successors, (110), 106 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:00:14,169 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 111 states, 106 states have (on average 1.0377358490566038) internal successors, (110), 106 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:00:14,169 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 111 states, 106 states have (on average 1.0377358490566038) internal successors, (110), 106 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:00:14,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:00:14,170 INFO L93 Difference]: Finished difference Result 111 states and 114 transitions. [2022-04-28 04:00:14,170 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 114 transitions. [2022-04-28 04:00:14,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:00:14,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:00:14,170 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 106 states have (on average 1.0377358490566038) internal successors, (110), 106 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 111 states. [2022-04-28 04:00:14,170 INFO L87 Difference]: Start difference. First operand has 111 states, 106 states have (on average 1.0377358490566038) internal successors, (110), 106 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 111 states. [2022-04-28 04:00:14,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:00:14,171 INFO L93 Difference]: Finished difference Result 111 states and 114 transitions. [2022-04-28 04:00:14,171 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 114 transitions. [2022-04-28 04:00:14,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:00:14,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:00:14,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:00:14,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:00:14,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.0377358490566038) internal successors, (110), 106 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:00:14,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 114 transitions. [2022-04-28 04:00:14,172 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 114 transitions. Word has length 107 [2022-04-28 04:00:14,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:00:14,172 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 114 transitions. [2022-04-28 04:00:14,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 1.9433962264150944) internal successors, (103), 52 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 04:00:14,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 114 transitions. [2022-04-28 04:00:14,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:00:14,270 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 114 transitions. [2022-04-28 04:00:14,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-28 04:00:14,270 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:00:14,270 INFO L195 NwaCegarLoop]: trace histogram [49, 47, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:00:14,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-04-28 04:00:14,471 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 04:00:14,471 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:00:14,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:00:14,471 INFO L85 PathProgramCache]: Analyzing trace with hash 2024387314, now seen corresponding path program 47 times [2022-04-28 04:00:14,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:00:14,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1635504522] [2022-04-28 04:00:18,532 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:00:18,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 04:00:18,754 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 04:00:18,755 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:00:18,762 INFO L85 PathProgramCache]: Analyzing trace with hash 392870319, now seen corresponding path program 1 times [2022-04-28 04:00:18,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:00:18,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5184480] [2022-04-28 04:00:18,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:00:18,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:00:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:00:18,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:00:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:00:18,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {27661#(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(17, 2);call #Ultimate.allocInit(12, 3); {27650#true} is VALID [2022-04-28 04:00:18,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {27650#true} assume true; {27650#true} is VALID [2022-04-28 04:00:18,848 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27650#true} {27650#true} #41#return; {27650#true} is VALID [2022-04-28 04:00:18,848 INFO L272 TraceCheckUtils]: 0: Hoare triple {27650#true} call ULTIMATE.init(); {27661#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:00:18,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {27661#(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(17, 2);call #Ultimate.allocInit(12, 3); {27650#true} is VALID [2022-04-28 04:00:18,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {27650#true} assume true; {27650#true} is VALID [2022-04-28 04:00:18,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27650#true} {27650#true} #41#return; {27650#true} is VALID [2022-04-28 04:00:18,849 INFO L272 TraceCheckUtils]: 4: Hoare triple {27650#true} call #t~ret4 := main(); {27650#true} is VALID [2022-04-28 04:00:18,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {27650#true} ~x~0 := 0;~y~0 := 500000; {27655#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 04:00:18,850 INFO L290 TraceCheckUtils]: 6: Hoare triple {27655#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [233] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1972 v_main_~x~0_1971))) (or (and (< v_main_~x~0_1971 500001) (< v_main_~x~0_1972 v_main_~x~0_1971)) (and (<= 500000 v_main_~x~0_1972) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_1972} OutVars{main_~x~0=v_main_~x~0_1971} AuxVars[] AssignedVars[main_~x~0] {27656#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 04:00:18,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {27656#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [234] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27656#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 04:00:18,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {27656#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [235] L11-2-->L10-2_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_1974)) (.cse0 (= v_main_~x~0_1974 v_main_~x~0_1973)) (.cse1 (= v_main_~y~0_1502 v_main_~y~0_1501))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_1974 1000000)))) (and (= (+ v_main_~x~0_1973 v_main_~y~0_1502) (+ v_main_~x~0_1974 v_main_~y~0_1501)) (< v_main_~x~0_1974 v_main_~x~0_1973) (< v_main_~x~0_1973 1000001) .cse2) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1974, main_~y~0=v_main_~y~0_1502} OutVars{main_~x~0=v_main_~x~0_1973, main_~y~0=v_main_~y~0_1501} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {27657#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:00:18,851 INFO L290 TraceCheckUtils]: 9: Hoare triple {27657#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [232] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {27658#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:00:18,852 INFO L272 TraceCheckUtils]: 10: Hoare triple {27658#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {27659#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:00:18,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {27659#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {27660#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:00:18,853 INFO L290 TraceCheckUtils]: 12: Hoare triple {27660#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {27651#false} is VALID [2022-04-28 04:00:18,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {27651#false} assume !false; {27651#false} is VALID [2022-04-28 04:00:18,853 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 04:00:18,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:00:18,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5184480] [2022-04-28 04:00:18,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5184480] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:00:18,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893874512] [2022-04-28 04:00:18,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:00:18,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:00:18,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:00:18,855 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 04:00:18,883 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 04:00:18,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:00:18,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 04:00:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:00:18,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:00:19,251 INFO L272 TraceCheckUtils]: 0: Hoare triple {27650#true} call ULTIMATE.init(); {27650#true} is VALID [2022-04-28 04:00:19,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {27650#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(17, 2);call #Ultimate.allocInit(12, 3); {27650#true} is VALID [2022-04-28 04:00:19,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {27650#true} assume true; {27650#true} is VALID [2022-04-28 04:00:19,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27650#true} {27650#true} #41#return; {27650#true} is VALID [2022-04-28 04:00:19,252 INFO L272 TraceCheckUtils]: 4: Hoare triple {27650#true} call #t~ret4 := main(); {27650#true} is VALID [2022-04-28 04:00:19,252 INFO L290 TraceCheckUtils]: 5: Hoare triple {27650#true} ~x~0 := 0;~y~0 := 500000; {27680#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 04:00:19,252 INFO L290 TraceCheckUtils]: 6: Hoare triple {27680#(and (<= main_~x~0 0) (= main_~y~0 500000))} [233] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1972 v_main_~x~0_1971))) (or (and (< v_main_~x~0_1971 500001) (< v_main_~x~0_1972 v_main_~x~0_1971)) (and (<= 500000 v_main_~x~0_1972) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_1972} OutVars{main_~x~0=v_main_~x~0_1971} AuxVars[] AssignedVars[main_~x~0] {27684#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 04:00:19,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {27684#(and (= main_~y~0 500000) (< main_~x~0 500001))} [234] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27684#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 04:00:19,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {27684#(and (= main_~y~0 500000) (< main_~x~0 500001))} [235] L11-2-->L10-2_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_1974)) (.cse0 (= v_main_~x~0_1974 v_main_~x~0_1973)) (.cse1 (= v_main_~y~0_1502 v_main_~y~0_1501))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_1974 1000000)))) (and (= (+ v_main_~x~0_1973 v_main_~y~0_1502) (+ v_main_~x~0_1974 v_main_~y~0_1501)) (< v_main_~x~0_1974 v_main_~x~0_1973) (< v_main_~x~0_1973 1000001) .cse2) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1974, main_~y~0=v_main_~y~0_1502} OutVars{main_~x~0=v_main_~x~0_1973, main_~y~0=v_main_~y~0_1501} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {27691#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:00:19,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {27691#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [232] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {27695#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:00:19,255 INFO L272 TraceCheckUtils]: 10: Hoare triple {27695#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {27699#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:00:19,255 INFO L290 TraceCheckUtils]: 11: Hoare triple {27699#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {27703#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:00:19,255 INFO L290 TraceCheckUtils]: 12: Hoare triple {27703#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {27651#false} is VALID [2022-04-28 04:00:19,255 INFO L290 TraceCheckUtils]: 13: Hoare triple {27651#false} assume !false; {27651#false} is VALID [2022-04-28 04:00:19,256 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 04:00:19,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:00:19,560 INFO L290 TraceCheckUtils]: 13: Hoare triple {27651#false} assume !false; {27651#false} is VALID [2022-04-28 04:00:19,560 INFO L290 TraceCheckUtils]: 12: Hoare triple {27703#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {27651#false} is VALID [2022-04-28 04:00:19,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {27699#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {27703#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:00:19,561 INFO L272 TraceCheckUtils]: 10: Hoare triple {27658#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {27699#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:00:19,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {27722#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [232] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {27658#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:00:19,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {27726#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [235] L11-2-->L10-2_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_1974)) (.cse0 (= v_main_~x~0_1974 v_main_~x~0_1973)) (.cse1 (= v_main_~y~0_1502 v_main_~y~0_1501))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_1974 1000000)))) (and (= (+ v_main_~x~0_1973 v_main_~y~0_1502) (+ v_main_~x~0_1974 v_main_~y~0_1501)) (< v_main_~x~0_1974 v_main_~x~0_1973) (< v_main_~x~0_1973 1000001) .cse2) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1974, main_~y~0=v_main_~y~0_1502} OutVars{main_~x~0=v_main_~x~0_1973, main_~y~0=v_main_~y~0_1501} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {27722#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:00:19,563 INFO L290 TraceCheckUtils]: 7: Hoare triple {27726#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [234] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27726#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:00:19,563 INFO L290 TraceCheckUtils]: 6: Hoare triple {27733#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [233] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1972 v_main_~x~0_1971))) (or (and (< v_main_~x~0_1971 500001) (< v_main_~x~0_1972 v_main_~x~0_1971)) (and (<= 500000 v_main_~x~0_1972) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_1972} OutVars{main_~x~0=v_main_~x~0_1971} AuxVars[] AssignedVars[main_~x~0] {27726#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:00:19,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {27650#true} ~x~0 := 0;~y~0 := 500000; {27733#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:00:19,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {27650#true} call #t~ret4 := main(); {27650#true} is VALID [2022-04-28 04:00:19,564 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27650#true} {27650#true} #41#return; {27650#true} is VALID [2022-04-28 04:00:19,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {27650#true} assume true; {27650#true} is VALID [2022-04-28 04:00:19,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {27650#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(17, 2);call #Ultimate.allocInit(12, 3); {27650#true} is VALID [2022-04-28 04:00:19,564 INFO L272 TraceCheckUtils]: 0: Hoare triple {27650#true} call ULTIMATE.init(); {27650#true} is VALID [2022-04-28 04:00:19,564 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 04:00:19,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893874512] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:00:19,564 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:00:19,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 04:00:21,791 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:00:21,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1635504522] [2022-04-28 04:00:21,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1635504522] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:00:21,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:00:21,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2022-04-28 04:00:21,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309942938] [2022-04-28 04:00:21,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:00:21,792 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.9444444444444444) internal successors, (105), 53 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 04:00:21,792 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:00:21,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 55 states, 54 states have (on average 1.9444444444444444) internal successors, (105), 53 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 04:00:21,868 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 04:00:21,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-04-28 04:00:21,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:00:21,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-04-28 04:00:21,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=474, Invalid=3948, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 04:00:21,869 INFO L87 Difference]: Start difference. First operand 111 states and 114 transitions. Second operand has 55 states, 54 states have (on average 1.9444444444444444) internal successors, (105), 53 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 04:00:30,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:00:30,713 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2022-04-28 04:00:30,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-04-28 04:00:30,713 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.9444444444444444) internal successors, (105), 53 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 04:00:30,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:00:30,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.9444444444444444) internal successors, (105), 53 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 04:00:30,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 125 transitions. [2022-04-28 04:00:30,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.9444444444444444) internal successors, (105), 53 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 04:00:30,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 125 transitions. [2022-04-28 04:00:30,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 125 transitions. [2022-04-28 04:00:30,809 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 04:00:30,810 INFO L225 Difference]: With dead ends: 120 [2022-04-28 04:00:30,810 INFO L226 Difference]: Without dead ends: 113 [2022-04-28 04:00:30,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2648 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1022, Invalid=12550, Unknown=0, NotChecked=0, Total=13572 [2022-04-28 04:00:30,812 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 105 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 5008 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 5111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 5008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-28 04:00:30,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 128 Invalid, 5111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 5008 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-04-28 04:00:30,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-28 04:00:31,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-04-28 04:00:31,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:00:31,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 113 states, 108 states have (on average 1.037037037037037) internal successors, (112), 108 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:00:31,107 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 113 states, 108 states have (on average 1.037037037037037) internal successors, (112), 108 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:00:31,107 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 113 states, 108 states have (on average 1.037037037037037) internal successors, (112), 108 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:00:31,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:00:31,116 INFO L93 Difference]: Finished difference Result 113 states and 116 transitions. [2022-04-28 04:00:31,116 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 116 transitions. [2022-04-28 04:00:31,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:00:31,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:00:31,116 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 108 states have (on average 1.037037037037037) internal successors, (112), 108 states have internal predecessors, (112), 3 states have call successors, (3), 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 04:00:31,116 INFO L87 Difference]: Start difference. First operand has 113 states, 108 states have (on average 1.037037037037037) internal successors, (112), 108 states have internal predecessors, (112), 3 states have call successors, (3), 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 04:00:31,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:00:31,117 INFO L93 Difference]: Finished difference Result 113 states and 116 transitions. [2022-04-28 04:00:31,117 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 116 transitions. [2022-04-28 04:00:31,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:00:31,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:00:31,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:00:31,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:00:31,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 108 states have (on average 1.037037037037037) internal successors, (112), 108 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:00:31,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 116 transitions. [2022-04-28 04:00:31,118 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 116 transitions. Word has length 109 [2022-04-28 04:00:31,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:00:31,119 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 116 transitions. [2022-04-28 04:00:31,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 1.9444444444444444) internal successors, (105), 53 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 04:00:31,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 113 states and 116 transitions. [2022-04-28 04:00:31,214 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:00:31,214 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 116 transitions. [2022-04-28 04:00:31,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-28 04:00:31,214 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:00:31,214 INFO L195 NwaCegarLoop]: trace histogram [50, 48, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:00:31,232 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 04:00:31,415 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 04:00:31,415 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:00:31,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:00:31,415 INFO L85 PathProgramCache]: Analyzing trace with hash 52456525, now seen corresponding path program 48 times [2022-04-28 04:00:31,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:00:31,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [831124082] [2022-04-28 04:00:31,495 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 04:00:35,597 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:00:35,685 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 04:00:35,686 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:00:35,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1852564817, now seen corresponding path program 1 times [2022-04-28 04:00:35,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:00:35,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267418133] [2022-04-28 04:00:35,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:00:35,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:00:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:00:35,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:00:35,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:00:35,775 INFO L290 TraceCheckUtils]: 0: Hoare triple {28606#(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(17, 2);call #Ultimate.allocInit(12, 3); {28595#true} is VALID [2022-04-28 04:00:35,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {28595#true} assume true; {28595#true} is VALID [2022-04-28 04:00:35,775 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28595#true} {28595#true} #41#return; {28595#true} is VALID [2022-04-28 04:00:35,776 INFO L272 TraceCheckUtils]: 0: Hoare triple {28595#true} call ULTIMATE.init(); {28606#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:00:35,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {28606#(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(17, 2);call #Ultimate.allocInit(12, 3); {28595#true} is VALID [2022-04-28 04:00:35,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {28595#true} assume true; {28595#true} is VALID [2022-04-28 04:00:35,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28595#true} {28595#true} #41#return; {28595#true} is VALID [2022-04-28 04:00:35,776 INFO L272 TraceCheckUtils]: 4: Hoare triple {28595#true} call #t~ret4 := main(); {28595#true} is VALID [2022-04-28 04:00:35,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {28595#true} ~x~0 := 0;~y~0 := 500000; {28600#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 04:00:35,777 INFO L290 TraceCheckUtils]: 6: Hoare triple {28600#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [237] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2038 v_main_~x~0_2037))) (or .cse0 (and (< v_main_~x~0_2037 500001) (< v_main_~x~0_2038 v_main_~x~0_2037)) (and (not (< v_main_~x~0_2038 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_2038} OutVars{main_~x~0=v_main_~x~0_2037} AuxVars[] AssignedVars[main_~x~0] {28601#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 04:00:35,777 INFO L290 TraceCheckUtils]: 7: Hoare triple {28601#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [238] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28601#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 04:00:35,778 INFO L290 TraceCheckUtils]: 8: Hoare triple {28601#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [239] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2040 v_main_~x~0_2039)) (.cse2 (= v_main_~y~0_1558 v_main_~y~0_1557)) (.cse1 (<= 500000 v_main_~x~0_2040))) (or (and .cse0 (or (not (< v_main_~x~0_2040 1000000)) (not .cse1)) .cse2) (and .cse0 .cse2) (and .cse1 (< v_main_~x~0_2040 v_main_~x~0_2039) (= (+ v_main_~x~0_2040 v_main_~y~0_1557) (+ v_main_~x~0_2039 v_main_~y~0_1558)) (< v_main_~x~0_2039 1000001)))) InVars {main_~x~0=v_main_~x~0_2040, main_~y~0=v_main_~y~0_1558} OutVars{main_~x~0=v_main_~x~0_2039, main_~y~0=v_main_~y~0_1557} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {28602#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:00:35,778 INFO L290 TraceCheckUtils]: 9: Hoare triple {28602#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [236] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {28603#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:00:35,779 INFO L272 TraceCheckUtils]: 10: Hoare triple {28603#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {28604#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:00:35,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {28604#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {28605#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:00:35,780 INFO L290 TraceCheckUtils]: 12: Hoare triple {28605#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {28596#false} is VALID [2022-04-28 04:00:35,780 INFO L290 TraceCheckUtils]: 13: Hoare triple {28596#false} assume !false; {28596#false} is VALID [2022-04-28 04:00:35,780 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 04:00:35,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:00:35,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267418133] [2022-04-28 04:00:35,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267418133] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:00:35,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989881320] [2022-04-28 04:00:35,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:00:35,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:00:35,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:00:35,781 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 04:00:35,782 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 04:00:35,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:00:35,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 04:00:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:00:35,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:00:36,170 INFO L272 TraceCheckUtils]: 0: Hoare triple {28595#true} call ULTIMATE.init(); {28595#true} is VALID [2022-04-28 04:00:36,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {28595#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(17, 2);call #Ultimate.allocInit(12, 3); {28595#true} is VALID [2022-04-28 04:00:36,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {28595#true} assume true; {28595#true} is VALID [2022-04-28 04:00:36,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28595#true} {28595#true} #41#return; {28595#true} is VALID [2022-04-28 04:00:36,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {28595#true} call #t~ret4 := main(); {28595#true} is VALID [2022-04-28 04:00:36,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {28595#true} ~x~0 := 0;~y~0 := 500000; {28625#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 04:00:36,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {28625#(and (<= main_~x~0 0) (= main_~y~0 500000))} [237] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2038 v_main_~x~0_2037))) (or .cse0 (and (< v_main_~x~0_2037 500001) (< v_main_~x~0_2038 v_main_~x~0_2037)) (and (not (< v_main_~x~0_2038 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_2038} OutVars{main_~x~0=v_main_~x~0_2037} AuxVars[] AssignedVars[main_~x~0] {28629#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 04:00:36,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {28629#(and (= main_~y~0 500000) (< main_~x~0 500001))} [238] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28629#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 04:00:36,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {28629#(and (= main_~y~0 500000) (< main_~x~0 500001))} [239] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2040 v_main_~x~0_2039)) (.cse2 (= v_main_~y~0_1558 v_main_~y~0_1557)) (.cse1 (<= 500000 v_main_~x~0_2040))) (or (and .cse0 (or (not (< v_main_~x~0_2040 1000000)) (not .cse1)) .cse2) (and .cse0 .cse2) (and .cse1 (< v_main_~x~0_2040 v_main_~x~0_2039) (= (+ v_main_~x~0_2040 v_main_~y~0_1557) (+ v_main_~x~0_2039 v_main_~y~0_1558)) (< v_main_~x~0_2039 1000001)))) InVars {main_~x~0=v_main_~x~0_2040, main_~y~0=v_main_~y~0_1558} OutVars{main_~x~0=v_main_~x~0_2039, main_~y~0=v_main_~y~0_1557} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {28636#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:00:36,173 INFO L290 TraceCheckUtils]: 9: Hoare triple {28636#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [236] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {28640#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:00:36,173 INFO L272 TraceCheckUtils]: 10: Hoare triple {28640#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {28644#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:00:36,174 INFO L290 TraceCheckUtils]: 11: Hoare triple {28644#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {28648#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:00:36,174 INFO L290 TraceCheckUtils]: 12: Hoare triple {28648#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {28596#false} is VALID [2022-04-28 04:00:36,174 INFO L290 TraceCheckUtils]: 13: Hoare triple {28596#false} assume !false; {28596#false} is VALID [2022-04-28 04:00:36,174 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 04:00:36,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:00:36,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {28596#false} assume !false; {28596#false} is VALID [2022-04-28 04:00:36,469 INFO L290 TraceCheckUtils]: 12: Hoare triple {28648#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {28596#false} is VALID [2022-04-28 04:00:36,469 INFO L290 TraceCheckUtils]: 11: Hoare triple {28644#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {28648#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:00:36,470 INFO L272 TraceCheckUtils]: 10: Hoare triple {28603#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {28644#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:00:36,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {28667#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [236] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {28603#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:00:36,471 INFO L290 TraceCheckUtils]: 8: Hoare triple {28671#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [239] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2040 v_main_~x~0_2039)) (.cse2 (= v_main_~y~0_1558 v_main_~y~0_1557)) (.cse1 (<= 500000 v_main_~x~0_2040))) (or (and .cse0 (or (not (< v_main_~x~0_2040 1000000)) (not .cse1)) .cse2) (and .cse0 .cse2) (and .cse1 (< v_main_~x~0_2040 v_main_~x~0_2039) (= (+ v_main_~x~0_2040 v_main_~y~0_1557) (+ v_main_~x~0_2039 v_main_~y~0_1558)) (< v_main_~x~0_2039 1000001)))) InVars {main_~x~0=v_main_~x~0_2040, main_~y~0=v_main_~y~0_1558} OutVars{main_~x~0=v_main_~x~0_2039, main_~y~0=v_main_~y~0_1557} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {28667#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:00:36,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {28671#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [238] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28671#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:00:36,472 INFO L290 TraceCheckUtils]: 6: Hoare triple {28678#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [237] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2038 v_main_~x~0_2037))) (or .cse0 (and (< v_main_~x~0_2037 500001) (< v_main_~x~0_2038 v_main_~x~0_2037)) (and (not (< v_main_~x~0_2038 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_2038} OutVars{main_~x~0=v_main_~x~0_2037} AuxVars[] AssignedVars[main_~x~0] {28671#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:00:36,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {28595#true} ~x~0 := 0;~y~0 := 500000; {28678#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 04:00:36,472 INFO L272 TraceCheckUtils]: 4: Hoare triple {28595#true} call #t~ret4 := main(); {28595#true} is VALID [2022-04-28 04:00:36,473 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28595#true} {28595#true} #41#return; {28595#true} is VALID [2022-04-28 04:00:36,473 INFO L290 TraceCheckUtils]: 2: Hoare triple {28595#true} assume true; {28595#true} is VALID [2022-04-28 04:00:36,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {28595#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(17, 2);call #Ultimate.allocInit(12, 3); {28595#true} is VALID [2022-04-28 04:00:36,473 INFO L272 TraceCheckUtils]: 0: Hoare triple {28595#true} call ULTIMATE.init(); {28595#true} is VALID [2022-04-28 04:00:36,473 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 04:00:36,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989881320] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:00:36,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:00:36,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 04:00:38,861 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:00:38,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [831124082] [2022-04-28 04:00:38,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [831124082] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:00:38,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:00:38,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2022-04-28 04:00:38,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395472187] [2022-04-28 04:00:38,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:00:38,862 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 54 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 04:00:38,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:00:38,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 56 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 54 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 04:00:38,948 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 04:00:38,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-04-28 04:00:38,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:00:38,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-04-28 04:00:38,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=482, Invalid=4074, Unknown=0, NotChecked=0, Total=4556 [2022-04-28 04:00:38,950 INFO L87 Difference]: Start difference. First operand 113 states and 116 transitions. Second operand has 56 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 54 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 04:00:48,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:00:48,469 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2022-04-28 04:00:48,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-04-28 04:00:48,469 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 54 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 04:00:48,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:00:48,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 54 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 04:00:48,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 127 transitions. [2022-04-28 04:00:48,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 54 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 04:00:48,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 127 transitions. [2022-04-28 04:00:48,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 127 transitions. [2022-04-28 04:00:48,569 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:00:48,570 INFO L225 Difference]: With dead ends: 122 [2022-04-28 04:00:48,570 INFO L226 Difference]: Without dead ends: 115 [2022-04-28 04:00:48,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2725 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1041, Invalid=13001, Unknown=0, NotChecked=0, Total=14042 [2022-04-28 04:00:48,571 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 107 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 5381 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 5486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 5381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:00:48,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 208 Invalid, 5486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 5381 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-28 04:00:48,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-28 04:00:48,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-04-28 04:00:48,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:00:48,879 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 115 states, 110 states have (on average 1.0363636363636364) internal successors, (114), 110 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:00:48,879 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 115 states, 110 states have (on average 1.0363636363636364) internal successors, (114), 110 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:00:48,879 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 115 states, 110 states have (on average 1.0363636363636364) internal successors, (114), 110 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:00:48,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:00:48,880 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2022-04-28 04:00:48,880 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 118 transitions. [2022-04-28 04:00:48,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:00:48,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:00:48,880 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 110 states have (on average 1.0363636363636364) internal successors, (114), 110 states have internal predecessors, (114), 3 states have call successors, (3), 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 115 states. [2022-04-28 04:00:48,880 INFO L87 Difference]: Start difference. First operand has 115 states, 110 states have (on average 1.0363636363636364) internal successors, (114), 110 states have internal predecessors, (114), 3 states have call successors, (3), 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 115 states. [2022-04-28 04:00:48,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:00:48,881 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2022-04-28 04:00:48,881 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 118 transitions. [2022-04-28 04:00:48,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:00:48,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:00:48,881 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:00:48,881 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:00:48,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.0363636363636364) internal successors, (114), 110 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:00:48,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 118 transitions. [2022-04-28 04:00:48,882 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 118 transitions. Word has length 111 [2022-04-28 04:00:48,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:00:48,882 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 118 transitions. [2022-04-28 04:00:48,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 54 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 04:00:48,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 115 states and 118 transitions. [2022-04-28 04:00:48,983 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 04:00:48,984 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 118 transitions. [2022-04-28 04:00:48,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-28 04:00:48,984 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:00:48,984 INFO L195 NwaCegarLoop]: trace histogram [51, 49, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:00:49,000 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 04:00:49,184 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 04:00:49,185 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:00:49,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:00:49,185 INFO L85 PathProgramCache]: Analyzing trace with hash -892454168, now seen corresponding path program 49 times [2022-04-28 04:00:49,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:00:49,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1623426349] [2022-04-28 04:00:51,561 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 04:00:51,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 04:00:51,771 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:00:51,773 INFO L85 PathProgramCache]: Analyzing trace with hash 196967343, now seen corresponding path program 1 times [2022-04-28 04:00:51,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:00:51,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763818052] [2022-04-28 04:00:51,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:00:51,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:00:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:00:51,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:00:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:00:51,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {29566#(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(17, 2);call #Ultimate.allocInit(12, 3); {29555#true} is VALID [2022-04-28 04:00:51,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {29555#true} assume true; {29555#true} is VALID [2022-04-28 04:00:51,861 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29555#true} {29555#true} #41#return; {29555#true} is VALID [2022-04-28 04:00:51,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {29555#true} call ULTIMATE.init(); {29566#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:00:51,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {29566#(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(17, 2);call #Ultimate.allocInit(12, 3); {29555#true} is VALID [2022-04-28 04:00:51,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {29555#true} assume true; {29555#true} is VALID [2022-04-28 04:00:51,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29555#true} {29555#true} #41#return; {29555#true} is VALID [2022-04-28 04:00:51,861 INFO L272 TraceCheckUtils]: 4: Hoare triple {29555#true} call #t~ret4 := main(); {29555#true} is VALID [2022-04-28 04:00:51,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {29555#true} ~x~0 := 0;~y~0 := 500000; {29560#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 04:00:51,862 INFO L290 TraceCheckUtils]: 6: Hoare triple {29560#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [241] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2105 v_main_~x~0_2104))) (or .cse0 (and .cse0 (<= 500000 v_main_~x~0_2105)) (and (< v_main_~x~0_2105 v_main_~x~0_2104) (< v_main_~x~0_2104 500001)))) InVars {main_~x~0=v_main_~x~0_2105} OutVars{main_~x~0=v_main_~x~0_2104} AuxVars[] AssignedVars[main_~x~0] {29561#(or (<= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 04:00:51,863 INFO L290 TraceCheckUtils]: 7: Hoare triple {29561#(or (<= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [242] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29561#(or (<= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 04:00:51,863 INFO L290 TraceCheckUtils]: 8: Hoare triple {29561#(or (<= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [243] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2107 v_main_~x~0_2106)) (.cse1 (= v_main_~y~0_1615 v_main_~y~0_1614)) (.cse2 (<= 500000 v_main_~x~0_2107))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_2107 1000000)))) (and .cse0 .cse1) (let ((.cse3 (+ v_main_~x~0_2107 v_main_~y~0_1614))) (and .cse2 (< v_main_~y~0_1615 v_main_~y~0_1614) (< .cse3 (+ 1000001 v_main_~y~0_1615)) (= (+ v_main_~x~0_2106 v_main_~y~0_1615) .cse3))))) InVars {main_~x~0=v_main_~x~0_2107, main_~y~0=v_main_~y~0_1615} OutVars{main_~x~0=v_main_~x~0_2106, main_~y~0=v_main_~y~0_1614} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {29562#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:00:51,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {29562#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [240] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {29563#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:00:51,864 INFO L272 TraceCheckUtils]: 10: Hoare triple {29563#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {29564#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:00:51,865 INFO L290 TraceCheckUtils]: 11: Hoare triple {29564#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {29565#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:00:51,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {29565#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {29556#false} is VALID [2022-04-28 04:00:51,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {29556#false} assume !false; {29556#false} is VALID [2022-04-28 04:00:51,865 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 04:00:51,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:00:51,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763818052] [2022-04-28 04:00:51,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763818052] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:00:51,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986418873] [2022-04-28 04:00:51,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:00:51,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:00:51,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:00:51,866 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 04:00:51,867 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 04:00:51,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:00:51,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 04:00:51,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:00:51,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:00:52,241 INFO L272 TraceCheckUtils]: 0: Hoare triple {29555#true} call ULTIMATE.init(); {29555#true} is VALID [2022-04-28 04:00:52,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {29555#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(17, 2);call #Ultimate.allocInit(12, 3); {29555#true} is VALID [2022-04-28 04:00:52,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {29555#true} assume true; {29555#true} is VALID [2022-04-28 04:00:52,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29555#true} {29555#true} #41#return; {29555#true} is VALID [2022-04-28 04:00:52,242 INFO L272 TraceCheckUtils]: 4: Hoare triple {29555#true} call #t~ret4 := main(); {29555#true} is VALID [2022-04-28 04:00:52,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {29555#true} ~x~0 := 0;~y~0 := 500000; {29585#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 04:00:52,243 INFO L290 TraceCheckUtils]: 6: Hoare triple {29585#(and (<= main_~x~0 0) (= main_~y~0 500000))} [241] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2105 v_main_~x~0_2104))) (or .cse0 (and .cse0 (<= 500000 v_main_~x~0_2105)) (and (< v_main_~x~0_2105 v_main_~x~0_2104) (< v_main_~x~0_2104 500001)))) InVars {main_~x~0=v_main_~x~0_2105} OutVars{main_~x~0=v_main_~x~0_2104} AuxVars[] AssignedVars[main_~x~0] {29589#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 04:00:52,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {29589#(and (= main_~y~0 500000) (< main_~x~0 500001))} [242] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29589#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 04:00:52,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {29589#(and (= main_~y~0 500000) (< main_~x~0 500001))} [243] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2107 v_main_~x~0_2106)) (.cse1 (= v_main_~y~0_1615 v_main_~y~0_1614)) (.cse2 (<= 500000 v_main_~x~0_2107))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_2107 1000000)))) (and .cse0 .cse1) (let ((.cse3 (+ v_main_~x~0_2107 v_main_~y~0_1614))) (and .cse2 (< v_main_~y~0_1615 v_main_~y~0_1614) (< .cse3 (+ 1000001 v_main_~y~0_1615)) (= (+ v_main_~x~0_2106 v_main_~y~0_1615) .cse3))))) InVars {main_~x~0=v_main_~x~0_2107, main_~y~0=v_main_~y~0_1615} OutVars{main_~x~0=v_main_~x~0_2106, main_~y~0=v_main_~y~0_1614} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {29596#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:00:52,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {29596#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [240] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {29600#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:00:52,245 INFO L272 TraceCheckUtils]: 10: Hoare triple {29600#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {29604#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:00:52,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {29604#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {29608#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:00:52,245 INFO L290 TraceCheckUtils]: 12: Hoare triple {29608#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29556#false} is VALID [2022-04-28 04:00:52,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {29556#false} assume !false; {29556#false} is VALID [2022-04-28 04:00:52,246 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 04:00:52,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:00:52,524 INFO L290 TraceCheckUtils]: 13: Hoare triple {29556#false} assume !false; {29556#false} is VALID [2022-04-28 04:00:52,525 INFO L290 TraceCheckUtils]: 12: Hoare triple {29608#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29556#false} is VALID [2022-04-28 04:00:52,525 INFO L290 TraceCheckUtils]: 11: Hoare triple {29604#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {29608#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:00:52,526 INFO L272 TraceCheckUtils]: 10: Hoare triple {29563#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {29604#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:00:52,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {29562#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [240] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {29563#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:00:52,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {29630#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [243] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2107 v_main_~x~0_2106)) (.cse1 (= v_main_~y~0_1615 v_main_~y~0_1614)) (.cse2 (<= 500000 v_main_~x~0_2107))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_2107 1000000)))) (and .cse0 .cse1) (let ((.cse3 (+ v_main_~x~0_2107 v_main_~y~0_1614))) (and .cse2 (< v_main_~y~0_1615 v_main_~y~0_1614) (< .cse3 (+ 1000001 v_main_~y~0_1615)) (= (+ v_main_~x~0_2106 v_main_~y~0_1615) .cse3))))) InVars {main_~x~0=v_main_~x~0_2107, main_~y~0=v_main_~y~0_1615} OutVars{main_~x~0=v_main_~x~0_2106, main_~y~0=v_main_~y~0_1614} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {29562#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:00:52,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {29630#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [242] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29630#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:00:52,528 INFO L290 TraceCheckUtils]: 6: Hoare triple {29637#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [241] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2105 v_main_~x~0_2104))) (or .cse0 (and .cse0 (<= 500000 v_main_~x~0_2105)) (and (< v_main_~x~0_2105 v_main_~x~0_2104) (< v_main_~x~0_2104 500001)))) InVars {main_~x~0=v_main_~x~0_2105} OutVars{main_~x~0=v_main_~x~0_2104} AuxVars[] AssignedVars[main_~x~0] {29630#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:00:52,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {29555#true} ~x~0 := 0;~y~0 := 500000; {29637#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 04:00:52,529 INFO L272 TraceCheckUtils]: 4: Hoare triple {29555#true} call #t~ret4 := main(); {29555#true} is VALID [2022-04-28 04:00:52,529 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29555#true} {29555#true} #41#return; {29555#true} is VALID [2022-04-28 04:00:52,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {29555#true} assume true; {29555#true} is VALID [2022-04-28 04:00:52,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {29555#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(17, 2);call #Ultimate.allocInit(12, 3); {29555#true} is VALID [2022-04-28 04:00:52,529 INFO L272 TraceCheckUtils]: 0: Hoare triple {29555#true} call ULTIMATE.init(); {29555#true} is VALID [2022-04-28 04:00:52,529 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 04:00:52,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986418873] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:00:52,529 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:00:52,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 04:00:54,948 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:00:54,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1623426349] [2022-04-28 04:00:54,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1623426349] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:00:54,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:00:54,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2022-04-28 04:00:54,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887615720] [2022-04-28 04:00:54,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:00:54,949 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.9464285714285714) internal successors, (109), 55 states have internal predecessors, (109), 2 states have call successors, (3), 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 113 [2022-04-28 04:00:54,949 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:00:54,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 57 states, 56 states have (on average 1.9464285714285714) internal successors, (109), 55 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:00:55,032 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 04:00:55,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-04-28 04:00:55,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:00:55,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-04-28 04:00:55,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=427, Invalid=4129, Unknown=0, NotChecked=0, Total=4556 [2022-04-28 04:00:55,033 INFO L87 Difference]: Start difference. First operand 115 states and 118 transitions. Second operand has 57 states, 56 states have (on average 1.9464285714285714) internal successors, (109), 55 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:04,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:01:04,897 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2022-04-28 04:01:04,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-04-28 04:01:04,897 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.9464285714285714) internal successors, (109), 55 states have internal predecessors, (109), 2 states have call successors, (3), 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 113 [2022-04-28 04:01:04,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:01:04,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.9464285714285714) internal successors, (109), 55 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:04,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 129 transitions. [2022-04-28 04:01:04,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.9464285714285714) internal successors, (109), 55 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:04,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 129 transitions. [2022-04-28 04:01:04,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 129 transitions. [2022-04-28 04:01:04,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:01:05,000 INFO L225 Difference]: With dead ends: 124 [2022-04-28 04:01:05,000 INFO L226 Difference]: Without dead ends: 117 [2022-04-28 04:01:05,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 71 SyntacticMatches, 4 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2690 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=945, Invalid=13335, Unknown=0, NotChecked=0, Total=14280 [2022-04-28 04:01:05,002 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 109 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 5648 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 5755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 5648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-28 04:01:05,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 238 Invalid, 5755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 5648 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-04-28 04:01:05,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-04-28 04:01:05,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-04-28 04:01:05,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:01:05,312 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 04:01:05,312 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 04:01:05,312 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 04:01:05,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:01:05,313 INFO L93 Difference]: Finished difference Result 117 states and 120 transitions. [2022-04-28 04:01:05,313 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 120 transitions. [2022-04-28 04:01:05,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:01:05,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:01:05,313 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 04:01:05,313 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 04:01:05,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:01:05,314 INFO L93 Difference]: Finished difference Result 117 states and 120 transitions. [2022-04-28 04:01:05,314 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 120 transitions. [2022-04-28 04:01:05,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:01:05,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:01:05,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:01:05,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:01:05,314 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 04:01:05,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 120 transitions. [2022-04-28 04:01:05,315 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 120 transitions. Word has length 113 [2022-04-28 04:01:05,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:01:05,316 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 120 transitions. [2022-04-28 04:01:05,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.9464285714285714) internal successors, (109), 55 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:05,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 117 states and 120 transitions. [2022-04-28 04:01:05,418 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 04:01:05,418 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 120 transitions. [2022-04-28 04:01:05,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-28 04:01:05,419 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:01:05,419 INFO L195 NwaCegarLoop]: trace histogram [52, 50, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:01:05,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-04-28 04:01:05,619 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 04:01:05,619 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:01:05,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:01:05,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1581436611, now seen corresponding path program 50 times [2022-04-28 04:01:05,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:01:05,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [432913080] [2022-04-28 04:01:05,725 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 04:01:05,935 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 04:01:05,936 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:01:05,938 INFO L85 PathProgramCache]: Analyzing trace with hash -2048467793, now seen corresponding path program 1 times [2022-04-28 04:01:05,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:01:05,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121277429] [2022-04-28 04:01:05,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:01:05,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:01:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:01:06,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:01:06,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:01:06,040 INFO L290 TraceCheckUtils]: 0: Hoare triple {30540#(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(17, 2);call #Ultimate.allocInit(12, 3); {30529#true} is VALID [2022-04-28 04:01:06,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {30529#true} assume true; {30529#true} is VALID [2022-04-28 04:01:06,040 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30529#true} {30529#true} #41#return; {30529#true} is VALID [2022-04-28 04:01:06,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {30529#true} call ULTIMATE.init(); {30540#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:01:06,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {30540#(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(17, 2);call #Ultimate.allocInit(12, 3); {30529#true} is VALID [2022-04-28 04:01:06,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {30529#true} assume true; {30529#true} is VALID [2022-04-28 04:01:06,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30529#true} {30529#true} #41#return; {30529#true} is VALID [2022-04-28 04:01:06,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {30529#true} call #t~ret4 := main(); {30529#true} is VALID [2022-04-28 04:01:06,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {30529#true} ~x~0 := 0;~y~0 := 500000; {30534#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 04:01:06,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {30534#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [245] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2173 v_main_~x~0_2172))) (or (and (not (< v_main_~x~0_2173 500000)) .cse0) .cse0 (and (< v_main_~x~0_2172 500001) (< v_main_~x~0_2173 v_main_~x~0_2172)))) InVars {main_~x~0=v_main_~x~0_2173} OutVars{main_~x~0=v_main_~x~0_2172} AuxVars[] AssignedVars[main_~x~0] {30535#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 04:01:06,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {30535#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [246] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30535#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 04:01:06,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {30535#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [247] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_2175)) (.cse2 (= v_main_~x~0_2175 v_main_~x~0_2174)) (.cse3 (= v_main_~y~0_1673 v_main_~y~0_1672))) (or (let ((.cse1 (+ v_main_~x~0_2175 v_main_~y~0_1672))) (and (< v_main_~y~0_1673 v_main_~y~0_1672) .cse0 (< .cse1 (+ 1000001 v_main_~y~0_1673)) (= (+ v_main_~x~0_2174 v_main_~y~0_1673) .cse1))) (and .cse2 .cse3) (and (or (not (< v_main_~x~0_2175 1000000)) (not .cse0)) .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_2175, main_~y~0=v_main_~y~0_1673} OutVars{main_~x~0=v_main_~x~0_2174, main_~y~0=v_main_~y~0_1672} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {30536#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 04:01:06,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {30536#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [244] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {30537#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-28 04:01:06,045 INFO L272 TraceCheckUtils]: 10: Hoare triple {30537#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {30538#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:01:06,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {30538#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {30539#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:01:06,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {30539#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {30530#false} is VALID [2022-04-28 04:01:06,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {30530#false} assume !false; {30530#false} is VALID [2022-04-28 04:01:06,046 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 04:01:06,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:01:06,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121277429] [2022-04-28 04:01:06,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121277429] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:01:06,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561600738] [2022-04-28 04:01:06,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:01:06,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:01:06,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:01:06,047 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 04:01:06,048 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 04:01:06,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:01:06,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 04:01:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:01:06,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:01:06,409 INFO L272 TraceCheckUtils]: 0: Hoare triple {30529#true} call ULTIMATE.init(); {30529#true} is VALID [2022-04-28 04:01:06,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {30529#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(17, 2);call #Ultimate.allocInit(12, 3); {30529#true} is VALID [2022-04-28 04:01:06,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {30529#true} assume true; {30529#true} is VALID [2022-04-28 04:01:06,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30529#true} {30529#true} #41#return; {30529#true} is VALID [2022-04-28 04:01:06,409 INFO L272 TraceCheckUtils]: 4: Hoare triple {30529#true} call #t~ret4 := main(); {30529#true} is VALID [2022-04-28 04:01:06,409 INFO L290 TraceCheckUtils]: 5: Hoare triple {30529#true} ~x~0 := 0;~y~0 := 500000; {30559#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 04:01:06,410 INFO L290 TraceCheckUtils]: 6: Hoare triple {30559#(and (<= main_~x~0 0) (= main_~y~0 500000))} [245] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2173 v_main_~x~0_2172))) (or (and (not (< v_main_~x~0_2173 500000)) .cse0) .cse0 (and (< v_main_~x~0_2172 500001) (< v_main_~x~0_2173 v_main_~x~0_2172)))) InVars {main_~x~0=v_main_~x~0_2173} OutVars{main_~x~0=v_main_~x~0_2172} AuxVars[] AssignedVars[main_~x~0] {30563#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 04:01:06,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {30563#(and (= main_~y~0 500000) (< main_~x~0 500001))} [246] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30563#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 04:01:06,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {30563#(and (= main_~y~0 500000) (< main_~x~0 500001))} [247] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_2175)) (.cse2 (= v_main_~x~0_2175 v_main_~x~0_2174)) (.cse3 (= v_main_~y~0_1673 v_main_~y~0_1672))) (or (let ((.cse1 (+ v_main_~x~0_2175 v_main_~y~0_1672))) (and (< v_main_~y~0_1673 v_main_~y~0_1672) .cse0 (< .cse1 (+ 1000001 v_main_~y~0_1673)) (= (+ v_main_~x~0_2174 v_main_~y~0_1673) .cse1))) (and .cse2 .cse3) (and (or (not (< v_main_~x~0_2175 1000000)) (not .cse0)) .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_2175, main_~y~0=v_main_~y~0_1673} OutVars{main_~x~0=v_main_~x~0_2174, main_~y~0=v_main_~y~0_1672} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {30570#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:01:06,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {30570#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [244] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {30574#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:01:06,412 INFO L272 TraceCheckUtils]: 10: Hoare triple {30574#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {30578#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:01:06,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {30578#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {30582#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:01:06,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {30582#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {30530#false} is VALID [2022-04-28 04:01:06,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {30530#false} assume !false; {30530#false} is VALID [2022-04-28 04:01:06,413 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 04:01:06,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:01:06,718 INFO L290 TraceCheckUtils]: 13: Hoare triple {30530#false} assume !false; {30530#false} is VALID [2022-04-28 04:01:06,719 INFO L290 TraceCheckUtils]: 12: Hoare triple {30582#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {30530#false} is VALID [2022-04-28 04:01:06,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {30578#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {30582#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:01:06,720 INFO L272 TraceCheckUtils]: 10: Hoare triple {30537#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {30578#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:01:06,720 INFO L290 TraceCheckUtils]: 9: Hoare triple {30601#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [244] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {30537#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-28 04:01:06,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {30605#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [247] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_2175)) (.cse2 (= v_main_~x~0_2175 v_main_~x~0_2174)) (.cse3 (= v_main_~y~0_1673 v_main_~y~0_1672))) (or (let ((.cse1 (+ v_main_~x~0_2175 v_main_~y~0_1672))) (and (< v_main_~y~0_1673 v_main_~y~0_1672) .cse0 (< .cse1 (+ 1000001 v_main_~y~0_1673)) (= (+ v_main_~x~0_2174 v_main_~y~0_1673) .cse1))) (and .cse2 .cse3) (and (or (not (< v_main_~x~0_2175 1000000)) (not .cse0)) .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_2175, main_~y~0=v_main_~y~0_1673} OutVars{main_~x~0=v_main_~x~0_2174, main_~y~0=v_main_~y~0_1672} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {30601#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 04:01:06,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {30605#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [246] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30605#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 04:01:06,722 INFO L290 TraceCheckUtils]: 6: Hoare triple {30612#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))))} [245] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2173 v_main_~x~0_2172))) (or (and (not (< v_main_~x~0_2173 500000)) .cse0) .cse0 (and (< v_main_~x~0_2172 500001) (< v_main_~x~0_2173 v_main_~x~0_2172)))) InVars {main_~x~0=v_main_~x~0_2173} OutVars{main_~x~0=v_main_~x~0_2172} AuxVars[] AssignedVars[main_~x~0] {30605#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 04:01:06,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {30529#true} ~x~0 := 0;~y~0 := 500000; {30612#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))))} is VALID [2022-04-28 04:01:06,723 INFO L272 TraceCheckUtils]: 4: Hoare triple {30529#true} call #t~ret4 := main(); {30529#true} is VALID [2022-04-28 04:01:06,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30529#true} {30529#true} #41#return; {30529#true} is VALID [2022-04-28 04:01:06,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {30529#true} assume true; {30529#true} is VALID [2022-04-28 04:01:06,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {30529#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(17, 2);call #Ultimate.allocInit(12, 3); {30529#true} is VALID [2022-04-28 04:01:06,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {30529#true} call ULTIMATE.init(); {30529#true} is VALID [2022-04-28 04:01:06,723 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 04:01:06,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561600738] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:01:06,723 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:01:06,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 04:01:09,200 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:01:09,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [432913080] [2022-04-28 04:01:09,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [432913080] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:01:09,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:01:09,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2022-04-28 04:01:09,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69962337] [2022-04-28 04:01:09,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:01:09,201 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 04:01:09,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:01:09,201 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 04:01:09,280 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 04:01:09,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-04-28 04:01:09,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:01:09,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-04-28 04:01:09,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=4332, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 04:01:09,281 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 04:01:19,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:01:19,643 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2022-04-28 04:01:19,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-04-28 04:01:19,643 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 04:01:19,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:01:19,644 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 04:01:19,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 131 transitions. [2022-04-28 04:01:19,644 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 04:01:19,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 131 transitions. [2022-04-28 04:01:19,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 131 transitions. [2022-04-28 04:01:19,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:01:19,747 INFO L225 Difference]: With dead ends: 126 [2022-04-28 04:01:19,747 INFO L226 Difference]: Without dead ends: 119 [2022-04-28 04:01:19,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2882 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1079, Invalid=13927, Unknown=0, NotChecked=0, Total=15006 [2022-04-28 04:01:19,749 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 111 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 5842 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 5951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 5842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-28 04:01:19,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 233 Invalid, 5951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 5842 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-04-28 04:01:19,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-28 04:01:20,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-04-28 04:01:20,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:01:20,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 119 states, 114 states have (on average 1.0350877192982457) internal successors, (118), 114 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:20,060 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 119 states, 114 states have (on average 1.0350877192982457) internal successors, (118), 114 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:20,060 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 119 states, 114 states have (on average 1.0350877192982457) internal successors, (118), 114 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:20,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:01:20,061 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2022-04-28 04:01:20,061 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 122 transitions. [2022-04-28 04:01:20,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:01:20,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:01:20,061 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 114 states have (on average 1.0350877192982457) internal successors, (118), 114 states have internal predecessors, (118), 3 states have call successors, (3), 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 119 states. [2022-04-28 04:01:20,061 INFO L87 Difference]: Start difference. First operand has 119 states, 114 states have (on average 1.0350877192982457) internal successors, (118), 114 states have internal predecessors, (118), 3 states have call successors, (3), 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 119 states. [2022-04-28 04:01:20,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:01:20,062 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2022-04-28 04:01:20,062 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 122 transitions. [2022-04-28 04:01:20,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:01:20,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:01:20,062 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:01:20,062 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:01:20,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.0350877192982457) internal successors, (118), 114 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:20,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 122 transitions. [2022-04-28 04:01:20,063 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 122 transitions. Word has length 115 [2022-04-28 04:01:20,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:01:20,064 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 122 transitions. [2022-04-28 04:01:20,064 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 04:01:20,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 122 transitions. [2022-04-28 04:01:20,166 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:01:20,167 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 122 transitions. [2022-04-28 04:01:20,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-28 04:01:20,167 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:01:20,167 INFO L195 NwaCegarLoop]: trace histogram [53, 51, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:01:20,185 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 04:01:20,367 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 04:01:20,368 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:01:20,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:01:20,368 INFO L85 PathProgramCache]: Analyzing trace with hash -421406754, now seen corresponding path program 51 times [2022-04-28 04:01:20,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:01:20,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1687824813] [2022-04-28 04:01:20,460 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 04:01:20,659 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 04:01:20,660 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:01:20,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1064367, now seen corresponding path program 1 times [2022-04-28 04:01:20,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:01:20,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156159524] [2022-04-28 04:01:20,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:01:20,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:01:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:01:20,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:01:20,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:01:20,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {31530#(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(17, 2);call #Ultimate.allocInit(12, 3); {31519#true} is VALID [2022-04-28 04:01:20,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {31519#true} assume true; {31519#true} is VALID [2022-04-28 04:01:20,766 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31519#true} {31519#true} #41#return; {31519#true} is VALID [2022-04-28 04:01:20,766 INFO L272 TraceCheckUtils]: 0: Hoare triple {31519#true} call ULTIMATE.init(); {31530#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:01:20,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {31530#(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(17, 2);call #Ultimate.allocInit(12, 3); {31519#true} is VALID [2022-04-28 04:01:20,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {31519#true} assume true; {31519#true} is VALID [2022-04-28 04:01:20,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31519#true} {31519#true} #41#return; {31519#true} is VALID [2022-04-28 04:01:20,767 INFO L272 TraceCheckUtils]: 4: Hoare triple {31519#true} call #t~ret4 := main(); {31519#true} is VALID [2022-04-28 04:01:20,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {31519#true} ~x~0 := 0;~y~0 := 500000; {31524#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 04:01:20,768 INFO L290 TraceCheckUtils]: 6: Hoare triple {31524#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [249] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2242 v_main_~x~0_2241))) (or (and .cse0 (<= 500000 v_main_~x~0_2242)) (and (< v_main_~x~0_2242 v_main_~x~0_2241) (< v_main_~x~0_2241 500001)) .cse0)) InVars {main_~x~0=v_main_~x~0_2242} OutVars{main_~x~0=v_main_~x~0_2241} AuxVars[] AssignedVars[main_~x~0] {31525#(or (<= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 04:01:20,768 INFO L290 TraceCheckUtils]: 7: Hoare triple {31525#(or (<= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [250] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31525#(or (<= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 04:01:20,769 INFO L290 TraceCheckUtils]: 8: Hoare triple {31525#(or (<= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [251] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_2244)) (.cse0 (= v_main_~y~0_1732 v_main_~y~0_1731)) (.cse2 (= v_main_~x~0_2244 v_main_~x~0_2243))) (or (and .cse0 (or (not (< v_main_~x~0_2244 1000000)) (not .cse1)) .cse2) (let ((.cse3 (+ v_main_~x~0_2244 v_main_~y~0_1731))) (and (< v_main_~y~0_1732 v_main_~y~0_1731) .cse1 (= .cse3 (+ v_main_~x~0_2243 v_main_~y~0_1732)) (< .cse3 (+ 1000001 v_main_~y~0_1732)))) (and .cse0 .cse2))) InVars {main_~x~0=v_main_~x~0_2244, main_~y~0=v_main_~y~0_1732} OutVars{main_~x~0=v_main_~x~0_2243, main_~y~0=v_main_~y~0_1731} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {31526#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:01:20,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {31526#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [248] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {31527#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:01:20,770 INFO L272 TraceCheckUtils]: 10: Hoare triple {31527#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {31528#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:01:20,770 INFO L290 TraceCheckUtils]: 11: Hoare triple {31528#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {31529#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:01:20,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {31529#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {31520#false} is VALID [2022-04-28 04:01:20,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {31520#false} assume !false; {31520#false} is VALID [2022-04-28 04:01:20,771 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 04:01:20,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:01:20,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156159524] [2022-04-28 04:01:20,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156159524] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:01:20,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594992068] [2022-04-28 04:01:20,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:01:20,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:01:20,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:01:20,784 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:01:20,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-04-28 04:01:20,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:01:20,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 04:01:20,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:01:20,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:01:21,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {31519#true} call ULTIMATE.init(); {31519#true} is VALID [2022-04-28 04:01:21,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {31519#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(17, 2);call #Ultimate.allocInit(12, 3); {31519#true} is VALID [2022-04-28 04:01:21,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {31519#true} assume true; {31519#true} is VALID [2022-04-28 04:01:21,153 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31519#true} {31519#true} #41#return; {31519#true} is VALID [2022-04-28 04:01:21,153 INFO L272 TraceCheckUtils]: 4: Hoare triple {31519#true} call #t~ret4 := main(); {31519#true} is VALID [2022-04-28 04:01:21,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {31519#true} ~x~0 := 0;~y~0 := 500000; {31549#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 04:01:21,154 INFO L290 TraceCheckUtils]: 6: Hoare triple {31549#(and (<= main_~x~0 0) (= main_~y~0 500000))} [249] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2242 v_main_~x~0_2241))) (or (and .cse0 (<= 500000 v_main_~x~0_2242)) (and (< v_main_~x~0_2242 v_main_~x~0_2241) (< v_main_~x~0_2241 500001)) .cse0)) InVars {main_~x~0=v_main_~x~0_2242} OutVars{main_~x~0=v_main_~x~0_2241} AuxVars[] AssignedVars[main_~x~0] {31553#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 04:01:21,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {31553#(and (= main_~y~0 500000) (< main_~x~0 500001))} [250] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31553#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 04:01:21,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {31553#(and (= main_~y~0 500000) (< main_~x~0 500001))} [251] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_2244)) (.cse0 (= v_main_~y~0_1732 v_main_~y~0_1731)) (.cse2 (= v_main_~x~0_2244 v_main_~x~0_2243))) (or (and .cse0 (or (not (< v_main_~x~0_2244 1000000)) (not .cse1)) .cse2) (let ((.cse3 (+ v_main_~x~0_2244 v_main_~y~0_1731))) (and (< v_main_~y~0_1732 v_main_~y~0_1731) .cse1 (= .cse3 (+ v_main_~x~0_2243 v_main_~y~0_1732)) (< .cse3 (+ 1000001 v_main_~y~0_1732)))) (and .cse0 .cse2))) InVars {main_~x~0=v_main_~x~0_2244, main_~y~0=v_main_~y~0_1732} OutVars{main_~x~0=v_main_~x~0_2243, main_~y~0=v_main_~y~0_1731} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {31560#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:01:21,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {31560#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [248] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {31564#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:01:21,156 INFO L272 TraceCheckUtils]: 10: Hoare triple {31564#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {31568#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:01:21,156 INFO L290 TraceCheckUtils]: 11: Hoare triple {31568#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {31572#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:01:21,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {31572#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {31520#false} is VALID [2022-04-28 04:01:21,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {31520#false} assume !false; {31520#false} is VALID [2022-04-28 04:01:21,157 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 04:01:21,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:01:21,473 INFO L290 TraceCheckUtils]: 13: Hoare triple {31520#false} assume !false; {31520#false} is VALID [2022-04-28 04:01:21,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {31572#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {31520#false} is VALID [2022-04-28 04:01:21,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {31568#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {31572#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:01:21,474 INFO L272 TraceCheckUtils]: 10: Hoare triple {31527#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {31568#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:01:21,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {31526#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [248] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {31527#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:01:21,475 INFO L290 TraceCheckUtils]: 8: Hoare triple {31594#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [251] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_2244)) (.cse0 (= v_main_~y~0_1732 v_main_~y~0_1731)) (.cse2 (= v_main_~x~0_2244 v_main_~x~0_2243))) (or (and .cse0 (or (not (< v_main_~x~0_2244 1000000)) (not .cse1)) .cse2) (let ((.cse3 (+ v_main_~x~0_2244 v_main_~y~0_1731))) (and (< v_main_~y~0_1732 v_main_~y~0_1731) .cse1 (= .cse3 (+ v_main_~x~0_2243 v_main_~y~0_1732)) (< .cse3 (+ 1000001 v_main_~y~0_1732)))) (and .cse0 .cse2))) InVars {main_~x~0=v_main_~x~0_2244, main_~y~0=v_main_~y~0_1732} OutVars{main_~x~0=v_main_~x~0_2243, main_~y~0=v_main_~y~0_1731} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {31526#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:01:21,476 INFO L290 TraceCheckUtils]: 7: Hoare triple {31594#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [250] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31594#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:01:21,476 INFO L290 TraceCheckUtils]: 6: Hoare triple {31601#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [249] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2242 v_main_~x~0_2241))) (or (and .cse0 (<= 500000 v_main_~x~0_2242)) (and (< v_main_~x~0_2242 v_main_~x~0_2241) (< v_main_~x~0_2241 500001)) .cse0)) InVars {main_~x~0=v_main_~x~0_2242} OutVars{main_~x~0=v_main_~x~0_2241} AuxVars[] AssignedVars[main_~x~0] {31594#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:01:21,477 INFO L290 TraceCheckUtils]: 5: Hoare triple {31519#true} ~x~0 := 0;~y~0 := 500000; {31601#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:01:21,477 INFO L272 TraceCheckUtils]: 4: Hoare triple {31519#true} call #t~ret4 := main(); {31519#true} is VALID [2022-04-28 04:01:21,477 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31519#true} {31519#true} #41#return; {31519#true} is VALID [2022-04-28 04:01:21,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {31519#true} assume true; {31519#true} is VALID [2022-04-28 04:01:21,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {31519#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(17, 2);call #Ultimate.allocInit(12, 3); {31519#true} is VALID [2022-04-28 04:01:21,477 INFO L272 TraceCheckUtils]: 0: Hoare triple {31519#true} call ULTIMATE.init(); {31519#true} is VALID [2022-04-28 04:01:21,477 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 04:01:21,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594992068] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:01:21,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:01:21,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 04:01:24,003 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:01:24,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1687824813] [2022-04-28 04:01:24,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1687824813] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:01:24,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:01:24,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2022-04-28 04:01:24,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828309497] [2022-04-28 04:01:24,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:01:24,004 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 57 states have internal predecessors, (113), 2 states have call successors, (3), 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 117 [2022-04-28 04:01:24,004 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:01:24,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 59 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 57 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:24,087 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 04:01:24,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-04-28 04:01:24,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:01:24,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-04-28 04:01:24,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=4389, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 04:01:24,088 INFO L87 Difference]: Start difference. First operand 119 states and 122 transitions. Second operand has 59 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 57 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:34,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:01:34,190 INFO L93 Difference]: Finished difference Result 128 states and 133 transitions. [2022-04-28 04:01:34,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-04-28 04:01:34,190 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 57 states have internal predecessors, (113), 2 states have call successors, (3), 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 117 [2022-04-28 04:01:34,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:01:34,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 57 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:34,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 133 transitions. [2022-04-28 04:01:34,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 57 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:34,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 133 transitions. [2022-04-28 04:01:34,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 133 transitions. [2022-04-28 04:01:34,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:01:34,299 INFO L225 Difference]: With dead ends: 128 [2022-04-28 04:01:34,299 INFO L226 Difference]: Without dead ends: 121 [2022-04-28 04:01:34,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 73 SyntacticMatches, 4 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2845 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=979, Invalid=14273, Unknown=0, NotChecked=0, Total=15252 [2022-04-28 04:01:34,301 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 113 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5732 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 5843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 5732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-28 04:01:34,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 88 Invalid, 5843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 5732 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-04-28 04:01:34,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-04-28 04:01:34,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-04-28 04:01:34,639 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:01:34,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 121 states, 116 states have (on average 1.0344827586206897) internal successors, (120), 116 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:34,639 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 121 states, 116 states have (on average 1.0344827586206897) internal successors, (120), 116 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:34,640 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 121 states, 116 states have (on average 1.0344827586206897) internal successors, (120), 116 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:34,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:01:34,641 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2022-04-28 04:01:34,641 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 124 transitions. [2022-04-28 04:01:34,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:01:34,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:01:34,641 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 116 states have (on average 1.0344827586206897) internal successors, (120), 116 states have internal predecessors, (120), 3 states have call successors, (3), 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 121 states. [2022-04-28 04:01:34,641 INFO L87 Difference]: Start difference. First operand has 121 states, 116 states have (on average 1.0344827586206897) internal successors, (120), 116 states have internal predecessors, (120), 3 states have call successors, (3), 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 121 states. [2022-04-28 04:01:34,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:01:34,642 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2022-04-28 04:01:34,642 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 124 transitions. [2022-04-28 04:01:34,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:01:34,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:01:34,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:01:34,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:01:34,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.0344827586206897) internal successors, (120), 116 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:34,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 124 transitions. [2022-04-28 04:01:34,643 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 124 transitions. Word has length 117 [2022-04-28 04:01:34,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:01:34,644 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 124 transitions. [2022-04-28 04:01:34,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 57 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:34,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 124 transitions. [2022-04-28 04:01:34,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:01:34,751 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 124 transitions. [2022-04-28 04:01:34,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-28 04:01:34,752 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:01:34,752 INFO L195 NwaCegarLoop]: trace histogram [54, 52, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:01:34,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2022-04-28 04:01:34,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:01:34,952 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:01:34,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:01:34,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1008531911, now seen corresponding path program 52 times [2022-04-28 04:01:34,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:01:34,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [929373457] [2022-04-28 04:01:39,022 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:01:39,067 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 04:01:43,183 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:01:43,296 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 04:01:43,297 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:01:43,299 INFO L85 PathProgramCache]: Analyzing trace with hash 2050596527, now seen corresponding path program 1 times [2022-04-28 04:01:43,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:01:43,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028626744] [2022-04-28 04:01:43,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:01:43,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:01:43,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:01:43,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:01:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:01:43,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {32534#(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(17, 2);call #Ultimate.allocInit(12, 3); {32523#true} is VALID [2022-04-28 04:01:43,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {32523#true} assume true; {32523#true} is VALID [2022-04-28 04:01:43,380 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32523#true} {32523#true} #41#return; {32523#true} is VALID [2022-04-28 04:01:43,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {32523#true} call ULTIMATE.init(); {32534#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:01:43,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {32534#(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(17, 2);call #Ultimate.allocInit(12, 3); {32523#true} is VALID [2022-04-28 04:01:43,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {32523#true} assume true; {32523#true} is VALID [2022-04-28 04:01:43,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32523#true} {32523#true} #41#return; {32523#true} is VALID [2022-04-28 04:01:43,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {32523#true} call #t~ret4 := main(); {32523#true} is VALID [2022-04-28 04:01:43,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {32523#true} ~x~0 := 0;~y~0 := 500000; {32528#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 04:01:43,382 INFO L290 TraceCheckUtils]: 6: Hoare triple {32528#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [253] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2312 v_main_~x~0_2311))) (or (and (<= 500000 v_main_~x~0_2312) .cse0) (and (< v_main_~x~0_2312 v_main_~x~0_2311) (< v_main_~x~0_2311 500001)) .cse0)) InVars {main_~x~0=v_main_~x~0_2312} OutVars{main_~x~0=v_main_~x~0_2311} AuxVars[] AssignedVars[main_~x~0] {32529#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 04:01:43,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {32529#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [254] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32529#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 04:01:43,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {32529#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [255] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2314 v_main_~x~0_2313)) (.cse1 (= v_main_~y~0_1792 v_main_~y~0_1791)) (.cse2 (<= 500000 v_main_~x~0_2314))) (or (and .cse0 .cse1) (and .cse2 (= (+ v_main_~x~0_2313 v_main_~y~0_1792) (+ v_main_~x~0_2314 v_main_~y~0_1791)) (< v_main_~x~0_2314 v_main_~x~0_2313) (< v_main_~x~0_2313 1000001)) (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_2314 1000000)))))) InVars {main_~x~0=v_main_~x~0_2314, main_~y~0=v_main_~y~0_1792} OutVars{main_~x~0=v_main_~x~0_2313, main_~y~0=v_main_~y~0_1791} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {32530#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:01:43,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {32530#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [252] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {32531#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:01:43,384 INFO L272 TraceCheckUtils]: 10: Hoare triple {32531#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {32532#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:01:43,384 INFO L290 TraceCheckUtils]: 11: Hoare triple {32532#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {32533#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:01:43,385 INFO L290 TraceCheckUtils]: 12: Hoare triple {32533#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {32524#false} is VALID [2022-04-28 04:01:43,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {32524#false} assume !false; {32524#false} is VALID [2022-04-28 04:01:43,385 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 04:01:43,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:01:43,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028626744] [2022-04-28 04:01:43,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028626744] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:01:43,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336700983] [2022-04-28 04:01:43,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:01:43,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:01:43,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:01:43,386 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:01:43,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-04-28 04:01:43,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:01:43,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 04:01:43,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:01:43,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:01:43,765 INFO L272 TraceCheckUtils]: 0: Hoare triple {32523#true} call ULTIMATE.init(); {32523#true} is VALID [2022-04-28 04:01:43,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {32523#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(17, 2);call #Ultimate.allocInit(12, 3); {32523#true} is VALID [2022-04-28 04:01:43,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {32523#true} assume true; {32523#true} is VALID [2022-04-28 04:01:43,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32523#true} {32523#true} #41#return; {32523#true} is VALID [2022-04-28 04:01:43,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {32523#true} call #t~ret4 := main(); {32523#true} is VALID [2022-04-28 04:01:43,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {32523#true} ~x~0 := 0;~y~0 := 500000; {32553#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 04:01:43,767 INFO L290 TraceCheckUtils]: 6: Hoare triple {32553#(and (<= main_~x~0 0) (= main_~y~0 500000))} [253] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2312 v_main_~x~0_2311))) (or (and (<= 500000 v_main_~x~0_2312) .cse0) (and (< v_main_~x~0_2312 v_main_~x~0_2311) (< v_main_~x~0_2311 500001)) .cse0)) InVars {main_~x~0=v_main_~x~0_2312} OutVars{main_~x~0=v_main_~x~0_2311} AuxVars[] AssignedVars[main_~x~0] {32557#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 04:01:43,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {32557#(and (= main_~y~0 500000) (< main_~x~0 500001))} [254] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32557#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 04:01:43,768 INFO L290 TraceCheckUtils]: 8: Hoare triple {32557#(and (= main_~y~0 500000) (< main_~x~0 500001))} [255] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2314 v_main_~x~0_2313)) (.cse1 (= v_main_~y~0_1792 v_main_~y~0_1791)) (.cse2 (<= 500000 v_main_~x~0_2314))) (or (and .cse0 .cse1) (and .cse2 (= (+ v_main_~x~0_2313 v_main_~y~0_1792) (+ v_main_~x~0_2314 v_main_~y~0_1791)) (< v_main_~x~0_2314 v_main_~x~0_2313) (< v_main_~x~0_2313 1000001)) (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_2314 1000000)))))) InVars {main_~x~0=v_main_~x~0_2314, main_~y~0=v_main_~y~0_1792} OutVars{main_~x~0=v_main_~x~0_2313, main_~y~0=v_main_~y~0_1791} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {32564#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:01:43,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {32564#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [252] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {32568#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:01:43,769 INFO L272 TraceCheckUtils]: 10: Hoare triple {32568#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {32572#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:01:43,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {32572#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {32576#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:01:43,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {32576#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {32524#false} is VALID [2022-04-28 04:01:43,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {32524#false} assume !false; {32524#false} is VALID [2022-04-28 04:01:43,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:01:43,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:01:44,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {32524#false} assume !false; {32524#false} is VALID [2022-04-28 04:01:44,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {32576#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {32524#false} is VALID [2022-04-28 04:01:44,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {32572#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {32576#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:01:44,085 INFO L272 TraceCheckUtils]: 10: Hoare triple {32531#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {32572#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:01:44,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {32595#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [252] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {32531#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:01:44,086 INFO L290 TraceCheckUtils]: 8: Hoare triple {32599#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [255] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2314 v_main_~x~0_2313)) (.cse1 (= v_main_~y~0_1792 v_main_~y~0_1791)) (.cse2 (<= 500000 v_main_~x~0_2314))) (or (and .cse0 .cse1) (and .cse2 (= (+ v_main_~x~0_2313 v_main_~y~0_1792) (+ v_main_~x~0_2314 v_main_~y~0_1791)) (< v_main_~x~0_2314 v_main_~x~0_2313) (< v_main_~x~0_2313 1000001)) (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_2314 1000000)))))) InVars {main_~x~0=v_main_~x~0_2314, main_~y~0=v_main_~y~0_1792} OutVars{main_~x~0=v_main_~x~0_2313, main_~y~0=v_main_~y~0_1791} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {32595#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:01:44,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {32599#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [254] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32599#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:01:44,087 INFO L290 TraceCheckUtils]: 6: Hoare triple {32606#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [253] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2312 v_main_~x~0_2311))) (or (and (<= 500000 v_main_~x~0_2312) .cse0) (and (< v_main_~x~0_2312 v_main_~x~0_2311) (< v_main_~x~0_2311 500001)) .cse0)) InVars {main_~x~0=v_main_~x~0_2312} OutVars{main_~x~0=v_main_~x~0_2311} AuxVars[] AssignedVars[main_~x~0] {32599#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:01:44,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {32523#true} ~x~0 := 0;~y~0 := 500000; {32606#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:01:44,088 INFO L272 TraceCheckUtils]: 4: Hoare triple {32523#true} call #t~ret4 := main(); {32523#true} is VALID [2022-04-28 04:01:44,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32523#true} {32523#true} #41#return; {32523#true} is VALID [2022-04-28 04:01:44,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {32523#true} assume true; {32523#true} is VALID [2022-04-28 04:01:44,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {32523#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(17, 2);call #Ultimate.allocInit(12, 3); {32523#true} is VALID [2022-04-28 04:01:44,088 INFO L272 TraceCheckUtils]: 0: Hoare triple {32523#true} call ULTIMATE.init(); {32523#true} is VALID [2022-04-28 04:01:44,088 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 04:01:44,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336700983] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:01:44,088 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:01:44,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 04:01:46,773 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:01:46,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [929373457] [2022-04-28 04:01:46,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [929373457] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:01:46,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:01:46,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-04-28 04:01:46,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360133098] [2022-04-28 04:01:46,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:01:46,774 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 1.9491525423728813) internal successors, (115), 58 states have internal predecessors, (115), 2 states have call successors, (3), 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 119 [2022-04-28 04:01:46,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:01:46,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 60 states, 59 states have (on average 1.9491525423728813) internal successors, (115), 58 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:46,875 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 04:01:46,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-04-28 04:01:46,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:01:46,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-04-28 04:01:46,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=514, Invalid=4598, Unknown=0, NotChecked=0, Total=5112 [2022-04-28 04:01:46,877 INFO L87 Difference]: Start difference. First operand 121 states and 124 transitions. Second operand has 60 states, 59 states have (on average 1.9491525423728813) internal successors, (115), 58 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:58,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:01:58,269 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2022-04-28 04:01:58,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-04-28 04:01:58,269 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 1.9491525423728813) internal successors, (115), 58 states have internal predecessors, (115), 2 states have call successors, (3), 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 119 [2022-04-28 04:01:58,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:01:58,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.9491525423728813) internal successors, (115), 58 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:58,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 135 transitions. [2022-04-28 04:01:58,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.9491525423728813) internal successors, (115), 58 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:58,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 135 transitions. [2022-04-28 04:01:58,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 135 transitions. [2022-04-28 04:01:58,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:01:58,385 INFO L225 Difference]: With dead ends: 130 [2022-04-28 04:01:58,386 INFO L226 Difference]: Without dead ends: 123 [2022-04-28 04:01:58,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3043 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1117, Invalid=14885, Unknown=0, NotChecked=0, Total=16002 [2022-04-28 04:01:58,387 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 115 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 6297 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 6410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 6297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-04-28 04:01:58,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 248 Invalid, 6410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 6297 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-04-28 04:01:58,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-04-28 04:01:58,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2022-04-28 04:01:58,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:01:58,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand has 123 states, 118 states have (on average 1.0338983050847457) internal successors, (122), 118 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:58,727 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand has 123 states, 118 states have (on average 1.0338983050847457) internal successors, (122), 118 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:58,728 INFO L87 Difference]: Start difference. First operand 123 states. Second operand has 123 states, 118 states have (on average 1.0338983050847457) internal successors, (122), 118 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:58,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:01:58,729 INFO L93 Difference]: Finished difference Result 123 states and 126 transitions. [2022-04-28 04:01:58,729 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 126 transitions. [2022-04-28 04:01:58,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:01:58,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:01:58,729 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 118 states have (on average 1.0338983050847457) internal successors, (122), 118 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 123 states. [2022-04-28 04:01:58,729 INFO L87 Difference]: Start difference. First operand has 123 states, 118 states have (on average 1.0338983050847457) internal successors, (122), 118 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 123 states. [2022-04-28 04:01:58,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:01:58,730 INFO L93 Difference]: Finished difference Result 123 states and 126 transitions. [2022-04-28 04:01:58,730 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 126 transitions. [2022-04-28 04:01:58,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:01:58,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:01:58,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:01:58,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:01:58,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 118 states have (on average 1.0338983050847457) internal successors, (122), 118 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:58,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 126 transitions. [2022-04-28 04:01:58,731 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 126 transitions. Word has length 119 [2022-04-28 04:01:58,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:01:58,731 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 126 transitions. [2022-04-28 04:01:58,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 1.9491525423728813) internal successors, (115), 58 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:58,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 123 states and 126 transitions. [2022-04-28 04:01:58,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:01:58,849 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 126 transitions. [2022-04-28 04:01:58,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-28 04:01:58,850 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:01:58,850 INFO L195 NwaCegarLoop]: trace histogram [55, 53, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:01:58,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-04-28 04:01:59,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-04-28 04:01:59,050 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:01:59,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:01:59,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1699875284, now seen corresponding path program 53 times [2022-04-28 04:01:59,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:01:59,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1107941404] [2022-04-28 04:01:59,144 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 04:02:03,272 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:02:03,371 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 04:02:03,372 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:02:03,374 INFO L85 PathProgramCache]: Analyzing trace with hash -194838609, now seen corresponding path program 1 times [2022-04-28 04:02:03,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:02:03,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386450732] [2022-04-28 04:02:03,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:02:03,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:02:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:02:03,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:02:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:02:03,450 INFO L290 TraceCheckUtils]: 0: Hoare triple {33554#(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(17, 2);call #Ultimate.allocInit(12, 3); {33543#true} is VALID [2022-04-28 04:02:03,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {33543#true} assume true; {33543#true} is VALID [2022-04-28 04:02:03,450 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33543#true} {33543#true} #41#return; {33543#true} is VALID [2022-04-28 04:02:03,450 INFO L272 TraceCheckUtils]: 0: Hoare triple {33543#true} call ULTIMATE.init(); {33554#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:02:03,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {33554#(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(17, 2);call #Ultimate.allocInit(12, 3); {33543#true} is VALID [2022-04-28 04:02:03,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {33543#true} assume true; {33543#true} is VALID [2022-04-28 04:02:03,451 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33543#true} {33543#true} #41#return; {33543#true} is VALID [2022-04-28 04:02:03,451 INFO L272 TraceCheckUtils]: 4: Hoare triple {33543#true} call #t~ret4 := main(); {33543#true} is VALID [2022-04-28 04:02:03,451 INFO L290 TraceCheckUtils]: 5: Hoare triple {33543#true} ~x~0 := 0;~y~0 := 500000; {33548#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 04:02:03,452 INFO L290 TraceCheckUtils]: 6: Hoare triple {33548#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [257] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2383 v_main_~x~0_2382))) (or (and (< v_main_~x~0_2382 500001) (< v_main_~x~0_2383 v_main_~x~0_2382)) (and (not (< v_main_~x~0_2383 500000)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_2383} OutVars{main_~x~0=v_main_~x~0_2382} AuxVars[] AssignedVars[main_~x~0] {33549#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 04:02:03,452 INFO L290 TraceCheckUtils]: 7: Hoare triple {33549#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [258] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33549#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 04:02:03,453 INFO L290 TraceCheckUtils]: 8: Hoare triple {33549#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [259] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2385 v_main_~x~0_2384)) (.cse2 (<= 500000 v_main_~x~0_2385)) (.cse1 (= v_main_~y~0_1853 v_main_~y~0_1852))) (or (and .cse0 .cse1) (and .cse2 (= (+ v_main_~x~0_2385 v_main_~y~0_1852) (+ v_main_~x~0_2384 v_main_~y~0_1853)) (< v_main_~x~0_2385 v_main_~x~0_2384) (< v_main_~x~0_2384 1000001)) (and .cse0 (or (not (< v_main_~x~0_2385 1000000)) (not .cse2)) .cse1))) InVars {main_~x~0=v_main_~x~0_2385, main_~y~0=v_main_~y~0_1853} OutVars{main_~x~0=v_main_~x~0_2384, main_~y~0=v_main_~y~0_1852} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {33550#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:02:03,453 INFO L290 TraceCheckUtils]: 9: Hoare triple {33550#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [256] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {33551#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:02:03,454 INFO L272 TraceCheckUtils]: 10: Hoare triple {33551#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {33552#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:02:03,454 INFO L290 TraceCheckUtils]: 11: Hoare triple {33552#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {33553#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:02:03,454 INFO L290 TraceCheckUtils]: 12: Hoare triple {33553#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {33544#false} is VALID [2022-04-28 04:02:03,454 INFO L290 TraceCheckUtils]: 13: Hoare triple {33544#false} assume !false; {33544#false} is VALID [2022-04-28 04:02:03,454 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 04:02:03,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:02:03,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386450732] [2022-04-28 04:02:03,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386450732] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:02:03,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889891253] [2022-04-28 04:02:03,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:02:03,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:02:03,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:02:03,456 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:02:03,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-04-28 04:02:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:02:03,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 04:02:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:02:03,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:02:03,817 INFO L272 TraceCheckUtils]: 0: Hoare triple {33543#true} call ULTIMATE.init(); {33543#true} is VALID [2022-04-28 04:02:03,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {33543#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(17, 2);call #Ultimate.allocInit(12, 3); {33543#true} is VALID [2022-04-28 04:02:03,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {33543#true} assume true; {33543#true} is VALID [2022-04-28 04:02:03,817 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33543#true} {33543#true} #41#return; {33543#true} is VALID [2022-04-28 04:02:03,817 INFO L272 TraceCheckUtils]: 4: Hoare triple {33543#true} call #t~ret4 := main(); {33543#true} is VALID [2022-04-28 04:02:03,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {33543#true} ~x~0 := 0;~y~0 := 500000; {33573#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 04:02:03,818 INFO L290 TraceCheckUtils]: 6: Hoare triple {33573#(and (<= main_~x~0 0) (= main_~y~0 500000))} [257] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2383 v_main_~x~0_2382))) (or (and (< v_main_~x~0_2382 500001) (< v_main_~x~0_2383 v_main_~x~0_2382)) (and (not (< v_main_~x~0_2383 500000)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_2383} OutVars{main_~x~0=v_main_~x~0_2382} AuxVars[] AssignedVars[main_~x~0] {33577#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 04:02:03,818 INFO L290 TraceCheckUtils]: 7: Hoare triple {33577#(and (= main_~y~0 500000) (< main_~x~0 500001))} [258] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33577#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 04:02:03,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {33577#(and (= main_~y~0 500000) (< main_~x~0 500001))} [259] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2385 v_main_~x~0_2384)) (.cse2 (<= 500000 v_main_~x~0_2385)) (.cse1 (= v_main_~y~0_1853 v_main_~y~0_1852))) (or (and .cse0 .cse1) (and .cse2 (= (+ v_main_~x~0_2385 v_main_~y~0_1852) (+ v_main_~x~0_2384 v_main_~y~0_1853)) (< v_main_~x~0_2385 v_main_~x~0_2384) (< v_main_~x~0_2384 1000001)) (and .cse0 (or (not (< v_main_~x~0_2385 1000000)) (not .cse2)) .cse1))) InVars {main_~x~0=v_main_~x~0_2385, main_~y~0=v_main_~y~0_1853} OutVars{main_~x~0=v_main_~x~0_2384, main_~y~0=v_main_~y~0_1852} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {33584#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:02:03,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {33584#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [256] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {33588#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:02:03,820 INFO L272 TraceCheckUtils]: 10: Hoare triple {33588#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {33592#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:02:03,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {33592#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {33596#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:02:03,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {33596#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {33544#false} is VALID [2022-04-28 04:02:03,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {33544#false} assume !false; {33544#false} is VALID [2022-04-28 04:02:03,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 04:02:03,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:02:04,125 INFO L290 TraceCheckUtils]: 13: Hoare triple {33544#false} assume !false; {33544#false} is VALID [2022-04-28 04:02:04,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {33596#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {33544#false} is VALID [2022-04-28 04:02:04,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {33592#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {33596#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:02:04,126 INFO L272 TraceCheckUtils]: 10: Hoare triple {33551#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {33592#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:02:04,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {33615#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [256] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {33551#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:02:04,127 INFO L290 TraceCheckUtils]: 8: Hoare triple {33619#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [259] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2385 v_main_~x~0_2384)) (.cse2 (<= 500000 v_main_~x~0_2385)) (.cse1 (= v_main_~y~0_1853 v_main_~y~0_1852))) (or (and .cse0 .cse1) (and .cse2 (= (+ v_main_~x~0_2385 v_main_~y~0_1852) (+ v_main_~x~0_2384 v_main_~y~0_1853)) (< v_main_~x~0_2385 v_main_~x~0_2384) (< v_main_~x~0_2384 1000001)) (and .cse0 (or (not (< v_main_~x~0_2385 1000000)) (not .cse2)) .cse1))) InVars {main_~x~0=v_main_~x~0_2385, main_~y~0=v_main_~y~0_1853} OutVars{main_~x~0=v_main_~x~0_2384, main_~y~0=v_main_~y~0_1852} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {33615#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:02:04,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {33619#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [258] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33619#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:02:04,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {33626#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [257] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2383 v_main_~x~0_2382))) (or (and (< v_main_~x~0_2382 500001) (< v_main_~x~0_2383 v_main_~x~0_2382)) (and (not (< v_main_~x~0_2383 500000)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_2383} OutVars{main_~x~0=v_main_~x~0_2382} AuxVars[] AssignedVars[main_~x~0] {33619#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:02:04,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {33543#true} ~x~0 := 0;~y~0 := 500000; {33626#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 04:02:04,129 INFO L272 TraceCheckUtils]: 4: Hoare triple {33543#true} call #t~ret4 := main(); {33543#true} is VALID [2022-04-28 04:02:04,129 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33543#true} {33543#true} #41#return; {33543#true} is VALID [2022-04-28 04:02:04,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {33543#true} assume true; {33543#true} is VALID [2022-04-28 04:02:04,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {33543#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(17, 2);call #Ultimate.allocInit(12, 3); {33543#true} is VALID [2022-04-28 04:02:04,129 INFO L272 TraceCheckUtils]: 0: Hoare triple {33543#true} call ULTIMATE.init(); {33543#true} is VALID [2022-04-28 04:02:04,129 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 04:02:04,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889891253] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:02:04,129 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:02:04,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 04:02:06,689 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:02:06,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1107941404] [2022-04-28 04:02:06,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1107941404] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:02:06,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:02:06,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2022-04-28 04:02:06,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286289161] [2022-04-28 04:02:06,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:02:06,690 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 1.95) internal successors, (117), 59 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2022-04-28 04:02:06,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:02:06,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 61 states, 60 states have (on average 1.95) internal successors, (117), 59 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:02:06,772 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 04:02:06,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-04-28 04:02:06,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:02:06,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-04-28 04:02:06,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=522, Invalid=4734, Unknown=0, NotChecked=0, Total=5256 [2022-04-28 04:02:06,773 INFO L87 Difference]: Start difference. First operand 123 states and 126 transitions. Second operand has 61 states, 60 states have (on average 1.95) internal successors, (117), 59 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:02:17,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:02:17,901 INFO L93 Difference]: Finished difference Result 132 states and 137 transitions. [2022-04-28 04:02:17,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-04-28 04:02:17,902 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 1.95) internal successors, (117), 59 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2022-04-28 04:02:17,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:02:17,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.95) internal successors, (117), 59 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:02:17,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 137 transitions. [2022-04-28 04:02:17,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.95) internal successors, (117), 59 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:02:17,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 137 transitions. [2022-04-28 04:02:17,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 137 transitions. [2022-04-28 04:02:18,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:02:18,009 INFO L225 Difference]: With dead ends: 132 [2022-04-28 04:02:18,009 INFO L226 Difference]: Without dead ends: 125 [2022-04-28 04:02:18,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3125 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1136, Invalid=15376, Unknown=0, NotChecked=0, Total=16512 [2022-04-28 04:02:18,010 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 117 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 6624 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 6739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 6624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-04-28 04:02:18,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 298 Invalid, 6739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 6624 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-04-28 04:02:18,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-04-28 04:02:18,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-04-28 04:02:18,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:02:18,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 125 states, 120 states have (on average 1.0333333333333334) internal successors, (124), 120 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:02:18,338 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 125 states, 120 states have (on average 1.0333333333333334) internal successors, (124), 120 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:02:18,338 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 125 states, 120 states have (on average 1.0333333333333334) internal successors, (124), 120 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:02:18,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:02:18,339 INFO L93 Difference]: Finished difference Result 125 states and 128 transitions. [2022-04-28 04:02:18,339 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 128 transitions. [2022-04-28 04:02:18,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:02:18,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:02:18,339 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 120 states have (on average 1.0333333333333334) internal successors, (124), 120 states have internal predecessors, (124), 3 states have call successors, (3), 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 125 states. [2022-04-28 04:02:18,339 INFO L87 Difference]: Start difference. First operand has 125 states, 120 states have (on average 1.0333333333333334) internal successors, (124), 120 states have internal predecessors, (124), 3 states have call successors, (3), 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 125 states. [2022-04-28 04:02:18,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:02:18,340 INFO L93 Difference]: Finished difference Result 125 states and 128 transitions. [2022-04-28 04:02:18,340 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 128 transitions. [2022-04-28 04:02:18,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:02:18,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:02:18,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:02:18,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:02:18,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 120 states have (on average 1.0333333333333334) internal successors, (124), 120 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:02:18,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 128 transitions. [2022-04-28 04:02:18,342 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 128 transitions. Word has length 121 [2022-04-28 04:02:18,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:02:18,342 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 128 transitions. [2022-04-28 04:02:18,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 1.95) internal successors, (117), 59 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:02:18,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 125 states and 128 transitions. [2022-04-28 04:02:18,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:02:18,446 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 128 transitions. [2022-04-28 04:02:18,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-28 04:02:18,446 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:02:18,446 INFO L195 NwaCegarLoop]: trace histogram [56, 54, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:02:18,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-04-28 04:02:18,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-04-28 04:02:18,646 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:02:18,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:02:18,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1729008303, now seen corresponding path program 54 times [2022-04-28 04:02:18,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:02:18,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2087770564] [2022-04-28 04:02:20,749 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 04:02:20,933 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 04:02:20,934 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:02:20,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1854693551, now seen corresponding path program 1 times [2022-04-28 04:02:20,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:02:20,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233788175] [2022-04-28 04:02:20,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:02:20,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:02:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:02:21,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:02:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:02:21,011 INFO L290 TraceCheckUtils]: 0: Hoare triple {34589#(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(17, 2);call #Ultimate.allocInit(12, 3); {34578#true} is VALID [2022-04-28 04:02:21,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {34578#true} assume true; {34578#true} is VALID [2022-04-28 04:02:21,011 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34578#true} {34578#true} #41#return; {34578#true} is VALID [2022-04-28 04:02:21,012 INFO L272 TraceCheckUtils]: 0: Hoare triple {34578#true} call ULTIMATE.init(); {34589#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:02:21,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {34589#(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(17, 2);call #Ultimate.allocInit(12, 3); {34578#true} is VALID [2022-04-28 04:02:21,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {34578#true} assume true; {34578#true} is VALID [2022-04-28 04:02:21,012 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34578#true} {34578#true} #41#return; {34578#true} is VALID [2022-04-28 04:02:21,012 INFO L272 TraceCheckUtils]: 4: Hoare triple {34578#true} call #t~ret4 := main(); {34578#true} is VALID [2022-04-28 04:02:21,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {34578#true} ~x~0 := 0;~y~0 := 500000; {34583#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 04:02:21,013 INFO L290 TraceCheckUtils]: 6: Hoare triple {34583#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [261] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2455 v_main_~x~0_2454))) (or (and (< v_main_~x~0_2454 500001) (< v_main_~x~0_2455 v_main_~x~0_2454)) (and (not (< v_main_~x~0_2455 500000)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_2455} OutVars{main_~x~0=v_main_~x~0_2454} AuxVars[] AssignedVars[main_~x~0] {34584#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 04:02:21,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {34584#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [262] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34584#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 04:02:21,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {34584#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [263] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2457 v_main_~x~0_2456)) (.cse1 (= v_main_~y~0_1915 v_main_~y~0_1914)) (.cse2 (<= 500000 v_main_~x~0_2457))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_2457 1000000)))) (and .cse0 .cse1) (and (< v_main_~x~0_2457 v_main_~x~0_2456) (= (+ v_main_~x~0_2457 v_main_~y~0_1914) (+ v_main_~x~0_2456 v_main_~y~0_1915)) .cse2 (< v_main_~x~0_2456 1000001)))) InVars {main_~x~0=v_main_~x~0_2457, main_~y~0=v_main_~y~0_1915} OutVars{main_~x~0=v_main_~x~0_2456, main_~y~0=v_main_~y~0_1914} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {34585#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:02:21,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {34585#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [260] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {34586#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:02:21,015 INFO L272 TraceCheckUtils]: 10: Hoare triple {34586#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {34587#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:02:21,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {34587#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {34588#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:02:21,016 INFO L290 TraceCheckUtils]: 12: Hoare triple {34588#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {34579#false} is VALID [2022-04-28 04:02:21,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {34579#false} assume !false; {34579#false} is VALID [2022-04-28 04:02:21,016 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 04:02:21,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:02:21,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233788175] [2022-04-28 04:02:21,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233788175] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:02:21,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86741066] [2022-04-28 04:02:21,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:02:21,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:02:21,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:02:21,027 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:02:21,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-04-28 04:02:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:02:21,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 04:02:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:02:21,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:02:21,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {34578#true} call ULTIMATE.init(); {34578#true} is VALID [2022-04-28 04:02:21,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {34578#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(17, 2);call #Ultimate.allocInit(12, 3); {34578#true} is VALID [2022-04-28 04:02:21,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {34578#true} assume true; {34578#true} is VALID [2022-04-28 04:02:21,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34578#true} {34578#true} #41#return; {34578#true} is VALID [2022-04-28 04:02:21,372 INFO L272 TraceCheckUtils]: 4: Hoare triple {34578#true} call #t~ret4 := main(); {34578#true} is VALID [2022-04-28 04:02:21,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {34578#true} ~x~0 := 0;~y~0 := 500000; {34608#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 04:02:21,373 INFO L290 TraceCheckUtils]: 6: Hoare triple {34608#(and (<= main_~x~0 0) (= main_~y~0 500000))} [261] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2455 v_main_~x~0_2454))) (or (and (< v_main_~x~0_2454 500001) (< v_main_~x~0_2455 v_main_~x~0_2454)) (and (not (< v_main_~x~0_2455 500000)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_2455} OutVars{main_~x~0=v_main_~x~0_2454} AuxVars[] AssignedVars[main_~x~0] {34612#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 04:02:21,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {34612#(and (= main_~y~0 500000) (< main_~x~0 500001))} [262] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34612#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 04:02:21,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {34612#(and (= main_~y~0 500000) (< main_~x~0 500001))} [263] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2457 v_main_~x~0_2456)) (.cse1 (= v_main_~y~0_1915 v_main_~y~0_1914)) (.cse2 (<= 500000 v_main_~x~0_2457))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_2457 1000000)))) (and .cse0 .cse1) (and (< v_main_~x~0_2457 v_main_~x~0_2456) (= (+ v_main_~x~0_2457 v_main_~y~0_1914) (+ v_main_~x~0_2456 v_main_~y~0_1915)) .cse2 (< v_main_~x~0_2456 1000001)))) InVars {main_~x~0=v_main_~x~0_2457, main_~y~0=v_main_~y~0_1915} OutVars{main_~x~0=v_main_~x~0_2456, main_~y~0=v_main_~y~0_1914} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {34619#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:02:21,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {34619#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [260] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {34623#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:02:21,375 INFO L272 TraceCheckUtils]: 10: Hoare triple {34623#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {34627#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:02:21,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {34627#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {34631#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:02:21,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {34631#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {34579#false} is VALID [2022-04-28 04:02:21,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {34579#false} assume !false; {34579#false} is VALID [2022-04-28 04:02:21,376 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 04:02:21,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:02:21,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {34579#false} assume !false; {34579#false} is VALID [2022-04-28 04:02:21,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {34631#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {34579#false} is VALID [2022-04-28 04:02:21,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {34627#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {34631#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:02:21,677 INFO L272 TraceCheckUtils]: 10: Hoare triple {34586#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {34627#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:02:21,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {34650#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [260] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {34586#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:02:21,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {34654#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [263] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2457 v_main_~x~0_2456)) (.cse1 (= v_main_~y~0_1915 v_main_~y~0_1914)) (.cse2 (<= 500000 v_main_~x~0_2457))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_2457 1000000)))) (and .cse0 .cse1) (and (< v_main_~x~0_2457 v_main_~x~0_2456) (= (+ v_main_~x~0_2457 v_main_~y~0_1914) (+ v_main_~x~0_2456 v_main_~y~0_1915)) .cse2 (< v_main_~x~0_2456 1000001)))) InVars {main_~x~0=v_main_~x~0_2457, main_~y~0=v_main_~y~0_1915} OutVars{main_~x~0=v_main_~x~0_2456, main_~y~0=v_main_~y~0_1914} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {34650#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:02:21,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {34654#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [262] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34654#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:02:21,679 INFO L290 TraceCheckUtils]: 6: Hoare triple {34661#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [261] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2455 v_main_~x~0_2454))) (or (and (< v_main_~x~0_2454 500001) (< v_main_~x~0_2455 v_main_~x~0_2454)) (and (not (< v_main_~x~0_2455 500000)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_2455} OutVars{main_~x~0=v_main_~x~0_2454} AuxVars[] AssignedVars[main_~x~0] {34654#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:02:21,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {34578#true} ~x~0 := 0;~y~0 := 500000; {34661#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:02:21,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {34578#true} call #t~ret4 := main(); {34578#true} is VALID [2022-04-28 04:02:21,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34578#true} {34578#true} #41#return; {34578#true} is VALID [2022-04-28 04:02:21,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {34578#true} assume true; {34578#true} is VALID [2022-04-28 04:02:21,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {34578#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(17, 2);call #Ultimate.allocInit(12, 3); {34578#true} is VALID [2022-04-28 04:02:21,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {34578#true} call ULTIMATE.init(); {34578#true} is VALID [2022-04-28 04:02:21,680 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 04:02:21,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86741066] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:02:21,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:02:21,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 04:02:24,316 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:02:24,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2087770564] [2022-04-28 04:02:24,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2087770564] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:02:24,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:02:24,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-04-28 04:02:24,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948293849] [2022-04-28 04:02:24,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:02:24,317 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 1.9508196721311475) internal successors, (119), 60 states have internal predecessors, (119), 2 states have call successors, (3), 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 123 [2022-04-28 04:02:24,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:02:24,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 62 states, 61 states have (on average 1.9508196721311475) internal successors, (119), 60 states have internal predecessors, (119), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:02:24,401 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 04:02:24,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-04-28 04:02:24,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:02:24,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-04-28 04:02:24,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=4872, Unknown=0, NotChecked=0, Total=5402 [2022-04-28 04:02:24,402 INFO L87 Difference]: Start difference. First operand 125 states and 128 transitions. Second operand has 62 states, 61 states have (on average 1.9508196721311475) internal successors, (119), 60 states have internal predecessors, (119), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:02:35,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:02:35,777 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions. [2022-04-28 04:02:35,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-04-28 04:02:35,777 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 1.9508196721311475) internal successors, (119), 60 states have internal predecessors, (119), 2 states have call successors, (3), 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 123 [2022-04-28 04:02:35,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:02:35,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.9508196721311475) internal successors, (119), 60 states have internal predecessors, (119), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:02:35,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 139 transitions. [2022-04-28 04:02:35,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.9508196721311475) internal successors, (119), 60 states have internal predecessors, (119), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:02:35,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 139 transitions. [2022-04-28 04:02:35,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 139 transitions. [2022-04-28 04:02:35,885 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:02:35,886 INFO L225 Difference]: With dead ends: 134 [2022-04-28 04:02:35,886 INFO L226 Difference]: Without dead ends: 127 [2022-04-28 04:02:35,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3208 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1155, Invalid=15875, Unknown=0, NotChecked=0, Total=17030 [2022-04-28 04:02:35,888 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 119 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 6779 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 6896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 6779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:02:35,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 268 Invalid, 6896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 6779 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-04-28 04:02:35,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-04-28 04:02:36,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-04-28 04:02:36,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:02:36,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand has 127 states, 122 states have (on average 1.0327868852459017) internal successors, (126), 122 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:02:36,217 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand has 127 states, 122 states have (on average 1.0327868852459017) internal successors, (126), 122 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:02:36,217 INFO L87 Difference]: Start difference. First operand 127 states. Second operand has 127 states, 122 states have (on average 1.0327868852459017) internal successors, (126), 122 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:02:36,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:02:36,218 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2022-04-28 04:02:36,218 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 130 transitions. [2022-04-28 04:02:36,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:02:36,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:02:36,218 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 122 states have (on average 1.0327868852459017) internal successors, (126), 122 states have internal predecessors, (126), 3 states have call successors, (3), 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 127 states. [2022-04-28 04:02:36,219 INFO L87 Difference]: Start difference. First operand has 127 states, 122 states have (on average 1.0327868852459017) internal successors, (126), 122 states have internal predecessors, (126), 3 states have call successors, (3), 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 127 states. [2022-04-28 04:02:36,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:02:36,219 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2022-04-28 04:02:36,220 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 130 transitions. [2022-04-28 04:02:36,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:02:36,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:02:36,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:02:36,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:02:36,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 122 states have (on average 1.0327868852459017) internal successors, (126), 122 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:02:36,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 130 transitions. [2022-04-28 04:02:36,221 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 130 transitions. Word has length 123 [2022-04-28 04:02:36,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:02:36,221 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 130 transitions. [2022-04-28 04:02:36,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 1.9508196721311475) internal successors, (119), 60 states have internal predecessors, (119), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:02:36,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 130 transitions. [2022-04-28 04:02:36,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:02:36,334 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 130 transitions. [2022-04-28 04:02:36,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-04-28 04:02:36,334 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:02:36,334 INFO L195 NwaCegarLoop]: trace histogram [57, 55, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:02:36,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-04-28 04:02:36,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:02:36,535 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:02:36,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:02:36,535 INFO L85 PathProgramCache]: Analyzing trace with hash -338931510, now seen corresponding path program 55 times [2022-04-28 04:02:36,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:02:36,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [934749051] [2022-04-28 04:02:36,624 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 04:02:36,788 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 04:02:36,789 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:02:36,791 INFO L85 PathProgramCache]: Analyzing trace with hash -390741585, now seen corresponding path program 1 times [2022-04-28 04:02:36,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:02:36,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31113888] [2022-04-28 04:02:36,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:02:36,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:02:36,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:02:36,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:02:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:02:36,880 INFO L290 TraceCheckUtils]: 0: Hoare triple {35639#(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(17, 2);call #Ultimate.allocInit(12, 3); {35628#true} is VALID [2022-04-28 04:02:36,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {35628#true} assume true; {35628#true} is VALID [2022-04-28 04:02:36,880 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35628#true} {35628#true} #41#return; {35628#true} is VALID [2022-04-28 04:02:36,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {35628#true} call ULTIMATE.init(); {35639#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:02:36,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {35639#(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(17, 2);call #Ultimate.allocInit(12, 3); {35628#true} is VALID [2022-04-28 04:02:36,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {35628#true} assume true; {35628#true} is VALID [2022-04-28 04:02:36,881 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35628#true} {35628#true} #41#return; {35628#true} is VALID [2022-04-28 04:02:36,881 INFO L272 TraceCheckUtils]: 4: Hoare triple {35628#true} call #t~ret4 := main(); {35628#true} is VALID [2022-04-28 04:02:36,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {35628#true} ~x~0 := 0;~y~0 := 500000; {35633#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 04:02:36,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {35633#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [265] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2528 v_main_~x~0_2527))) (or (and .cse0 (not (< v_main_~x~0_2528 500000))) .cse0 (and (< v_main_~x~0_2528 v_main_~x~0_2527) (< v_main_~x~0_2527 500001)))) InVars {main_~x~0=v_main_~x~0_2528} OutVars{main_~x~0=v_main_~x~0_2527} AuxVars[] AssignedVars[main_~x~0] {35634#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 04:02:36,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {35634#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [266] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35634#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 04:02:36,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {35634#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [267] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_1978 v_main_~y~0_1977)) (.cse1 (<= 500000 v_main_~x~0_2530))) (or (and .cse0 (= v_main_~x~0_2529 v_main_~x~0_2530) (or (not .cse1) (not (< v_main_~x~0_2530 1000000)))) (and .cse0 (= v_main_~x~0_2530 v_main_~x~0_2529)) (and (< v_main_~x~0_2529 1000001) (< v_main_~x~0_2530 v_main_~x~0_2529) .cse1 (= (+ v_main_~x~0_2529 v_main_~y~0_1978) (+ v_main_~x~0_2530 v_main_~y~0_1977))))) InVars {main_~x~0=v_main_~x~0_2530, main_~y~0=v_main_~y~0_1978} OutVars{main_~x~0=v_main_~x~0_2529, main_~y~0=v_main_~y~0_1977} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {35635#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:02:36,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {35635#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [264] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {35636#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:02:36,884 INFO L272 TraceCheckUtils]: 10: Hoare triple {35636#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {35637#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:02:36,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {35637#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {35638#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:02:36,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {35638#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {35629#false} is VALID [2022-04-28 04:02:36,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {35629#false} assume !false; {35629#false} is VALID [2022-04-28 04:02:36,885 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 04:02:36,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:02:36,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31113888] [2022-04-28 04:02:36,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31113888] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:02:36,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987190903] [2022-04-28 04:02:36,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:02:36,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:02:36,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:02:36,886 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:02:36,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-04-28 04:02:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:02:36,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 04:02:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:02:36,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:02:37,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {35628#true} call ULTIMATE.init(); {35628#true} is VALID [2022-04-28 04:02:37,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {35628#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(17, 2);call #Ultimate.allocInit(12, 3); {35628#true} is VALID [2022-04-28 04:02:37,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {35628#true} assume true; {35628#true} is VALID [2022-04-28 04:02:37,275 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35628#true} {35628#true} #41#return; {35628#true} is VALID [2022-04-28 04:02:37,275 INFO L272 TraceCheckUtils]: 4: Hoare triple {35628#true} call #t~ret4 := main(); {35628#true} is VALID [2022-04-28 04:02:37,275 INFO L290 TraceCheckUtils]: 5: Hoare triple {35628#true} ~x~0 := 0;~y~0 := 500000; {35658#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 04:02:37,275 INFO L290 TraceCheckUtils]: 6: Hoare triple {35658#(and (<= main_~x~0 0) (= main_~y~0 500000))} [265] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2528 v_main_~x~0_2527))) (or (and .cse0 (not (< v_main_~x~0_2528 500000))) .cse0 (and (< v_main_~x~0_2528 v_main_~x~0_2527) (< v_main_~x~0_2527 500001)))) InVars {main_~x~0=v_main_~x~0_2528} OutVars{main_~x~0=v_main_~x~0_2527} AuxVars[] AssignedVars[main_~x~0] {35662#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 04:02:37,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {35662#(and (= main_~y~0 500000) (< main_~x~0 500001))} [266] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35662#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 04:02:37,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {35662#(and (= main_~y~0 500000) (< main_~x~0 500001))} [267] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_1978 v_main_~y~0_1977)) (.cse1 (<= 500000 v_main_~x~0_2530))) (or (and .cse0 (= v_main_~x~0_2529 v_main_~x~0_2530) (or (not .cse1) (not (< v_main_~x~0_2530 1000000)))) (and .cse0 (= v_main_~x~0_2530 v_main_~x~0_2529)) (and (< v_main_~x~0_2529 1000001) (< v_main_~x~0_2530 v_main_~x~0_2529) .cse1 (= (+ v_main_~x~0_2529 v_main_~y~0_1978) (+ v_main_~x~0_2530 v_main_~y~0_1977))))) InVars {main_~x~0=v_main_~x~0_2530, main_~y~0=v_main_~y~0_1978} OutVars{main_~x~0=v_main_~x~0_2529, main_~y~0=v_main_~y~0_1977} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {35669#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:02:37,287 INFO L290 TraceCheckUtils]: 9: Hoare triple {35669#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [264] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {35673#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:02:37,288 INFO L272 TraceCheckUtils]: 10: Hoare triple {35673#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {35677#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:02:37,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {35677#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {35681#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:02:37,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {35681#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {35629#false} is VALID [2022-04-28 04:02:37,288 INFO L290 TraceCheckUtils]: 13: Hoare triple {35629#false} assume !false; {35629#false} is VALID [2022-04-28 04:02:37,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 04:02:37,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:02:37,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {35629#false} assume !false; {35629#false} is VALID [2022-04-28 04:02:37,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {35681#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {35629#false} is VALID [2022-04-28 04:02:37,566 INFO L290 TraceCheckUtils]: 11: Hoare triple {35677#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {35681#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:02:37,566 INFO L272 TraceCheckUtils]: 10: Hoare triple {35636#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {35677#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:02:37,567 INFO L290 TraceCheckUtils]: 9: Hoare triple {35700#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [264] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {35636#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:02:37,567 INFO L290 TraceCheckUtils]: 8: Hoare triple {35704#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [267] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_1978 v_main_~y~0_1977)) (.cse1 (<= 500000 v_main_~x~0_2530))) (or (and .cse0 (= v_main_~x~0_2529 v_main_~x~0_2530) (or (not .cse1) (not (< v_main_~x~0_2530 1000000)))) (and .cse0 (= v_main_~x~0_2530 v_main_~x~0_2529)) (and (< v_main_~x~0_2529 1000001) (< v_main_~x~0_2530 v_main_~x~0_2529) .cse1 (= (+ v_main_~x~0_2529 v_main_~y~0_1978) (+ v_main_~x~0_2530 v_main_~y~0_1977))))) InVars {main_~x~0=v_main_~x~0_2530, main_~y~0=v_main_~y~0_1978} OutVars{main_~x~0=v_main_~x~0_2529, main_~y~0=v_main_~y~0_1977} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {35700#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:02:37,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {35704#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [266] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35704#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:02:37,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {35711#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [265] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2528 v_main_~x~0_2527))) (or (and .cse0 (not (< v_main_~x~0_2528 500000))) .cse0 (and (< v_main_~x~0_2528 v_main_~x~0_2527) (< v_main_~x~0_2527 500001)))) InVars {main_~x~0=v_main_~x~0_2528} OutVars{main_~x~0=v_main_~x~0_2527} AuxVars[] AssignedVars[main_~x~0] {35704#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:02:37,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {35628#true} ~x~0 := 0;~y~0 := 500000; {35711#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 04:02:37,569 INFO L272 TraceCheckUtils]: 4: Hoare triple {35628#true} call #t~ret4 := main(); {35628#true} is VALID [2022-04-28 04:02:37,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35628#true} {35628#true} #41#return; {35628#true} is VALID [2022-04-28 04:02:37,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {35628#true} assume true; {35628#true} is VALID [2022-04-28 04:02:37,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {35628#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(17, 2);call #Ultimate.allocInit(12, 3); {35628#true} is VALID [2022-04-28 04:02:37,569 INFO L272 TraceCheckUtils]: 0: Hoare triple {35628#true} call ULTIMATE.init(); {35628#true} is VALID [2022-04-28 04:02:37,569 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 04:02:37,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987190903] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:02:37,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:02:37,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 04:02:40,269 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:02:40,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [934749051] [2022-04-28 04:02:40,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [934749051] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:02:40,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:02:40,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2022-04-28 04:02:40,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922816178] [2022-04-28 04:02:40,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:02:40,270 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 1.9516129032258065) internal successors, (121), 61 states have internal predecessors, (121), 2 states have call successors, (3), 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 125 [2022-04-28 04:02:40,270 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:02:40,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 63 states, 62 states have (on average 1.9516129032258065) internal successors, (121), 61 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:02:40,365 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 04:02:40,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-04-28 04:02:40,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:02:40,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-04-28 04:02:40,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=538, Invalid=5012, Unknown=0, NotChecked=0, Total=5550 [2022-04-28 04:02:40,366 INFO L87 Difference]: Start difference. First operand 127 states and 130 transitions. Second operand has 63 states, 62 states have (on average 1.9516129032258065) internal successors, (121), 61 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:02:51,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:02:51,706 INFO L93 Difference]: Finished difference Result 136 states and 141 transitions. [2022-04-28 04:02:51,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-04-28 04:02:51,707 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 1.9516129032258065) internal successors, (121), 61 states have internal predecessors, (121), 2 states have call successors, (3), 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 125 [2022-04-28 04:02:51,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:02:51,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.9516129032258065) internal successors, (121), 61 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:02:51,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 141 transitions. [2022-04-28 04:02:51,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.9516129032258065) internal successors, (121), 61 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:02:51,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 141 transitions. [2022-04-28 04:02:51,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 141 transitions. [2022-04-28 04:02:51,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:02:51,824 INFO L225 Difference]: With dead ends: 136 [2022-04-28 04:02:51,824 INFO L226 Difference]: Without dead ends: 129 [2022-04-28 04:02:51,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3292 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1174, Invalid=16382, Unknown=0, NotChecked=0, Total=17556 [2022-04-28 04:02:51,825 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 121 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 6762 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 6881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 6762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-04-28 04:02:51,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 158 Invalid, 6881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 6762 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-04-28 04:02:51,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-28 04:02:52,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-04-28 04:02:52,161 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:02:52,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 129 states, 124 states have (on average 1.032258064516129) internal successors, (128), 124 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:02:52,162 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 129 states, 124 states have (on average 1.032258064516129) internal successors, (128), 124 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:02:52,162 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 129 states, 124 states have (on average 1.032258064516129) internal successors, (128), 124 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:02:52,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:02:52,163 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2022-04-28 04:02:52,163 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2022-04-28 04:02:52,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:02:52,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:02:52,163 INFO L74 IsIncluded]: Start isIncluded. First operand has 129 states, 124 states have (on average 1.032258064516129) internal successors, (128), 124 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 129 states. [2022-04-28 04:02:52,163 INFO L87 Difference]: Start difference. First operand has 129 states, 124 states have (on average 1.032258064516129) internal successors, (128), 124 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 129 states. [2022-04-28 04:02:52,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:02:52,164 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2022-04-28 04:02:52,164 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2022-04-28 04:02:52,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:02:52,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:02:52,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:02:52,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:02:52,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 124 states have (on average 1.032258064516129) internal successors, (128), 124 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:02:52,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 132 transitions. [2022-04-28 04:02:52,165 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 132 transitions. Word has length 125 [2022-04-28 04:02:52,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:02:52,166 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 132 transitions. [2022-04-28 04:02:52,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 1.9516129032258065) internal successors, (121), 61 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:02:52,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 129 states and 132 transitions. [2022-04-28 04:02:52,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:02:52,274 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2022-04-28 04:02:52,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-28 04:02:52,274 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:02:52,274 INFO L195 NwaCegarLoop]: trace histogram [58, 56, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:02:52,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2022-04-28 04:02:52,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:02:52,474 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:02:52,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:02:52,475 INFO L85 PathProgramCache]: Analyzing trace with hash 940766245, now seen corresponding path program 56 times [2022-04-28 04:02:52,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:02:52,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [370097062] [2022-04-28 04:02:56,528 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:02:56,569 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 04:03:00,685 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:03:00,785 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 04:03:00,786 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:03:00,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1658790575, now seen corresponding path program 1 times [2022-04-28 04:03:00,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:03:00,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557725021] [2022-04-28 04:03:00,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:03:00,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:03:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:03:00,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:03:00,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:03:00,863 INFO L290 TraceCheckUtils]: 0: Hoare triple {36704#(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(17, 2);call #Ultimate.allocInit(12, 3); {36693#true} is VALID [2022-04-28 04:03:00,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {36693#true} assume true; {36693#true} is VALID [2022-04-28 04:03:00,863 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36693#true} {36693#true} #41#return; {36693#true} is VALID [2022-04-28 04:03:00,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {36693#true} call ULTIMATE.init(); {36704#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:03:00,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {36704#(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(17, 2);call #Ultimate.allocInit(12, 3); {36693#true} is VALID [2022-04-28 04:03:00,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {36693#true} assume true; {36693#true} is VALID [2022-04-28 04:03:00,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36693#true} {36693#true} #41#return; {36693#true} is VALID [2022-04-28 04:03:00,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {36693#true} call #t~ret4 := main(); {36693#true} is VALID [2022-04-28 04:03:00,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {36693#true} ~x~0 := 0;~y~0 := 500000; {36698#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 04:03:00,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {36698#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [269] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2602 v_main_~x~0_2601))) (or .cse0 (and .cse0 (not (< v_main_~x~0_2602 500000))) (and (< v_main_~x~0_2601 500001) (< v_main_~x~0_2602 v_main_~x~0_2601)))) InVars {main_~x~0=v_main_~x~0_2602} OutVars{main_~x~0=v_main_~x~0_2601} AuxVars[] AssignedVars[main_~x~0] {36699#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 04:03:00,867 INFO L290 TraceCheckUtils]: 7: Hoare triple {36699#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [270] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36699#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 04:03:00,868 INFO L290 TraceCheckUtils]: 8: Hoare triple {36699#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [271] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2604 v_main_~x~0_2603)) (.cse1 (= v_main_~y~0_2042 v_main_~y~0_2041)) (.cse2 (<= 500000 v_main_~x~0_2604))) (or (and .cse0 .cse1) (and .cse0 .cse1 (or (not (< v_main_~x~0_2604 1000000)) (not .cse2))) (and (= (+ v_main_~x~0_2604 v_main_~y~0_2041) (+ v_main_~x~0_2603 v_main_~y~0_2042)) (< v_main_~x~0_2604 v_main_~x~0_2603) .cse2 (< v_main_~x~0_2603 1000001)))) InVars {main_~x~0=v_main_~x~0_2604, main_~y~0=v_main_~y~0_2042} OutVars{main_~x~0=v_main_~x~0_2603, main_~y~0=v_main_~y~0_2041} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {36700#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:03:00,868 INFO L290 TraceCheckUtils]: 9: Hoare triple {36700#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [268] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {36701#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:03:00,869 INFO L272 TraceCheckUtils]: 10: Hoare triple {36701#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {36702#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:03:00,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {36702#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {36703#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:03:00,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {36703#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {36694#false} is VALID [2022-04-28 04:03:00,870 INFO L290 TraceCheckUtils]: 13: Hoare triple {36694#false} assume !false; {36694#false} is VALID [2022-04-28 04:03:00,870 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 04:03:00,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:03:00,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557725021] [2022-04-28 04:03:00,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557725021] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:03:00,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678574204] [2022-04-28 04:03:00,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:03:00,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:03:00,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:03:00,871 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:03:00,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-04-28 04:03:00,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:03:00,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 04:03:00,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:03:00,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:03:01,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {36693#true} call ULTIMATE.init(); {36693#true} is VALID [2022-04-28 04:03:01,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {36693#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(17, 2);call #Ultimate.allocInit(12, 3); {36693#true} is VALID [2022-04-28 04:03:01,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {36693#true} assume true; {36693#true} is VALID [2022-04-28 04:03:01,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36693#true} {36693#true} #41#return; {36693#true} is VALID [2022-04-28 04:03:01,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {36693#true} call #t~ret4 := main(); {36693#true} is VALID [2022-04-28 04:03:01,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {36693#true} ~x~0 := 0;~y~0 := 500000; {36723#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 04:03:01,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {36723#(and (<= main_~x~0 0) (= main_~y~0 500000))} [269] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2602 v_main_~x~0_2601))) (or .cse0 (and .cse0 (not (< v_main_~x~0_2602 500000))) (and (< v_main_~x~0_2601 500001) (< v_main_~x~0_2602 v_main_~x~0_2601)))) InVars {main_~x~0=v_main_~x~0_2602} OutVars{main_~x~0=v_main_~x~0_2601} AuxVars[] AssignedVars[main_~x~0] {36727#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 04:03:01,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {36727#(and (= main_~y~0 500000) (< main_~x~0 500001))} [270] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36727#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 04:03:01,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {36727#(and (= main_~y~0 500000) (< main_~x~0 500001))} [271] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2604 v_main_~x~0_2603)) (.cse1 (= v_main_~y~0_2042 v_main_~y~0_2041)) (.cse2 (<= 500000 v_main_~x~0_2604))) (or (and .cse0 .cse1) (and .cse0 .cse1 (or (not (< v_main_~x~0_2604 1000000)) (not .cse2))) (and (= (+ v_main_~x~0_2604 v_main_~y~0_2041) (+ v_main_~x~0_2603 v_main_~y~0_2042)) (< v_main_~x~0_2604 v_main_~x~0_2603) .cse2 (< v_main_~x~0_2603 1000001)))) InVars {main_~x~0=v_main_~x~0_2604, main_~y~0=v_main_~y~0_2042} OutVars{main_~x~0=v_main_~x~0_2603, main_~y~0=v_main_~y~0_2041} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {36734#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:03:01,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {36734#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [268] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {36738#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:03:01,228 INFO L272 TraceCheckUtils]: 10: Hoare triple {36738#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {36742#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:03:01,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {36742#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {36746#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:03:01,229 INFO L290 TraceCheckUtils]: 12: Hoare triple {36746#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {36694#false} is VALID [2022-04-28 04:03:01,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {36694#false} assume !false; {36694#false} is VALID [2022-04-28 04:03:01,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 04:03:01,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:03:01,507 INFO L290 TraceCheckUtils]: 13: Hoare triple {36694#false} assume !false; {36694#false} is VALID [2022-04-28 04:03:01,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {36746#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {36694#false} is VALID [2022-04-28 04:03:01,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {36742#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {36746#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:03:01,508 INFO L272 TraceCheckUtils]: 10: Hoare triple {36701#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {36742#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:03:01,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {36765#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [268] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {36701#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:03:01,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {36769#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [271] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2604 v_main_~x~0_2603)) (.cse1 (= v_main_~y~0_2042 v_main_~y~0_2041)) (.cse2 (<= 500000 v_main_~x~0_2604))) (or (and .cse0 .cse1) (and .cse0 .cse1 (or (not (< v_main_~x~0_2604 1000000)) (not .cse2))) (and (= (+ v_main_~x~0_2604 v_main_~y~0_2041) (+ v_main_~x~0_2603 v_main_~y~0_2042)) (< v_main_~x~0_2604 v_main_~x~0_2603) .cse2 (< v_main_~x~0_2603 1000001)))) InVars {main_~x~0=v_main_~x~0_2604, main_~y~0=v_main_~y~0_2042} OutVars{main_~x~0=v_main_~x~0_2603, main_~y~0=v_main_~y~0_2041} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {36765#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:03:01,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {36769#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [270] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36769#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:03:01,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {36776#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [269] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2602 v_main_~x~0_2601))) (or .cse0 (and .cse0 (not (< v_main_~x~0_2602 500000))) (and (< v_main_~x~0_2601 500001) (< v_main_~x~0_2602 v_main_~x~0_2601)))) InVars {main_~x~0=v_main_~x~0_2602} OutVars{main_~x~0=v_main_~x~0_2601} AuxVars[] AssignedVars[main_~x~0] {36769#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:03:01,511 INFO L290 TraceCheckUtils]: 5: Hoare triple {36693#true} ~x~0 := 0;~y~0 := 500000; {36776#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:03:01,511 INFO L272 TraceCheckUtils]: 4: Hoare triple {36693#true} call #t~ret4 := main(); {36693#true} is VALID [2022-04-28 04:03:01,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36693#true} {36693#true} #41#return; {36693#true} is VALID [2022-04-28 04:03:01,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {36693#true} assume true; {36693#true} is VALID [2022-04-28 04:03:01,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {36693#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(17, 2);call #Ultimate.allocInit(12, 3); {36693#true} is VALID [2022-04-28 04:03:01,511 INFO L272 TraceCheckUtils]: 0: Hoare triple {36693#true} call ULTIMATE.init(); {36693#true} is VALID [2022-04-28 04:03:01,511 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 04:03:01,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678574204] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:03:01,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:03:01,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 04:03:04,243 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:03:04,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [370097062] [2022-04-28 04:03:04,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [370097062] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:03:04,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:03:04,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2022-04-28 04:03:04,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555880626] [2022-04-28 04:03:04,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:03:04,244 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 1.9523809523809523) internal successors, (123), 62 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 127 [2022-04-28 04:03:04,244 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:03:04,244 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 64 states, 63 states have (on average 1.9523809523809523) internal successors, (123), 62 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:03:04,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:03:04,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-04-28 04:03:04,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:03:04,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-04-28 04:03:04,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=546, Invalid=5154, Unknown=0, NotChecked=0, Total=5700 [2022-04-28 04:03:04,330 INFO L87 Difference]: Start difference. First operand 129 states and 132 transitions. Second operand has 64 states, 63 states have (on average 1.9523809523809523) internal successors, (123), 62 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:03:15,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:03:15,945 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2022-04-28 04:03:15,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-04-28 04:03:15,946 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 1.9523809523809523) internal successors, (123), 62 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 127 [2022-04-28 04:03:15,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:03:15,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.9523809523809523) internal successors, (123), 62 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:03:15,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 143 transitions. [2022-04-28 04:03:15,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.9523809523809523) internal successors, (123), 62 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:03:15,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 143 transitions. [2022-04-28 04:03:15,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 143 transitions. [2022-04-28 04:03:16,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:03:16,057 INFO L225 Difference]: With dead ends: 138 [2022-04-28 04:03:16,057 INFO L226 Difference]: Without dead ends: 131 [2022-04-28 04:03:16,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3377 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1193, Invalid=16897, Unknown=0, NotChecked=0, Total=18090 [2022-04-28 04:03:16,059 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 123 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6923 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 7044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 6923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:03:16,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 78 Invalid, 7044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 6923 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-04-28 04:03:16,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-28 04:03:16,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-04-28 04:03:16,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:03:16,405 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 131 states, 126 states have (on average 1.0317460317460319) internal successors, (130), 126 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:03:16,405 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 131 states, 126 states have (on average 1.0317460317460319) internal successors, (130), 126 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:03:16,405 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 131 states, 126 states have (on average 1.0317460317460319) internal successors, (130), 126 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:03:16,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:03:16,406 INFO L93 Difference]: Finished difference Result 131 states and 134 transitions. [2022-04-28 04:03:16,406 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 134 transitions. [2022-04-28 04:03:16,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:03:16,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:03:16,407 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 126 states have (on average 1.0317460317460319) internal successors, (130), 126 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 131 states. [2022-04-28 04:03:16,407 INFO L87 Difference]: Start difference. First operand has 131 states, 126 states have (on average 1.0317460317460319) internal successors, (130), 126 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 131 states. [2022-04-28 04:03:16,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:03:16,408 INFO L93 Difference]: Finished difference Result 131 states and 134 transitions. [2022-04-28 04:03:16,408 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 134 transitions. [2022-04-28 04:03:16,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:03:16,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:03:16,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:03:16,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:03:16,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 126 states have (on average 1.0317460317460319) internal successors, (130), 126 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:03:16,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 134 transitions. [2022-04-28 04:03:16,409 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 134 transitions. Word has length 127 [2022-04-28 04:03:16,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:03:16,409 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 134 transitions. [2022-04-28 04:03:16,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 1.9523809523809523) internal successors, (123), 62 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:03:16,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 131 states and 134 transitions. [2022-04-28 04:03:16,536 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 04:03:16,536 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 134 transitions. [2022-04-28 04:03:16,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-28 04:03:16,536 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:03:16,537 INFO L195 NwaCegarLoop]: trace histogram [59, 57, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:03:16,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2022-04-28 04:03:16,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:03:16,737 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:03:16,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:03:16,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1925305152, now seen corresponding path program 57 times [2022-04-28 04:03:16,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:03:16,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1073711255] [2022-04-28 04:03:16,828 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 04:03:17,034 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 04:03:17,035 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:03:17,037 INFO L85 PathProgramCache]: Analyzing trace with hash -586644561, now seen corresponding path program 1 times [2022-04-28 04:03:17,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:03:17,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562449282] [2022-04-28 04:03:17,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:03:17,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:03:17,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:03:17,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:03:17,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:03:17,123 INFO L290 TraceCheckUtils]: 0: Hoare triple {37784#(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(17, 2);call #Ultimate.allocInit(12, 3); {37773#true} is VALID [2022-04-28 04:03:17,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {37773#true} assume true; {37773#true} is VALID [2022-04-28 04:03:17,123 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37773#true} {37773#true} #41#return; {37773#true} is VALID [2022-04-28 04:03:17,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {37773#true} call ULTIMATE.init(); {37784#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:03:17,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {37784#(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(17, 2);call #Ultimate.allocInit(12, 3); {37773#true} is VALID [2022-04-28 04:03:17,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {37773#true} assume true; {37773#true} is VALID [2022-04-28 04:03:17,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37773#true} {37773#true} #41#return; {37773#true} is VALID [2022-04-28 04:03:17,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {37773#true} call #t~ret4 := main(); {37773#true} is VALID [2022-04-28 04:03:17,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {37773#true} ~x~0 := 0;~y~0 := 500000; {37778#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 04:03:17,125 INFO L290 TraceCheckUtils]: 6: Hoare triple {37778#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [273] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2677 v_main_~x~0_2676))) (or .cse0 (and (< v_main_~x~0_2676 500001) (< v_main_~x~0_2677 v_main_~x~0_2676)) (and (<= 500000 v_main_~x~0_2677) .cse0))) InVars {main_~x~0=v_main_~x~0_2677} OutVars{main_~x~0=v_main_~x~0_2676} AuxVars[] AssignedVars[main_~x~0] {37779#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 04:03:17,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {37779#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [274] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37779#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 04:03:17,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {37779#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [275] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_2107 v_main_~y~0_2106)) (.cse1 (= v_main_~x~0_2679 v_main_~x~0_2678)) (.cse2 (<= 500000 v_main_~x~0_2679))) (or (and .cse0 .cse1) (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_2679 1000000)))) (let ((.cse3 (+ v_main_~x~0_2679 v_main_~y~0_2106))) (and .cse2 (< .cse3 (+ 1000001 v_main_~y~0_2107)) (= .cse3 (+ v_main_~x~0_2678 v_main_~y~0_2107)) (< v_main_~y~0_2107 v_main_~y~0_2106))))) InVars {main_~x~0=v_main_~x~0_2679, main_~y~0=v_main_~y~0_2107} OutVars{main_~x~0=v_main_~x~0_2678, main_~y~0=v_main_~y~0_2106} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {37780#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:03:17,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {37780#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [272] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {37781#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:03:17,133 INFO L272 TraceCheckUtils]: 10: Hoare triple {37781#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {37782#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:03:17,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {37782#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {37783#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:03:17,134 INFO L290 TraceCheckUtils]: 12: Hoare triple {37783#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {37774#false} is VALID [2022-04-28 04:03:17,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {37774#false} assume !false; {37774#false} is VALID [2022-04-28 04:03:17,134 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 04:03:17,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:03:17,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562449282] [2022-04-28 04:03:17,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562449282] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:03:17,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86619766] [2022-04-28 04:03:17,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:03:17,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:03:17,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:03:17,135 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:03:17,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-04-28 04:03:17,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:03:17,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 04:03:17,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:03:17,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:03:17,488 INFO L272 TraceCheckUtils]: 0: Hoare triple {37773#true} call ULTIMATE.init(); {37773#true} is VALID [2022-04-28 04:03:17,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {37773#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(17, 2);call #Ultimate.allocInit(12, 3); {37773#true} is VALID [2022-04-28 04:03:17,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {37773#true} assume true; {37773#true} is VALID [2022-04-28 04:03:17,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37773#true} {37773#true} #41#return; {37773#true} is VALID [2022-04-28 04:03:17,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {37773#true} call #t~ret4 := main(); {37773#true} is VALID [2022-04-28 04:03:17,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {37773#true} ~x~0 := 0;~y~0 := 500000; {37803#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 04:03:17,490 INFO L290 TraceCheckUtils]: 6: Hoare triple {37803#(and (<= main_~x~0 0) (= main_~y~0 500000))} [273] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2677 v_main_~x~0_2676))) (or .cse0 (and (< v_main_~x~0_2676 500001) (< v_main_~x~0_2677 v_main_~x~0_2676)) (and (<= 500000 v_main_~x~0_2677) .cse0))) InVars {main_~x~0=v_main_~x~0_2677} OutVars{main_~x~0=v_main_~x~0_2676} AuxVars[] AssignedVars[main_~x~0] {37807#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 04:03:17,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {37807#(and (= main_~y~0 500000) (< main_~x~0 500001))} [274] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37807#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 04:03:17,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {37807#(and (= main_~y~0 500000) (< main_~x~0 500001))} [275] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_2107 v_main_~y~0_2106)) (.cse1 (= v_main_~x~0_2679 v_main_~x~0_2678)) (.cse2 (<= 500000 v_main_~x~0_2679))) (or (and .cse0 .cse1) (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_2679 1000000)))) (let ((.cse3 (+ v_main_~x~0_2679 v_main_~y~0_2106))) (and .cse2 (< .cse3 (+ 1000001 v_main_~y~0_2107)) (= .cse3 (+ v_main_~x~0_2678 v_main_~y~0_2107)) (< v_main_~y~0_2107 v_main_~y~0_2106))))) InVars {main_~x~0=v_main_~x~0_2679, main_~y~0=v_main_~y~0_2107} OutVars{main_~x~0=v_main_~x~0_2678, main_~y~0=v_main_~y~0_2106} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {37814#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:03:17,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {37814#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [272] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {37818#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:03:17,492 INFO L272 TraceCheckUtils]: 10: Hoare triple {37818#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {37822#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:03:17,492 INFO L290 TraceCheckUtils]: 11: Hoare triple {37822#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {37826#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:03:17,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {37826#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {37774#false} is VALID [2022-04-28 04:03:17,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {37774#false} assume !false; {37774#false} is VALID [2022-04-28 04:03:17,493 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 04:03:17,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:03:17,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {37774#false} assume !false; {37774#false} is VALID [2022-04-28 04:03:17,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {37826#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {37774#false} is VALID [2022-04-28 04:03:17,798 INFO L290 TraceCheckUtils]: 11: Hoare triple {37822#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {37826#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:03:17,799 INFO L272 TraceCheckUtils]: 10: Hoare triple {37781#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {37822#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:03:17,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {37845#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [272] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {37781#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:03:17,800 INFO L290 TraceCheckUtils]: 8: Hoare triple {37849#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [275] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_2107 v_main_~y~0_2106)) (.cse1 (= v_main_~x~0_2679 v_main_~x~0_2678)) (.cse2 (<= 500000 v_main_~x~0_2679))) (or (and .cse0 .cse1) (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_2679 1000000)))) (let ((.cse3 (+ v_main_~x~0_2679 v_main_~y~0_2106))) (and .cse2 (< .cse3 (+ 1000001 v_main_~y~0_2107)) (= .cse3 (+ v_main_~x~0_2678 v_main_~y~0_2107)) (< v_main_~y~0_2107 v_main_~y~0_2106))))) InVars {main_~x~0=v_main_~x~0_2679, main_~y~0=v_main_~y~0_2107} OutVars{main_~x~0=v_main_~x~0_2678, main_~y~0=v_main_~y~0_2106} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {37845#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:03:17,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {37849#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [274] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37849#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:03:17,801 INFO L290 TraceCheckUtils]: 6: Hoare triple {37856#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [273] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2677 v_main_~x~0_2676))) (or .cse0 (and (< v_main_~x~0_2676 500001) (< v_main_~x~0_2677 v_main_~x~0_2676)) (and (<= 500000 v_main_~x~0_2677) .cse0))) InVars {main_~x~0=v_main_~x~0_2677} OutVars{main_~x~0=v_main_~x~0_2676} AuxVars[] AssignedVars[main_~x~0] {37849#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:03:17,801 INFO L290 TraceCheckUtils]: 5: Hoare triple {37773#true} ~x~0 := 0;~y~0 := 500000; {37856#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:03:17,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {37773#true} call #t~ret4 := main(); {37773#true} is VALID [2022-04-28 04:03:17,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37773#true} {37773#true} #41#return; {37773#true} is VALID [2022-04-28 04:03:17,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {37773#true} assume true; {37773#true} is VALID [2022-04-28 04:03:17,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {37773#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(17, 2);call #Ultimate.allocInit(12, 3); {37773#true} is VALID [2022-04-28 04:03:17,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {37773#true} call ULTIMATE.init(); {37773#true} is VALID [2022-04-28 04:03:17,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:03:17,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86619766] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:03:17,802 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:03:17,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 04:03:20,709 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:03:20,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1073711255] [2022-04-28 04:03:20,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1073711255] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:03:20,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:03:20,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2022-04-28 04:03:20,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472776386] [2022-04-28 04:03:20,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:03:20,710 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 1.953125) internal successors, (125), 63 states have internal predecessors, (125), 2 states have call successors, (3), 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 129 [2022-04-28 04:03:20,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:03:20,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 65 states, 64 states have (on average 1.953125) internal successors, (125), 63 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:03:20,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:03:20,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-04-28 04:03:20,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:03:20,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-04-28 04:03:20,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=5298, Unknown=0, NotChecked=0, Total=5852 [2022-04-28 04:03:20,799 INFO L87 Difference]: Start difference. First operand 131 states and 134 transitions. Second operand has 65 states, 64 states have (on average 1.953125) internal successors, (125), 63 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:03:33,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:03:33,047 INFO L93 Difference]: Finished difference Result 140 states and 145 transitions. [2022-04-28 04:03:33,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-04-28 04:03:33,048 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 1.953125) internal successors, (125), 63 states have internal predecessors, (125), 2 states have call successors, (3), 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 129 [2022-04-28 04:03:33,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:03:33,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.953125) internal successors, (125), 63 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:03:33,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 145 transitions. [2022-04-28 04:03:33,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.953125) internal successors, (125), 63 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:03:33,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 145 transitions. [2022-04-28 04:03:33,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 145 transitions. [2022-04-28 04:03:33,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:03:33,162 INFO L225 Difference]: With dead ends: 140 [2022-04-28 04:03:33,162 INFO L226 Difference]: Without dead ends: 133 [2022-04-28 04:03:33,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3463 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1212, Invalid=17420, Unknown=0, NotChecked=0, Total=18632 [2022-04-28 04:03:33,164 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 125 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 7114 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 7237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 7114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-04-28 04:03:33,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 108 Invalid, 7237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 7114 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-04-28 04:03:33,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-04-28 04:03:33,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2022-04-28 04:03:33,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:03:33,520 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand has 133 states, 128 states have (on average 1.03125) internal successors, (132), 128 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:03:33,520 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand has 133 states, 128 states have (on average 1.03125) internal successors, (132), 128 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:03:33,520 INFO L87 Difference]: Start difference. First operand 133 states. Second operand has 133 states, 128 states have (on average 1.03125) internal successors, (132), 128 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:03:33,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:03:33,521 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2022-04-28 04:03:33,521 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2022-04-28 04:03:33,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:03:33,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:03:33,521 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 128 states have (on average 1.03125) internal successors, (132), 128 states have internal predecessors, (132), 3 states have call successors, (3), 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 133 states. [2022-04-28 04:03:33,522 INFO L87 Difference]: Start difference. First operand has 133 states, 128 states have (on average 1.03125) internal successors, (132), 128 states have internal predecessors, (132), 3 states have call successors, (3), 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 133 states. [2022-04-28 04:03:33,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:03:33,523 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2022-04-28 04:03:33,523 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2022-04-28 04:03:33,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:03:33,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:03:33,523 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:03:33,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:03:33,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 128 states have (on average 1.03125) internal successors, (132), 128 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:03:33,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2022-04-28 04:03:33,524 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 129 [2022-04-28 04:03:33,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:03:33,524 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2022-04-28 04:03:33,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 1.953125) internal successors, (125), 63 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:03:33,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 133 states and 136 transitions. [2022-04-28 04:03:33,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:03:33,637 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2022-04-28 04:03:33,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-28 04:03:33,637 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:03:33,637 INFO L195 NwaCegarLoop]: trace histogram [60, 58, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:03:33,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-04-28 04:03:33,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-04-28 04:03:33,838 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:03:33,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:03:33,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1149086363, now seen corresponding path program 58 times [2022-04-28 04:03:33,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:03:33,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [465723007] [2022-04-28 04:03:37,897 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:03:37,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 04:03:38,134 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 04:03:38,135 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:03:38,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1462887599, now seen corresponding path program 1 times [2022-04-28 04:03:38,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:03:38,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555341710] [2022-04-28 04:03:38,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:03:38,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:03:38,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:03:38,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:03:38,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:03:38,214 INFO L290 TraceCheckUtils]: 0: Hoare triple {38879#(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(17, 2);call #Ultimate.allocInit(12, 3); {38868#true} is VALID [2022-04-28 04:03:38,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {38868#true} assume true; {38868#true} is VALID [2022-04-28 04:03:38,214 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38868#true} {38868#true} #41#return; {38868#true} is VALID [2022-04-28 04:03:38,215 INFO L272 TraceCheckUtils]: 0: Hoare triple {38868#true} call ULTIMATE.init(); {38879#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:03:38,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {38879#(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(17, 2);call #Ultimate.allocInit(12, 3); {38868#true} is VALID [2022-04-28 04:03:38,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {38868#true} assume true; {38868#true} is VALID [2022-04-28 04:03:38,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38868#true} {38868#true} #41#return; {38868#true} is VALID [2022-04-28 04:03:38,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {38868#true} call #t~ret4 := main(); {38868#true} is VALID [2022-04-28 04:03:38,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {38868#true} ~x~0 := 0;~y~0 := 500000; {38873#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 04:03:38,216 INFO L290 TraceCheckUtils]: 6: Hoare triple {38873#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [277] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2753 v_main_~x~0_2752))) (or (and (< v_main_~x~0_2752 500001) (< v_main_~x~0_2753 v_main_~x~0_2752)) .cse0 (and (<= 500000 v_main_~x~0_2753) .cse0))) InVars {main_~x~0=v_main_~x~0_2753} OutVars{main_~x~0=v_main_~x~0_2752} AuxVars[] AssignedVars[main_~x~0] {38874#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 04:03:38,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {38874#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [278] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38874#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 04:03:38,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {38874#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [279] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2755 v_main_~x~0_2754)) (.cse2 (<= 500000 v_main_~x~0_2755))) (or (and (= v_main_~y~0_2173 v_main_~y~0_2172) .cse0) (let ((.cse1 (+ v_main_~x~0_2755 v_main_~y~0_2172))) (and (< .cse1 (+ 1000001 v_main_~y~0_2173)) (= (+ v_main_~x~0_2754 v_main_~y~0_2173) .cse1) .cse2 (< v_main_~y~0_2173 v_main_~y~0_2172))) (and (= v_main_~y~0_2172 v_main_~y~0_2173) .cse0 (or (not .cse2) (not (< v_main_~x~0_2755 1000000)))))) InVars {main_~x~0=v_main_~x~0_2755, main_~y~0=v_main_~y~0_2173} OutVars{main_~x~0=v_main_~x~0_2754, main_~y~0=v_main_~y~0_2172} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {38875#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 04:03:38,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {38875#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [276] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {38876#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-28 04:03:38,218 INFO L272 TraceCheckUtils]: 10: Hoare triple {38876#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {38877#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:03:38,218 INFO L290 TraceCheckUtils]: 11: Hoare triple {38877#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {38878#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:03:38,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {38878#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {38869#false} is VALID [2022-04-28 04:03:38,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {38869#false} assume !false; {38869#false} is VALID [2022-04-28 04:03:38,219 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 04:03:38,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:03:38,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555341710] [2022-04-28 04:03:38,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555341710] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:03:38,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855353461] [2022-04-28 04:03:38,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:03:38,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:03:38,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:03:38,220 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:03:38,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-04-28 04:03:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:03:38,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 04:03:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:03:38,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:03:38,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {38868#true} call ULTIMATE.init(); {38868#true} is VALID [2022-04-28 04:03:38,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {38868#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(17, 2);call #Ultimate.allocInit(12, 3); {38868#true} is VALID [2022-04-28 04:03:38,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {38868#true} assume true; {38868#true} is VALID [2022-04-28 04:03:38,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38868#true} {38868#true} #41#return; {38868#true} is VALID [2022-04-28 04:03:38,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {38868#true} call #t~ret4 := main(); {38868#true} is VALID [2022-04-28 04:03:38,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {38868#true} ~x~0 := 0;~y~0 := 500000; {38898#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 04:03:38,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {38898#(and (<= main_~x~0 0) (= main_~y~0 500000))} [277] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2753 v_main_~x~0_2752))) (or (and (< v_main_~x~0_2752 500001) (< v_main_~x~0_2753 v_main_~x~0_2752)) .cse0 (and (<= 500000 v_main_~x~0_2753) .cse0))) InVars {main_~x~0=v_main_~x~0_2753} OutVars{main_~x~0=v_main_~x~0_2752} AuxVars[] AssignedVars[main_~x~0] {38902#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 04:03:38,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {38902#(and (= main_~y~0 500000) (< main_~x~0 500001))} [278] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38902#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 04:03:38,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {38902#(and (= main_~y~0 500000) (< main_~x~0 500001))} [279] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2755 v_main_~x~0_2754)) (.cse2 (<= 500000 v_main_~x~0_2755))) (or (and (= v_main_~y~0_2173 v_main_~y~0_2172) .cse0) (let ((.cse1 (+ v_main_~x~0_2755 v_main_~y~0_2172))) (and (< .cse1 (+ 1000001 v_main_~y~0_2173)) (= (+ v_main_~x~0_2754 v_main_~y~0_2173) .cse1) .cse2 (< v_main_~y~0_2173 v_main_~y~0_2172))) (and (= v_main_~y~0_2172 v_main_~y~0_2173) .cse0 (or (not .cse2) (not (< v_main_~x~0_2755 1000000)))))) InVars {main_~x~0=v_main_~x~0_2755, main_~y~0=v_main_~y~0_2173} OutVars{main_~x~0=v_main_~x~0_2754, main_~y~0=v_main_~y~0_2172} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {38909#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:03:38,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {38909#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [276] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {38913#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:03:38,567 INFO L272 TraceCheckUtils]: 10: Hoare triple {38913#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {38917#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:03:38,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {38917#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {38921#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:03:38,567 INFO L290 TraceCheckUtils]: 12: Hoare triple {38921#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {38869#false} is VALID [2022-04-28 04:03:38,567 INFO L290 TraceCheckUtils]: 13: Hoare triple {38869#false} assume !false; {38869#false} is VALID [2022-04-28 04:03:38,567 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 04:03:38,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:03:38,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {38869#false} assume !false; {38869#false} is VALID [2022-04-28 04:03:38,872 INFO L290 TraceCheckUtils]: 12: Hoare triple {38921#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {38869#false} is VALID [2022-04-28 04:03:38,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {38917#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {38921#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:03:38,873 INFO L272 TraceCheckUtils]: 10: Hoare triple {38876#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {38917#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:03:38,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {38940#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [276] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {38876#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-28 04:03:38,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {38944#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [279] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2755 v_main_~x~0_2754)) (.cse2 (<= 500000 v_main_~x~0_2755))) (or (and (= v_main_~y~0_2173 v_main_~y~0_2172) .cse0) (let ((.cse1 (+ v_main_~x~0_2755 v_main_~y~0_2172))) (and (< .cse1 (+ 1000001 v_main_~y~0_2173)) (= (+ v_main_~x~0_2754 v_main_~y~0_2173) .cse1) .cse2 (< v_main_~y~0_2173 v_main_~y~0_2172))) (and (= v_main_~y~0_2172 v_main_~y~0_2173) .cse0 (or (not .cse2) (not (< v_main_~x~0_2755 1000000)))))) InVars {main_~x~0=v_main_~x~0_2755, main_~y~0=v_main_~y~0_2173} OutVars{main_~x~0=v_main_~x~0_2754, main_~y~0=v_main_~y~0_2172} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {38940#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 04:03:38,874 INFO L290 TraceCheckUtils]: 7: Hoare triple {38944#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [278] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38944#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 04:03:38,875 INFO L290 TraceCheckUtils]: 6: Hoare triple {38951#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} [277] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2753 v_main_~x~0_2752))) (or (and (< v_main_~x~0_2752 500001) (< v_main_~x~0_2753 v_main_~x~0_2752)) .cse0 (and (<= 500000 v_main_~x~0_2753) .cse0))) InVars {main_~x~0=v_main_~x~0_2753} OutVars{main_~x~0=v_main_~x~0_2752} AuxVars[] AssignedVars[main_~x~0] {38944#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 04:03:38,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {38868#true} ~x~0 := 0;~y~0 := 500000; {38951#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 04:03:38,876 INFO L272 TraceCheckUtils]: 4: Hoare triple {38868#true} call #t~ret4 := main(); {38868#true} is VALID [2022-04-28 04:03:38,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38868#true} {38868#true} #41#return; {38868#true} is VALID [2022-04-28 04:03:38,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {38868#true} assume true; {38868#true} is VALID [2022-04-28 04:03:38,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {38868#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(17, 2);call #Ultimate.allocInit(12, 3); {38868#true} is VALID [2022-04-28 04:03:38,876 INFO L272 TraceCheckUtils]: 0: Hoare triple {38868#true} call ULTIMATE.init(); {38868#true} is VALID [2022-04-28 04:03:38,876 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 04:03:38,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855353461] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:03:38,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:03:38,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 04:03:41,881 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:03:41,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [465723007] [2022-04-28 04:03:41,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [465723007] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:03:41,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:03:41,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2022-04-28 04:03:41,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747050502] [2022-04-28 04:03:41,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:03:41,882 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 1.9538461538461538) internal successors, (127), 64 states have internal predecessors, (127), 2 states have call successors, (3), 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 131 [2022-04-28 04:03:41,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:03:41,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 66 states, 65 states have (on average 1.9538461538461538) internal successors, (127), 64 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:03:41,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:03:41,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-04-28 04:03:41,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:03:41,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-04-28 04:03:41,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=562, Invalid=5444, Unknown=0, NotChecked=0, Total=6006 [2022-04-28 04:03:41,973 INFO L87 Difference]: Start difference. First operand 133 states and 136 transitions. Second operand has 66 states, 65 states have (on average 1.9538461538461538) internal successors, (127), 64 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:03:55,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:03:55,134 INFO L93 Difference]: Finished difference Result 142 states and 147 transitions. [2022-04-28 04:03:55,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-04-28 04:03:55,134 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 1.9538461538461538) internal successors, (127), 64 states have internal predecessors, (127), 2 states have call successors, (3), 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 131 [2022-04-28 04:03:55,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:03:55,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.9538461538461538) internal successors, (127), 64 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:03:55,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 147 transitions. [2022-04-28 04:03:55,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.9538461538461538) internal successors, (127), 64 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:03:55,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 147 transitions. [2022-04-28 04:03:55,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 147 transitions. [2022-04-28 04:03:55,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:03:55,262 INFO L225 Difference]: With dead ends: 142 [2022-04-28 04:03:55,263 INFO L226 Difference]: Without dead ends: 135 [2022-04-28 04:03:55,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3550 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1231, Invalid=17951, Unknown=0, NotChecked=0, Total=19182 [2022-04-28 04:03:55,264 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 127 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 7793 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 7918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 7793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-04-28 04:03:55,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 258 Invalid, 7918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 7793 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-04-28 04:03:55,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-04-28 04:03:55,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2022-04-28 04:03:55,628 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:03:55,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 135 states, 130 states have (on average 1.0307692307692307) internal successors, (134), 130 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:03:55,628 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 135 states, 130 states have (on average 1.0307692307692307) internal successors, (134), 130 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:03:55,628 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 135 states, 130 states have (on average 1.0307692307692307) internal successors, (134), 130 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:03:55,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:03:55,629 INFO L93 Difference]: Finished difference Result 135 states and 138 transitions. [2022-04-28 04:03:55,629 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 138 transitions. [2022-04-28 04:03:55,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:03:55,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:03:55,630 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 130 states have (on average 1.0307692307692307) internal successors, (134), 130 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 135 states. [2022-04-28 04:03:55,630 INFO L87 Difference]: Start difference. First operand has 135 states, 130 states have (on average 1.0307692307692307) internal successors, (134), 130 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 135 states. [2022-04-28 04:03:55,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:03:55,631 INFO L93 Difference]: Finished difference Result 135 states and 138 transitions. [2022-04-28 04:03:55,631 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 138 transitions. [2022-04-28 04:03:55,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:03:55,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:03:55,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:03:55,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:03:55,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 130 states have (on average 1.0307692307692307) internal successors, (134), 130 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:03:55,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 138 transitions. [2022-04-28 04:03:55,632 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 138 transitions. Word has length 131 [2022-04-28 04:03:55,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:03:55,632 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 138 transitions. [2022-04-28 04:03:55,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 1.9538461538461538) internal successors, (127), 64 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:03:55,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 138 transitions. [2022-04-28 04:03:55,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:03:55,753 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 138 transitions. [2022-04-28 04:03:55,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-28 04:03:55,754 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:03:55,754 INFO L195 NwaCegarLoop]: trace histogram [61, 59, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:03:55,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-04-28 04:03:55,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable60 [2022-04-28 04:03:55,954 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:03:55,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:03:55,955 INFO L85 PathProgramCache]: Analyzing trace with hash 701832630, now seen corresponding path program 59 times [2022-04-28 04:03:55,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:03:55,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [349669484] [2022-04-28 04:03:56,031 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 04:03:56,196 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 04:03:56,197 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:03:56,198 INFO L85 PathProgramCache]: Analyzing trace with hash -782547537, now seen corresponding path program 1 times [2022-04-28 04:03:56,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:03:56,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910578338] [2022-04-28 04:03:56,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:03:56,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:03:56,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:03:56,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:03:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:03:56,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {39989#(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(17, 2);call #Ultimate.allocInit(12, 3); {39978#true} is VALID [2022-04-28 04:03:56,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {39978#true} assume true; {39978#true} is VALID [2022-04-28 04:03:56,283 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39978#true} {39978#true} #41#return; {39978#true} is VALID [2022-04-28 04:03:56,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {39978#true} call ULTIMATE.init(); {39989#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:03:56,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {39989#(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(17, 2);call #Ultimate.allocInit(12, 3); {39978#true} is VALID [2022-04-28 04:03:56,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {39978#true} assume true; {39978#true} is VALID [2022-04-28 04:03:56,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39978#true} {39978#true} #41#return; {39978#true} is VALID [2022-04-28 04:03:56,284 INFO L272 TraceCheckUtils]: 4: Hoare triple {39978#true} call #t~ret4 := main(); {39978#true} is VALID [2022-04-28 04:03:56,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {39978#true} ~x~0 := 0;~y~0 := 500000; {39983#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 04:03:56,284 INFO L290 TraceCheckUtils]: 6: Hoare triple {39983#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [281] L11-2-->L10-2_primed: Formula: (or (= v_main_~x~0_2830 v_main_~x~0_2829) (and (not (< v_main_~x~0_2830 500000)) (= v_main_~x~0_2829 v_main_~x~0_2830)) (and (< v_main_~x~0_2829 500001) (< v_main_~x~0_2830 v_main_~x~0_2829))) InVars {main_~x~0=v_main_~x~0_2830} OutVars{main_~x~0=v_main_~x~0_2829} AuxVars[] AssignedVars[main_~x~0] {39984#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 04:03:56,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {39984#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [282] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39984#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 04:03:56,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {39984#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [283] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_2832)) (.cse2 (= v_main_~x~0_2832 v_main_~x~0_2831))) (or (let ((.cse0 (+ v_main_~x~0_2832 v_main_~y~0_2239))) (and (< .cse0 (+ 1000001 v_main_~y~0_2240)) (= .cse0 (+ v_main_~x~0_2831 v_main_~y~0_2240)) .cse1 (< v_main_~y~0_2240 v_main_~y~0_2239))) (and (= v_main_~y~0_2239 v_main_~y~0_2240) .cse2 (or (not .cse1) (not (< v_main_~x~0_2832 1000000)))) (and (= v_main_~y~0_2240 v_main_~y~0_2239) .cse2))) InVars {main_~x~0=v_main_~x~0_2832, main_~y~0=v_main_~y~0_2240} OutVars{main_~x~0=v_main_~x~0_2831, main_~y~0=v_main_~y~0_2239} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {39985#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:03:56,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {39985#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [280] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {39986#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:03:56,287 INFO L272 TraceCheckUtils]: 10: Hoare triple {39986#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {39987#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:03:56,287 INFO L290 TraceCheckUtils]: 11: Hoare triple {39987#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {39988#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:03:56,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {39988#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {39979#false} is VALID [2022-04-28 04:03:56,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {39979#false} assume !false; {39979#false} is VALID [2022-04-28 04:03:56,287 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 04:03:56,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:03:56,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910578338] [2022-04-28 04:03:56,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910578338] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:03:56,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582169402] [2022-04-28 04:03:56,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:03:56,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:03:56,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:03:56,289 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:03:56,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-04-28 04:03:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:03:56,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 04:03:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:03:56,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:03:56,653 INFO L272 TraceCheckUtils]: 0: Hoare triple {39978#true} call ULTIMATE.init(); {39978#true} is VALID [2022-04-28 04:03:56,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {39978#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(17, 2);call #Ultimate.allocInit(12, 3); {39978#true} is VALID [2022-04-28 04:03:56,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {39978#true} assume true; {39978#true} is VALID [2022-04-28 04:03:56,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39978#true} {39978#true} #41#return; {39978#true} is VALID [2022-04-28 04:03:56,654 INFO L272 TraceCheckUtils]: 4: Hoare triple {39978#true} call #t~ret4 := main(); {39978#true} is VALID [2022-04-28 04:03:56,658 INFO L290 TraceCheckUtils]: 5: Hoare triple {39978#true} ~x~0 := 0;~y~0 := 500000; {40008#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 04:03:56,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {40008#(and (<= main_~x~0 0) (= main_~y~0 500000))} [281] L11-2-->L10-2_primed: Formula: (or (= v_main_~x~0_2830 v_main_~x~0_2829) (and (not (< v_main_~x~0_2830 500000)) (= v_main_~x~0_2829 v_main_~x~0_2830)) (and (< v_main_~x~0_2829 500001) (< v_main_~x~0_2830 v_main_~x~0_2829))) InVars {main_~x~0=v_main_~x~0_2830} OutVars{main_~x~0=v_main_~x~0_2829} AuxVars[] AssignedVars[main_~x~0] {40012#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 04:03:56,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {40012#(and (= main_~y~0 500000) (< main_~x~0 500001))} [282] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40012#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 04:03:56,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {40012#(and (= main_~y~0 500000) (< main_~x~0 500001))} [283] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_2832)) (.cse2 (= v_main_~x~0_2832 v_main_~x~0_2831))) (or (let ((.cse0 (+ v_main_~x~0_2832 v_main_~y~0_2239))) (and (< .cse0 (+ 1000001 v_main_~y~0_2240)) (= .cse0 (+ v_main_~x~0_2831 v_main_~y~0_2240)) .cse1 (< v_main_~y~0_2240 v_main_~y~0_2239))) (and (= v_main_~y~0_2239 v_main_~y~0_2240) .cse2 (or (not .cse1) (not (< v_main_~x~0_2832 1000000)))) (and (= v_main_~y~0_2240 v_main_~y~0_2239) .cse2))) InVars {main_~x~0=v_main_~x~0_2832, main_~y~0=v_main_~y~0_2240} OutVars{main_~x~0=v_main_~x~0_2831, main_~y~0=v_main_~y~0_2239} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {40019#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:03:56,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {40019#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [280] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {40023#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:03:56,663 INFO L272 TraceCheckUtils]: 10: Hoare triple {40023#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {40027#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:03:56,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {40027#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {40031#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:03:56,665 INFO L290 TraceCheckUtils]: 12: Hoare triple {40031#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {39979#false} is VALID [2022-04-28 04:03:56,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {39979#false} assume !false; {39979#false} is VALID [2022-04-28 04:03:56,665 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 04:03:56,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:03:56,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {39979#false} assume !false; {39979#false} is VALID [2022-04-28 04:03:56,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {40031#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {39979#false} is VALID [2022-04-28 04:03:56,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {40027#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {40031#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:03:56,969 INFO L272 TraceCheckUtils]: 10: Hoare triple {39986#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {40027#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:03:56,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {40050#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [280] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {39986#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:03:56,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {40054#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [283] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_2832)) (.cse2 (= v_main_~x~0_2832 v_main_~x~0_2831))) (or (let ((.cse0 (+ v_main_~x~0_2832 v_main_~y~0_2239))) (and (< .cse0 (+ 1000001 v_main_~y~0_2240)) (= .cse0 (+ v_main_~x~0_2831 v_main_~y~0_2240)) .cse1 (< v_main_~y~0_2240 v_main_~y~0_2239))) (and (= v_main_~y~0_2239 v_main_~y~0_2240) .cse2 (or (not .cse1) (not (< v_main_~x~0_2832 1000000)))) (and (= v_main_~y~0_2240 v_main_~y~0_2239) .cse2))) InVars {main_~x~0=v_main_~x~0_2832, main_~y~0=v_main_~y~0_2240} OutVars{main_~x~0=v_main_~x~0_2831, main_~y~0=v_main_~y~0_2239} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {40050#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:03:56,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {40054#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [282] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40054#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:03:56,972 INFO L290 TraceCheckUtils]: 6: Hoare triple {40061#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [281] L11-2-->L10-2_primed: Formula: (or (= v_main_~x~0_2830 v_main_~x~0_2829) (and (not (< v_main_~x~0_2830 500000)) (= v_main_~x~0_2829 v_main_~x~0_2830)) (and (< v_main_~x~0_2829 500001) (< v_main_~x~0_2830 v_main_~x~0_2829))) InVars {main_~x~0=v_main_~x~0_2830} OutVars{main_~x~0=v_main_~x~0_2829} AuxVars[] AssignedVars[main_~x~0] {40054#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:03:56,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {39978#true} ~x~0 := 0;~y~0 := 500000; {40061#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:03:56,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {39978#true} call #t~ret4 := main(); {39978#true} is VALID [2022-04-28 04:03:56,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39978#true} {39978#true} #41#return; {39978#true} is VALID [2022-04-28 04:03:56,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {39978#true} assume true; {39978#true} is VALID [2022-04-28 04:03:56,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {39978#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(17, 2);call #Ultimate.allocInit(12, 3); {39978#true} is VALID [2022-04-28 04:03:56,972 INFO L272 TraceCheckUtils]: 0: Hoare triple {39978#true} call ULTIMATE.init(); {39978#true} is VALID [2022-04-28 04:03:56,972 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 04:03:56,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582169402] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:03:56,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:03:56,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 04:03:59,975 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:03:59,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [349669484] [2022-04-28 04:03:59,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [349669484] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:03:59,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:03:59,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [67] imperfect sequences [] total 67 [2022-04-28 04:03:59,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292970049] [2022-04-28 04:03:59,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:03:59,976 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 66 states have (on average 1.9545454545454546) internal successors, (129), 65 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 133 [2022-04-28 04:03:59,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:03:59,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 67 states, 66 states have (on average 1.9545454545454546) internal successors, (129), 65 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:04:00,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:04:00,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-04-28 04:04:00,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:04:00,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-04-28 04:04:00,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=5592, Unknown=0, NotChecked=0, Total=6162 [2022-04-28 04:04:00,066 INFO L87 Difference]: Start difference. First operand 135 states and 138 transitions. Second operand has 67 states, 66 states have (on average 1.9545454545454546) internal successors, (129), 65 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:04:12,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:04:12,894 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2022-04-28 04:04:12,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-04-28 04:04:12,894 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 66 states have (on average 1.9545454545454546) internal successors, (129), 65 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 133 [2022-04-28 04:04:12,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:04:12,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.9545454545454546) internal successors, (129), 65 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:04:12,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 149 transitions. [2022-04-28 04:04:12,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.9545454545454546) internal successors, (129), 65 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:04:12,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 149 transitions. [2022-04-28 04:04:12,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 149 transitions. [2022-04-28 04:04:13,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:04:13,011 INFO L225 Difference]: With dead ends: 144 [2022-04-28 04:04:13,011 INFO L226 Difference]: Without dead ends: 137 [2022-04-28 04:04:13,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3638 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1250, Invalid=18490, Unknown=0, NotChecked=0, Total=19740 [2022-04-28 04:04:13,013 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 129 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 7526 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 7653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 7526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-04-28 04:04:13,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 78 Invalid, 7653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 7526 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-04-28 04:04:13,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-28 04:04:13,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2022-04-28 04:04:13,377 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:04:13,377 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 137 states, 132 states have (on average 1.0303030303030303) internal successors, (136), 132 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:04:13,377 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 137 states, 132 states have (on average 1.0303030303030303) internal successors, (136), 132 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:04:13,377 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 137 states, 132 states have (on average 1.0303030303030303) internal successors, (136), 132 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:04:13,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:04:13,378 INFO L93 Difference]: Finished difference Result 137 states and 140 transitions. [2022-04-28 04:04:13,378 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 140 transitions. [2022-04-28 04:04:13,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:04:13,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:04:13,379 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 132 states have (on average 1.0303030303030303) internal successors, (136), 132 states have internal predecessors, (136), 3 states have call successors, (3), 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 137 states. [2022-04-28 04:04:13,379 INFO L87 Difference]: Start difference. First operand has 137 states, 132 states have (on average 1.0303030303030303) internal successors, (136), 132 states have internal predecessors, (136), 3 states have call successors, (3), 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 137 states. [2022-04-28 04:04:13,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:04:13,380 INFO L93 Difference]: Finished difference Result 137 states and 140 transitions. [2022-04-28 04:04:13,380 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 140 transitions. [2022-04-28 04:04:13,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:04:13,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:04:13,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:04:13,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:04:13,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 132 states have (on average 1.0303030303030303) internal successors, (136), 132 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:04:13,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 140 transitions. [2022-04-28 04:04:13,381 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 140 transitions. Word has length 133 [2022-04-28 04:04:13,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:04:13,382 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 140 transitions. [2022-04-28 04:04:13,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 66 states have (on average 1.9545454545454546) internal successors, (129), 65 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:04:13,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 140 transitions. [2022-04-28 04:04:13,496 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:04:13,496 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 140 transitions. [2022-04-28 04:04:13,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-28 04:04:13,497 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:04:13,497 INFO L195 NwaCegarLoop]: trace histogram [62, 60, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:04:13,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2022-04-28 04:04:13,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable61 [2022-04-28 04:04:13,697 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:04:13,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:04:13,698 INFO L85 PathProgramCache]: Analyzing trace with hash 387724817, now seen corresponding path program 60 times [2022-04-28 04:04:13,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:04:13,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [747780368] [2022-04-28 04:04:17,751 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:04:17,791 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 04:04:21,887 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:04:21,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 04:04:21,970 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:04:21,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1266984623, now seen corresponding path program 1 times [2022-04-28 04:04:21,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:04:21,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367951572] [2022-04-28 04:04:21,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:04:21,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:04:21,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:04:22,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:04:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:04:22,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {41114#(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(17, 2);call #Ultimate.allocInit(12, 3); {41103#true} is VALID [2022-04-28 04:04:22,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {41103#true} assume true; {41103#true} is VALID [2022-04-28 04:04:22,064 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41103#true} {41103#true} #41#return; {41103#true} is VALID [2022-04-28 04:04:22,064 INFO L272 TraceCheckUtils]: 0: Hoare triple {41103#true} call ULTIMATE.init(); {41114#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:04:22,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {41114#(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(17, 2);call #Ultimate.allocInit(12, 3); {41103#true} is VALID [2022-04-28 04:04:22,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {41103#true} assume true; {41103#true} is VALID [2022-04-28 04:04:22,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41103#true} {41103#true} #41#return; {41103#true} is VALID [2022-04-28 04:04:22,065 INFO L272 TraceCheckUtils]: 4: Hoare triple {41103#true} call #t~ret4 := main(); {41103#true} is VALID [2022-04-28 04:04:22,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {41103#true} ~x~0 := 0;~y~0 := 500000; {41108#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 04:04:22,066 INFO L290 TraceCheckUtils]: 6: Hoare triple {41108#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [285] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2908 v_main_~x~0_2907))) (or (and .cse0 (not (< v_main_~x~0_2908 500000))) .cse0 (and (< v_main_~x~0_2908 v_main_~x~0_2907) (< v_main_~x~0_2907 500001)))) InVars {main_~x~0=v_main_~x~0_2908} OutVars{main_~x~0=v_main_~x~0_2907} AuxVars[] AssignedVars[main_~x~0] {41109#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 04:04:22,066 INFO L290 TraceCheckUtils]: 7: Hoare triple {41109#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [286] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41109#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 04:04:22,067 INFO L290 TraceCheckUtils]: 8: Hoare triple {41109#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [287] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_2910)) (.cse1 (= v_main_~y~0_2308 v_main_~y~0_2307))) (or (and (= v_main_~x~0_2909 v_main_~x~0_2910) (or (not .cse0) (not (< v_main_~x~0_2910 1000000))) .cse1) (and (< v_main_~x~0_2909 1000001) (= (+ v_main_~x~0_2909 v_main_~y~0_2308) (+ v_main_~x~0_2910 v_main_~y~0_2307)) .cse0 (< v_main_~x~0_2910 v_main_~x~0_2909)) (and (= v_main_~x~0_2910 v_main_~x~0_2909) .cse1))) InVars {main_~x~0=v_main_~x~0_2910, main_~y~0=v_main_~y~0_2308} OutVars{main_~x~0=v_main_~x~0_2909, main_~y~0=v_main_~y~0_2307} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {41110#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:04:22,067 INFO L290 TraceCheckUtils]: 9: Hoare triple {41110#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [284] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {41111#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:04:22,068 INFO L272 TraceCheckUtils]: 10: Hoare triple {41111#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {41112#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:04:22,068 INFO L290 TraceCheckUtils]: 11: Hoare triple {41112#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {41113#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:04:22,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {41113#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {41104#false} is VALID [2022-04-28 04:04:22,068 INFO L290 TraceCheckUtils]: 13: Hoare triple {41104#false} assume !false; {41104#false} is VALID [2022-04-28 04:04:22,069 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 04:04:22,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:04:22,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367951572] [2022-04-28 04:04:22,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367951572] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:04:22,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738517065] [2022-04-28 04:04:22,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:04:22,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:04:22,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:04:22,083 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:04:22,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-04-28 04:04:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:04:22,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 04:04:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:04:22,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:04:22,489 INFO L272 TraceCheckUtils]: 0: Hoare triple {41103#true} call ULTIMATE.init(); {41103#true} is VALID [2022-04-28 04:04:22,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {41103#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(17, 2);call #Ultimate.allocInit(12, 3); {41103#true} is VALID [2022-04-28 04:04:22,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {41103#true} assume true; {41103#true} is VALID [2022-04-28 04:04:22,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41103#true} {41103#true} #41#return; {41103#true} is VALID [2022-04-28 04:04:22,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {41103#true} call #t~ret4 := main(); {41103#true} is VALID [2022-04-28 04:04:22,490 INFO L290 TraceCheckUtils]: 5: Hoare triple {41103#true} ~x~0 := 0;~y~0 := 500000; {41133#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 04:04:22,490 INFO L290 TraceCheckUtils]: 6: Hoare triple {41133#(and (<= main_~x~0 0) (= main_~y~0 500000))} [285] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2908 v_main_~x~0_2907))) (or (and .cse0 (not (< v_main_~x~0_2908 500000))) .cse0 (and (< v_main_~x~0_2908 v_main_~x~0_2907) (< v_main_~x~0_2907 500001)))) InVars {main_~x~0=v_main_~x~0_2908} OutVars{main_~x~0=v_main_~x~0_2907} AuxVars[] AssignedVars[main_~x~0] {41137#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 04:04:22,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {41137#(and (= main_~y~0 500000) (< main_~x~0 500001))} [286] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41137#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 04:04:22,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {41137#(and (= main_~y~0 500000) (< main_~x~0 500001))} [287] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_2910)) (.cse1 (= v_main_~y~0_2308 v_main_~y~0_2307))) (or (and (= v_main_~x~0_2909 v_main_~x~0_2910) (or (not .cse0) (not (< v_main_~x~0_2910 1000000))) .cse1) (and (< v_main_~x~0_2909 1000001) (= (+ v_main_~x~0_2909 v_main_~y~0_2308) (+ v_main_~x~0_2910 v_main_~y~0_2307)) .cse0 (< v_main_~x~0_2910 v_main_~x~0_2909)) (and (= v_main_~x~0_2910 v_main_~x~0_2909) .cse1))) InVars {main_~x~0=v_main_~x~0_2910, main_~y~0=v_main_~y~0_2308} OutVars{main_~x~0=v_main_~x~0_2909, main_~y~0=v_main_~y~0_2307} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {41144#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:04:22,492 INFO L290 TraceCheckUtils]: 9: Hoare triple {41144#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [284] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {41148#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:04:22,493 INFO L272 TraceCheckUtils]: 10: Hoare triple {41148#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {41152#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:04:22,493 INFO L290 TraceCheckUtils]: 11: Hoare triple {41152#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {41156#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:04:22,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {41156#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {41104#false} is VALID [2022-04-28 04:04:22,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {41104#false} assume !false; {41104#false} is VALID [2022-04-28 04:04:22,493 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 04:04:22,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:04:22,790 INFO L290 TraceCheckUtils]: 13: Hoare triple {41104#false} assume !false; {41104#false} is VALID [2022-04-28 04:04:22,790 INFO L290 TraceCheckUtils]: 12: Hoare triple {41156#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {41104#false} is VALID [2022-04-28 04:04:22,791 INFO L290 TraceCheckUtils]: 11: Hoare triple {41152#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {41156#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:04:22,791 INFO L272 TraceCheckUtils]: 10: Hoare triple {41111#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {41152#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:04:22,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {41175#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [284] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {41111#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:04:22,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {41179#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [287] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_2910)) (.cse1 (= v_main_~y~0_2308 v_main_~y~0_2307))) (or (and (= v_main_~x~0_2909 v_main_~x~0_2910) (or (not .cse0) (not (< v_main_~x~0_2910 1000000))) .cse1) (and (< v_main_~x~0_2909 1000001) (= (+ v_main_~x~0_2909 v_main_~y~0_2308) (+ v_main_~x~0_2910 v_main_~y~0_2307)) .cse0 (< v_main_~x~0_2910 v_main_~x~0_2909)) (and (= v_main_~x~0_2910 v_main_~x~0_2909) .cse1))) InVars {main_~x~0=v_main_~x~0_2910, main_~y~0=v_main_~y~0_2308} OutVars{main_~x~0=v_main_~x~0_2909, main_~y~0=v_main_~y~0_2307} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {41175#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:04:22,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {41179#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [286] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41179#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:04:22,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {41186#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [285] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2908 v_main_~x~0_2907))) (or (and .cse0 (not (< v_main_~x~0_2908 500000))) .cse0 (and (< v_main_~x~0_2908 v_main_~x~0_2907) (< v_main_~x~0_2907 500001)))) InVars {main_~x~0=v_main_~x~0_2908} OutVars{main_~x~0=v_main_~x~0_2907} AuxVars[] AssignedVars[main_~x~0] {41179#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:04:22,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {41103#true} ~x~0 := 0;~y~0 := 500000; {41186#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:04:22,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {41103#true} call #t~ret4 := main(); {41103#true} is VALID [2022-04-28 04:04:22,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41103#true} {41103#true} #41#return; {41103#true} is VALID [2022-04-28 04:04:22,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {41103#true} assume true; {41103#true} is VALID [2022-04-28 04:04:22,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {41103#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(17, 2);call #Ultimate.allocInit(12, 3); {41103#true} is VALID [2022-04-28 04:04:22,794 INFO L272 TraceCheckUtils]: 0: Hoare triple {41103#true} call ULTIMATE.init(); {41103#true} is VALID [2022-04-28 04:04: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 04:04:22,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738517065] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:04:22,794 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:04:22,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 04:04:25,903 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:04:25,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [747780368] [2022-04-28 04:04:25,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [747780368] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:04:25,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:04:25,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [68] imperfect sequences [] total 68 [2022-04-28 04:04:25,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143932656] [2022-04-28 04:04:25,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:04:25,904 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 67 states have (on average 1.955223880597015) internal successors, (131), 66 states have internal predecessors, (131), 2 states have call successors, (3), 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 135 [2022-04-28 04:04:25,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:04:25,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 68 states, 67 states have (on average 1.955223880597015) internal successors, (131), 66 states have internal predecessors, (131), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:04:25,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:04:25,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-04-28 04:04:25,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:04:25,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-04-28 04:04:25,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=578, Invalid=5742, Unknown=0, NotChecked=0, Total=6320 [2022-04-28 04:04:25,998 INFO L87 Difference]: Start difference. First operand 137 states and 140 transitions. Second operand has 68 states, 67 states have (on average 1.955223880597015) internal successors, (131), 66 states have internal predecessors, (131), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:04:40,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:04:40,126 INFO L93 Difference]: Finished difference Result 146 states and 151 transitions. [2022-04-28 04:04:40,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-04-28 04:04:40,126 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 67 states have (on average 1.955223880597015) internal successors, (131), 66 states have internal predecessors, (131), 2 states have call successors, (3), 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 135 [2022-04-28 04:04:40,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:04:40,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.955223880597015) internal successors, (131), 66 states have internal predecessors, (131), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:04:40,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 151 transitions. [2022-04-28 04:04:40,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.955223880597015) internal successors, (131), 66 states have internal predecessors, (131), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:04:40,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 151 transitions. [2022-04-28 04:04:40,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 151 transitions. [2022-04-28 04:04:40,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:04:40,247 INFO L225 Difference]: With dead ends: 146 [2022-04-28 04:04:40,247 INFO L226 Difference]: Without dead ends: 139 [2022-04-28 04:04:40,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3727 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1269, Invalid=19037, Unknown=0, NotChecked=0, Total=20306 [2022-04-28 04:04:40,248 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 131 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 8327 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 8456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 8327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:04:40,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 278 Invalid, 8456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 8327 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-04-28 04:04:40,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-04-28 04:04:40,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-04-28 04:04:40,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:04:40,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 139 states, 134 states have (on average 1.0298507462686568) internal successors, (138), 134 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:04:40,622 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 139 states, 134 states have (on average 1.0298507462686568) internal successors, (138), 134 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:04:40,623 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 139 states, 134 states have (on average 1.0298507462686568) internal successors, (138), 134 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:04:40,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:04:40,624 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2022-04-28 04:04:40,624 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 142 transitions. [2022-04-28 04:04:40,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:04:40,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:04:40,624 INFO L74 IsIncluded]: Start isIncluded. First operand has 139 states, 134 states have (on average 1.0298507462686568) internal successors, (138), 134 states have internal predecessors, (138), 3 states have call successors, (3), 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 139 states. [2022-04-28 04:04:40,624 INFO L87 Difference]: Start difference. First operand has 139 states, 134 states have (on average 1.0298507462686568) internal successors, (138), 134 states have internal predecessors, (138), 3 states have call successors, (3), 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 139 states. [2022-04-28 04:04:40,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:04:40,625 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2022-04-28 04:04:40,625 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 142 transitions. [2022-04-28 04:04:40,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:04:40,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:04:40,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:04:40,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:04:40,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 134 states have (on average 1.0298507462686568) internal successors, (138), 134 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:04:40,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 142 transitions. [2022-04-28 04:04:40,627 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 142 transitions. Word has length 135 [2022-04-28 04:04:40,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:04:40,627 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 142 transitions. [2022-04-28 04:04:40,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 67 states have (on average 1.955223880597015) internal successors, (131), 66 states have internal predecessors, (131), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:04:40,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 139 states and 142 transitions. [2022-04-28 04:04:40,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:04:40,745 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 142 transitions. [2022-04-28 04:04:40,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-04-28 04:04:40,747 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:04:40,747 INFO L195 NwaCegarLoop]: trace histogram [63, 61, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:04:40,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2022-04-28 04:04:40,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:04:40,947 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:04:40,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:04:40,948 INFO L85 PathProgramCache]: Analyzing trace with hash -822172756, now seen corresponding path program 61 times [2022-04-28 04:04:40,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:04:40,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1761476583] [2022-04-28 04:04:41,038 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 04:04:41,203 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 04:04:41,204 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:04:41,206 INFO L85 PathProgramCache]: Analyzing trace with hash -978450513, now seen corresponding path program 1 times [2022-04-28 04:04:41,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:04:41,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506506530] [2022-04-28 04:04:41,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:04:41,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:04:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:04:41,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:04:41,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:04:41,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {42254#(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(17, 2);call #Ultimate.allocInit(12, 3); {42243#true} is VALID [2022-04-28 04:04:41,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {42243#true} assume true; {42243#true} is VALID [2022-04-28 04:04:41,284 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42243#true} {42243#true} #41#return; {42243#true} is VALID [2022-04-28 04:04:41,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {42243#true} call ULTIMATE.init(); {42254#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:04:41,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {42254#(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(17, 2);call #Ultimate.allocInit(12, 3); {42243#true} is VALID [2022-04-28 04:04:41,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {42243#true} assume true; {42243#true} is VALID [2022-04-28 04:04:41,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42243#true} {42243#true} #41#return; {42243#true} is VALID [2022-04-28 04:04:41,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {42243#true} call #t~ret4 := main(); {42243#true} is VALID [2022-04-28 04:04:41,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {42243#true} ~x~0 := 0;~y~0 := 500000; {42248#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 04:04:41,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {42248#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [289] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2987 v_main_~x~0_2986))) (or .cse0 (and .cse0 (not (< v_main_~x~0_2987 500000))) (and (< v_main_~x~0_2987 v_main_~x~0_2986) (< v_main_~x~0_2986 500001)))) InVars {main_~x~0=v_main_~x~0_2987} OutVars{main_~x~0=v_main_~x~0_2986} AuxVars[] AssignedVars[main_~x~0] {42249#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 04:04:41,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {42249#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [290] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42249#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-28 04:04:41,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {42249#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [291] L11-2-->L10-2_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_2989)) (.cse0 (= v_main_~y~0_2377 v_main_~y~0_2376)) (.cse1 (= v_main_~x~0_2989 v_main_~x~0_2988))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_2989 1000000)))) (let ((.cse3 (+ v_main_~x~0_2989 v_main_~y~0_2376))) (and (= .cse3 (+ v_main_~x~0_2988 v_main_~y~0_2377)) .cse2 (< .cse3 (+ 1000001 v_main_~y~0_2377)) (< v_main_~y~0_2377 v_main_~y~0_2376))) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_2989, main_~y~0=v_main_~y~0_2377} OutVars{main_~x~0=v_main_~x~0_2988, main_~y~0=v_main_~y~0_2376} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {42250#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} is VALID [2022-04-28 04:04:41,287 INFO L290 TraceCheckUtils]: 9: Hoare triple {42250#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} [288] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {42251#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:04:41,288 INFO L272 TraceCheckUtils]: 10: Hoare triple {42251#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {42252#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:04:41,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {42252#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {42253#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:04:41,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {42253#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {42244#false} is VALID [2022-04-28 04:04:41,288 INFO L290 TraceCheckUtils]: 13: Hoare triple {42244#false} assume !false; {42244#false} is VALID [2022-04-28 04:04:41,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 04:04:41,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:04:41,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506506530] [2022-04-28 04:04:41,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506506530] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:04:41,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950168475] [2022-04-28 04:04:41,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:04:41,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:04:41,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:04:41,290 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:04:41,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-04-28 04:04:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:04:41,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 04:04:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:04:41,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:04:41,651 INFO L272 TraceCheckUtils]: 0: Hoare triple {42243#true} call ULTIMATE.init(); {42243#true} is VALID [2022-04-28 04:04:41,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {42243#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(17, 2);call #Ultimate.allocInit(12, 3); {42243#true} is VALID [2022-04-28 04:04:41,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {42243#true} assume true; {42243#true} is VALID [2022-04-28 04:04:41,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42243#true} {42243#true} #41#return; {42243#true} is VALID [2022-04-28 04:04:41,651 INFO L272 TraceCheckUtils]: 4: Hoare triple {42243#true} call #t~ret4 := main(); {42243#true} is VALID [2022-04-28 04:04:41,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {42243#true} ~x~0 := 0;~y~0 := 500000; {42273#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 04:04:41,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {42273#(and (<= main_~x~0 0) (= main_~y~0 500000))} [289] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2987 v_main_~x~0_2986))) (or .cse0 (and .cse0 (not (< v_main_~x~0_2987 500000))) (and (< v_main_~x~0_2987 v_main_~x~0_2986) (< v_main_~x~0_2986 500001)))) InVars {main_~x~0=v_main_~x~0_2987} OutVars{main_~x~0=v_main_~x~0_2986} AuxVars[] AssignedVars[main_~x~0] {42277#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 04:04:41,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {42277#(and (= main_~y~0 500000) (< main_~x~0 500001))} [290] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42277#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 04:04:41,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {42277#(and (= main_~y~0 500000) (< main_~x~0 500001))} [291] L11-2-->L10-2_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_2989)) (.cse0 (= v_main_~y~0_2377 v_main_~y~0_2376)) (.cse1 (= v_main_~x~0_2989 v_main_~x~0_2988))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_2989 1000000)))) (let ((.cse3 (+ v_main_~x~0_2989 v_main_~y~0_2376))) (and (= .cse3 (+ v_main_~x~0_2988 v_main_~y~0_2377)) .cse2 (< .cse3 (+ 1000001 v_main_~y~0_2377)) (< v_main_~y~0_2377 v_main_~y~0_2376))) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_2989, main_~y~0=v_main_~y~0_2377} OutVars{main_~x~0=v_main_~x~0_2988, main_~y~0=v_main_~y~0_2376} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {42284#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:04:41,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {42284#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [288] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {42288#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:04:41,654 INFO L272 TraceCheckUtils]: 10: Hoare triple {42288#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {42292#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:04:41,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {42292#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {42296#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:04:41,655 INFO L290 TraceCheckUtils]: 12: Hoare triple {42296#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {42244#false} is VALID [2022-04-28 04:04:41,655 INFO L290 TraceCheckUtils]: 13: Hoare triple {42244#false} assume !false; {42244#false} is VALID [2022-04-28 04:04:41,655 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 04:04:41,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:04:41,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {42244#false} assume !false; {42244#false} is VALID [2022-04-28 04:04:41,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {42296#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {42244#false} is VALID [2022-04-28 04:04:41,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {42292#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {42296#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:04:41,943 INFO L272 TraceCheckUtils]: 10: Hoare triple {42251#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {42292#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:04:41,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {42315#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [288] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {42251#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:04:41,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {42319#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [291] L11-2-->L10-2_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_2989)) (.cse0 (= v_main_~y~0_2377 v_main_~y~0_2376)) (.cse1 (= v_main_~x~0_2989 v_main_~x~0_2988))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_2989 1000000)))) (let ((.cse3 (+ v_main_~x~0_2989 v_main_~y~0_2376))) (and (= .cse3 (+ v_main_~x~0_2988 v_main_~y~0_2377)) .cse2 (< .cse3 (+ 1000001 v_main_~y~0_2377)) (< v_main_~y~0_2377 v_main_~y~0_2376))) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_2989, main_~y~0=v_main_~y~0_2377} OutVars{main_~x~0=v_main_~x~0_2988, main_~y~0=v_main_~y~0_2376} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {42315#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:04:41,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {42319#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [290] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42319#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:04:41,946 INFO L290 TraceCheckUtils]: 6: Hoare triple {42326#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [289] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2987 v_main_~x~0_2986))) (or .cse0 (and .cse0 (not (< v_main_~x~0_2987 500000))) (and (< v_main_~x~0_2987 v_main_~x~0_2986) (< v_main_~x~0_2986 500001)))) InVars {main_~x~0=v_main_~x~0_2987} OutVars{main_~x~0=v_main_~x~0_2986} AuxVars[] AssignedVars[main_~x~0] {42319#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:04:41,946 INFO L290 TraceCheckUtils]: 5: Hoare triple {42243#true} ~x~0 := 0;~y~0 := 500000; {42326#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 04:04:41,946 INFO L272 TraceCheckUtils]: 4: Hoare triple {42243#true} call #t~ret4 := main(); {42243#true} is VALID [2022-04-28 04:04:41,946 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42243#true} {42243#true} #41#return; {42243#true} is VALID [2022-04-28 04:04:41,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {42243#true} assume true; {42243#true} is VALID [2022-04-28 04:04:41,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {42243#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(17, 2);call #Ultimate.allocInit(12, 3); {42243#true} is VALID [2022-04-28 04:04:41,947 INFO L272 TraceCheckUtils]: 0: Hoare triple {42243#true} call ULTIMATE.init(); {42243#true} is VALID [2022-04-28 04:04:41,947 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 04:04:41,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950168475] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:04:41,947 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:04:41,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 04:04:45,138 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:04:45,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1761476583] [2022-04-28 04:04:45,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1761476583] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:04:45,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:04:45,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2022-04-28 04:04:45,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400365966] [2022-04-28 04:04:45,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:04:45,139 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 68 states have (on average 1.9558823529411764) internal successors, (133), 67 states have internal predecessors, (133), 2 states have call successors, (3), 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 137 [2022-04-28 04:04:45,139 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:04:45,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 69 states, 68 states have (on average 1.9558823529411764) internal successors, (133), 67 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:04:45,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:04:45,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-04-28 04:04:45,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:04:45,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-04-28 04:04:45,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=586, Invalid=5894, Unknown=0, NotChecked=0, Total=6480 [2022-04-28 04:04:45,235 INFO L87 Difference]: Start difference. First operand 139 states and 142 transitions. Second operand has 69 states, 68 states have (on average 1.9558823529411764) internal successors, (133), 67 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:04:59,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:04:59,523 INFO L93 Difference]: Finished difference Result 148 states and 153 transitions. [2022-04-28 04:04:59,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-04-28 04:04:59,524 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 68 states have (on average 1.9558823529411764) internal successors, (133), 67 states have internal predecessors, (133), 2 states have call successors, (3), 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 137 [2022-04-28 04:04:59,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:04:59,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.9558823529411764) internal successors, (133), 67 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:04:59,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 153 transitions. [2022-04-28 04:04:59,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.9558823529411764) internal successors, (133), 67 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:04:59,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 153 transitions. [2022-04-28 04:04:59,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 153 transitions. [2022-04-28 04:04:59,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:04:59,643 INFO L225 Difference]: With dead ends: 148 [2022-04-28 04:04:59,644 INFO L226 Difference]: Without dead ends: 141 [2022-04-28 04:04:59,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 83 SyntacticMatches, 3 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3817 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1288, Invalid=19592, Unknown=0, NotChecked=0, Total=20880 [2022-04-28 04:04:59,645 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 133 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 8460 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 8591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 8460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-04-28 04:04:59,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 278 Invalid, 8591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 8460 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-04-28 04:04:59,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-04-28 04:05:00,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2022-04-28 04:05:00,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:05:00,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 141 states, 136 states have (on average 1.0294117647058822) internal successors, (140), 136 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:05:00,033 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 141 states, 136 states have (on average 1.0294117647058822) internal successors, (140), 136 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:05:00,033 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 141 states, 136 states have (on average 1.0294117647058822) internal successors, (140), 136 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:05:00,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:05:00,034 INFO L93 Difference]: Finished difference Result 141 states and 144 transitions. [2022-04-28 04:05:00,034 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 144 transitions. [2022-04-28 04:05:00,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:05:00,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:05:00,035 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 136 states have (on average 1.0294117647058822) internal successors, (140), 136 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 141 states. [2022-04-28 04:05:00,035 INFO L87 Difference]: Start difference. First operand has 141 states, 136 states have (on average 1.0294117647058822) internal successors, (140), 136 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 141 states. [2022-04-28 04:05:00,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:05:00,036 INFO L93 Difference]: Finished difference Result 141 states and 144 transitions. [2022-04-28 04:05:00,036 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 144 transitions. [2022-04-28 04:05:00,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:05:00,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:05:00,036 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:05:00,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:05:00,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 136 states have (on average 1.0294117647058822) internal successors, (140), 136 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:05:00,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 144 transitions. [2022-04-28 04:05:00,037 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 144 transitions. Word has length 137 [2022-04-28 04:05:00,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:05:00,038 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 144 transitions. [2022-04-28 04:05:00,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 68 states have (on average 1.9558823529411764) internal successors, (133), 67 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:05:00,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 141 states and 144 transitions. [2022-04-28 04:05:00,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:05:00,158 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 144 transitions. [2022-04-28 04:05:00,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-04-28 04:05:00,158 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:05:00,158 INFO L195 NwaCegarLoop]: trace histogram [64, 62, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:05:00,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2022-04-28 04:05:00,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:05:00,359 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:05:00,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:05:00,359 INFO L85 PathProgramCache]: Analyzing trace with hash 402396807, now seen corresponding path program 62 times [2022-04-28 04:05:00,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:05:00,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [672261093] [2022-04-28 04:05:00,436 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 04:05:04,536 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:05:04,629 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 04:05:04,630 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:05:04,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1071081647, now seen corresponding path program 1 times [2022-04-28 04:05:04,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:05:04,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066921331] [2022-04-28 04:05:04,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:05:04,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:05:04,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:05:04,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:05:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:05:04,714 INFO L290 TraceCheckUtils]: 0: Hoare triple {43409#(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(17, 2);call #Ultimate.allocInit(12, 3); {43398#true} is VALID [2022-04-28 04:05:04,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {43398#true} assume true; {43398#true} is VALID [2022-04-28 04:05:04,715 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43398#true} {43398#true} #41#return; {43398#true} is VALID [2022-04-28 04:05:04,715 INFO L272 TraceCheckUtils]: 0: Hoare triple {43398#true} call ULTIMATE.init(); {43409#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:05:04,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {43409#(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(17, 2);call #Ultimate.allocInit(12, 3); {43398#true} is VALID [2022-04-28 04:05:04,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {43398#true} assume true; {43398#true} is VALID [2022-04-28 04:05:04,715 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43398#true} {43398#true} #41#return; {43398#true} is VALID [2022-04-28 04:05:04,715 INFO L272 TraceCheckUtils]: 4: Hoare triple {43398#true} call #t~ret4 := main(); {43398#true} is VALID [2022-04-28 04:05:04,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {43398#true} ~x~0 := 0;~y~0 := 500000; {43403#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 04:05:04,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {43403#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [293] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3067 v_main_~x~0_3066))) (or .cse0 (and (< v_main_~x~0_3067 v_main_~x~0_3066) (< v_main_~x~0_3066 500001)) (and (<= 500000 v_main_~x~0_3067) .cse0))) InVars {main_~x~0=v_main_~x~0_3067} OutVars{main_~x~0=v_main_~x~0_3066} AuxVars[] AssignedVars[main_~x~0] {43404#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 04:05:04,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {43404#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [294] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43404#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 04:05:04,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {43404#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [295] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3069 v_main_~x~0_3068)) (.cse2 (<= 500000 v_main_~x~0_3069)) (.cse1 (= v_main_~y~0_2447 v_main_~y~0_2446))) (or (and .cse0 .cse1) (and .cse2 (< v_main_~x~0_3069 v_main_~x~0_3068) (= (+ v_main_~x~0_3068 v_main_~y~0_2447) (+ v_main_~x~0_3069 v_main_~y~0_2446)) (< v_main_~x~0_3068 1000001)) (and .cse0 (or (not .cse2) (not (< v_main_~x~0_3069 1000000))) .cse1))) InVars {main_~x~0=v_main_~x~0_3069, main_~y~0=v_main_~y~0_2447} OutVars{main_~x~0=v_main_~x~0_3068, main_~y~0=v_main_~y~0_2446} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {43405#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:05:04,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {43405#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [292] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {43406#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0) (not (= main_~x~0 0)))} is VALID [2022-04-28 04:05:04,719 INFO L272 TraceCheckUtils]: 10: Hoare triple {43406#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0) (not (= main_~x~0 0)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {43407#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:05:04,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {43407#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {43408#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:05:04,719 INFO L290 TraceCheckUtils]: 12: Hoare triple {43408#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {43399#false} is VALID [2022-04-28 04:05:04,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {43399#false} assume !false; {43399#false} is VALID [2022-04-28 04:05:04,719 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 04:05:04,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:05:04,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066921331] [2022-04-28 04:05:04,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066921331] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:05:04,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966086290] [2022-04-28 04:05:04,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:05:04,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:05:04,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:05:04,721 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:05:04,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-04-28 04:05:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:05:04,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 04:05:04,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:05:04,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:05:05,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {43398#true} call ULTIMATE.init(); {43398#true} is VALID [2022-04-28 04:05:05,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {43398#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(17, 2);call #Ultimate.allocInit(12, 3); {43398#true} is VALID [2022-04-28 04:05:05,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {43398#true} assume true; {43398#true} is VALID [2022-04-28 04:05:05,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43398#true} {43398#true} #41#return; {43398#true} is VALID [2022-04-28 04:05:05,088 INFO L272 TraceCheckUtils]: 4: Hoare triple {43398#true} call #t~ret4 := main(); {43398#true} is VALID [2022-04-28 04:05:05,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {43398#true} ~x~0 := 0;~y~0 := 500000; {43428#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 04:05:05,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {43428#(and (<= main_~x~0 0) (= main_~y~0 500000))} [293] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3067 v_main_~x~0_3066))) (or .cse0 (and (< v_main_~x~0_3067 v_main_~x~0_3066) (< v_main_~x~0_3066 500001)) (and (<= 500000 v_main_~x~0_3067) .cse0))) InVars {main_~x~0=v_main_~x~0_3067} OutVars{main_~x~0=v_main_~x~0_3066} AuxVars[] AssignedVars[main_~x~0] {43432#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 04:05:05,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {43432#(and (= main_~y~0 500000) (< main_~x~0 500001))} [294] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43432#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 04:05:05,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {43432#(and (= main_~y~0 500000) (< main_~x~0 500001))} [295] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3069 v_main_~x~0_3068)) (.cse2 (<= 500000 v_main_~x~0_3069)) (.cse1 (= v_main_~y~0_2447 v_main_~y~0_2446))) (or (and .cse0 .cse1) (and .cse2 (< v_main_~x~0_3069 v_main_~x~0_3068) (= (+ v_main_~x~0_3068 v_main_~y~0_2447) (+ v_main_~x~0_3069 v_main_~y~0_2446)) (< v_main_~x~0_3068 1000001)) (and .cse0 (or (not .cse2) (not (< v_main_~x~0_3069 1000000))) .cse1))) InVars {main_~x~0=v_main_~x~0_3069, main_~y~0=v_main_~y~0_2447} OutVars{main_~x~0=v_main_~x~0_3068, main_~y~0=v_main_~y~0_2446} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {43439#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:05:05,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {43439#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [292] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {43443#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:05:05,091 INFO L272 TraceCheckUtils]: 10: Hoare triple {43443#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {43447#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:05:05,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {43447#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {43451#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:05:05,091 INFO L290 TraceCheckUtils]: 12: Hoare triple {43451#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {43399#false} is VALID [2022-04-28 04:05:05,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {43399#false} assume !false; {43399#false} is VALID [2022-04-28 04:05:05,091 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 04:05:05,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:05:05,648 INFO L290 TraceCheckUtils]: 13: Hoare triple {43399#false} assume !false; {43399#false} is VALID [2022-04-28 04:05:05,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {43451#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {43399#false} is VALID [2022-04-28 04:05:05,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {43447#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {43451#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:05:05,649 INFO L272 TraceCheckUtils]: 10: Hoare triple {43467#(= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {43447#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:05:05,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {43471#(or (< main_~x~0 1000000) (= main_~y~0 main_~x~0))} [292] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {43467#(= main_~y~0 main_~x~0)} is VALID [2022-04-28 04:05:05,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {43475#(forall ((v_main_~x~0_3078 Int)) (or (< v_main_~x~0_3078 1000000) (and (or (= v_main_~x~0_3078 (+ v_main_~x~0_3078 main_~y~0 (* (- 1) main_~x~0))) (not (< v_main_~x~0_3078 1000001)) (not (<= 500000 main_~x~0)) (not (< main_~x~0 v_main_~x~0_3078))) (or (not (= v_main_~x~0_3078 main_~x~0)) (= v_main_~x~0_3078 main_~y~0)))))} [295] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3069 v_main_~x~0_3068)) (.cse2 (<= 500000 v_main_~x~0_3069)) (.cse1 (= v_main_~y~0_2447 v_main_~y~0_2446))) (or (and .cse0 .cse1) (and .cse2 (< v_main_~x~0_3069 v_main_~x~0_3068) (= (+ v_main_~x~0_3068 v_main_~y~0_2447) (+ v_main_~x~0_3069 v_main_~y~0_2446)) (< v_main_~x~0_3068 1000001)) (and .cse0 (or (not .cse2) (not (< v_main_~x~0_3069 1000000))) .cse1))) InVars {main_~x~0=v_main_~x~0_3069, main_~y~0=v_main_~y~0_2447} OutVars{main_~x~0=v_main_~x~0_3068, main_~y~0=v_main_~y~0_2446} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {43471#(or (< main_~x~0 1000000) (= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:05:05,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {43475#(forall ((v_main_~x~0_3078 Int)) (or (< v_main_~x~0_3078 1000000) (and (or (= v_main_~x~0_3078 (+ v_main_~x~0_3078 main_~y~0 (* (- 1) main_~x~0))) (not (< v_main_~x~0_3078 1000001)) (not (<= 500000 main_~x~0)) (not (< main_~x~0 v_main_~x~0_3078))) (or (not (= v_main_~x~0_3078 main_~x~0)) (= v_main_~x~0_3078 main_~y~0)))))} [294] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43475#(forall ((v_main_~x~0_3078 Int)) (or (< v_main_~x~0_3078 1000000) (and (or (= v_main_~x~0_3078 (+ v_main_~x~0_3078 main_~y~0 (* (- 1) main_~x~0))) (not (< v_main_~x~0_3078 1000001)) (not (<= 500000 main_~x~0)) (not (< main_~x~0 v_main_~x~0_3078))) (or (not (= v_main_~x~0_3078 main_~x~0)) (= v_main_~x~0_3078 main_~y~0)))))} is VALID [2022-04-28 04:05:05,653 INFO L290 TraceCheckUtils]: 6: Hoare triple {43482#(forall ((v_main_~x~0_3078 Int)) (or (< v_main_~x~0_3078 1000000) (and (or (= v_main_~x~0_3078 (+ v_main_~x~0_3078 main_~y~0 (* (- 1) main_~x~0))) (not (< v_main_~x~0_3078 1000001)) (not (<= 500000 main_~x~0)) (not (< main_~x~0 v_main_~x~0_3078))) (or (and (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (<= 500000 main_~y~0) (<= v_main_~x~0_3078 (+ main_~x~0 1)))) (not (< v_main_~x~0_3078 1000001))) (or (not (= v_main_~x~0_3078 main_~x~0)) (= v_main_~x~0_3078 main_~y~0)))))} [293] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3067 v_main_~x~0_3066))) (or .cse0 (and (< v_main_~x~0_3067 v_main_~x~0_3066) (< v_main_~x~0_3066 500001)) (and (<= 500000 v_main_~x~0_3067) .cse0))) InVars {main_~x~0=v_main_~x~0_3067} OutVars{main_~x~0=v_main_~x~0_3066} AuxVars[] AssignedVars[main_~x~0] {43475#(forall ((v_main_~x~0_3078 Int)) (or (< v_main_~x~0_3078 1000000) (and (or (= v_main_~x~0_3078 (+ v_main_~x~0_3078 main_~y~0 (* (- 1) main_~x~0))) (not (< v_main_~x~0_3078 1000001)) (not (<= 500000 main_~x~0)) (not (< main_~x~0 v_main_~x~0_3078))) (or (not (= v_main_~x~0_3078 main_~x~0)) (= v_main_~x~0_3078 main_~y~0)))))} is VALID [2022-04-28 04:05:05,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {43398#true} ~x~0 := 0;~y~0 := 500000; {43482#(forall ((v_main_~x~0_3078 Int)) (or (< v_main_~x~0_3078 1000000) (and (or (= v_main_~x~0_3078 (+ v_main_~x~0_3078 main_~y~0 (* (- 1) main_~x~0))) (not (< v_main_~x~0_3078 1000001)) (not (<= 500000 main_~x~0)) (not (< main_~x~0 v_main_~x~0_3078))) (or (and (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (<= 500000 main_~y~0) (<= v_main_~x~0_3078 (+ main_~x~0 1)))) (not (< v_main_~x~0_3078 1000001))) (or (not (= v_main_~x~0_3078 main_~x~0)) (= v_main_~x~0_3078 main_~y~0)))))} is VALID [2022-04-28 04:05:05,654 INFO L272 TraceCheckUtils]: 4: Hoare triple {43398#true} call #t~ret4 := main(); {43398#true} is VALID [2022-04-28 04:05:05,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43398#true} {43398#true} #41#return; {43398#true} is VALID [2022-04-28 04:05:05,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {43398#true} assume true; {43398#true} is VALID [2022-04-28 04:05:05,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {43398#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(17, 2);call #Ultimate.allocInit(12, 3); {43398#true} is VALID [2022-04-28 04:05:05,654 INFO L272 TraceCheckUtils]: 0: Hoare triple {43398#true} call ULTIMATE.init(); {43398#true} is VALID [2022-04-28 04:05:05,655 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 04:05:05,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966086290] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:05:05,655 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:05:05,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2022-04-28 04:05:08,898 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:05:08,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [672261093] [2022-04-28 04:05:08,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [672261093] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:05:08,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:05:08,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [70] imperfect sequences [] total 70 [2022-04-28 04:05:08,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053507424] [2022-04-28 04:05:08,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:05:08,899 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 69 states have (on average 1.9565217391304348) internal successors, (135), 68 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 139 [2022-04-28 04:05:08,899 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:05:08,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 70 states, 69 states have (on average 1.9565217391304348) internal successors, (135), 68 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:05:08,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:05:08,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-04-28 04:05:08,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:05:08,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-04-28 04:05:08,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=663, Invalid=6143, Unknown=0, NotChecked=0, Total=6806 [2022-04-28 04:05:08,994 INFO L87 Difference]: Start difference. First operand 141 states and 144 transitions. Second operand has 70 states, 69 states have (on average 1.9565217391304348) internal successors, (135), 68 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:05:23,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:05:23,552 INFO L93 Difference]: Finished difference Result 150 states and 155 transitions. [2022-04-28 04:05:23,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-04-28 04:05:23,552 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 69 states have (on average 1.9565217391304348) internal successors, (135), 68 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 139 [2022-04-28 04:05:23,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:05:23,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.9565217391304348) internal successors, (135), 68 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:05:23,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 155 transitions. [2022-04-28 04:05:23,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.9565217391304348) internal successors, (135), 68 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:05:23,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 155 transitions. [2022-04-28 04:05:23,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 155 transitions. [2022-04-28 04:05:23,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:05:23,704 INFO L225 Difference]: With dead ends: 150 [2022-04-28 04:05:23,704 INFO L226 Difference]: Without dead ends: 143 [2022-04-28 04:05:23,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4041 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1439, Invalid=20317, Unknown=0, NotChecked=0, Total=21756 [2022-04-28 04:05:23,706 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 135 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 8669 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 8802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 8669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-04-28 04:05:23,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 258 Invalid, 8802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 8669 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2022-04-28 04:05:23,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-04-28 04:05:24,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2022-04-28 04:05:24,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:05:24,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 143 states, 138 states have (on average 1.0289855072463767) internal successors, (142), 138 states have internal predecessors, (142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:05:24,099 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 143 states, 138 states have (on average 1.0289855072463767) internal successors, (142), 138 states have internal predecessors, (142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:05:24,099 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 143 states, 138 states have (on average 1.0289855072463767) internal successors, (142), 138 states have internal predecessors, (142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:05:24,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:05:24,100 INFO L93 Difference]: Finished difference Result 143 states and 146 transitions. [2022-04-28 04:05:24,100 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 146 transitions. [2022-04-28 04:05:24,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:05:24,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:05:24,100 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 138 states have (on average 1.0289855072463767) internal successors, (142), 138 states have internal predecessors, (142), 3 states have call successors, (3), 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 143 states. [2022-04-28 04:05:24,100 INFO L87 Difference]: Start difference. First operand has 143 states, 138 states have (on average 1.0289855072463767) internal successors, (142), 138 states have internal predecessors, (142), 3 states have call successors, (3), 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 143 states. [2022-04-28 04:05:24,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:05:24,101 INFO L93 Difference]: Finished difference Result 143 states and 146 transitions. [2022-04-28 04:05:24,102 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 146 transitions. [2022-04-28 04:05:24,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:05:24,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:05:24,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:05:24,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:05:24,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 138 states have (on average 1.0289855072463767) internal successors, (142), 138 states have internal predecessors, (142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:05:24,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 146 transitions. [2022-04-28 04:05:24,103 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 146 transitions. Word has length 139 [2022-04-28 04:05:24,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:05:24,103 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 146 transitions. [2022-04-28 04:05:24,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 69 states have (on average 1.9565217391304348) internal successors, (135), 68 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:05:24,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 143 states and 146 transitions. [2022-04-28 04:05:24,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:05:24,223 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 146 transitions. [2022-04-28 04:05:24,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-04-28 04:05:24,223 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:05:24,224 INFO L195 NwaCegarLoop]: trace histogram [65, 63, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:05:24,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2022-04-28 04:05:24,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable64 [2022-04-28 04:05:24,424 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:05:24,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:05:24,424 INFO L85 PathProgramCache]: Analyzing trace with hash 392707746, now seen corresponding path program 63 times [2022-04-28 04:05:24,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:05:24,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1036799889] [2022-04-28 04:05:28,486 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:05:28,531 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 04:05:28,698 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 04:05:28,699 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:05:28,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1174353489, now seen corresponding path program 1 times [2022-04-28 04:05:28,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:05:28,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662624821] [2022-04-28 04:05:28,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:05:28,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:05:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:05:28,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:05:28,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:05:28,794 INFO L290 TraceCheckUtils]: 0: Hoare triple {44580#(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(17, 2);call #Ultimate.allocInit(12, 3); {44569#true} is VALID [2022-04-28 04:05:28,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {44569#true} assume true; {44569#true} is VALID [2022-04-28 04:05:28,794 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44569#true} {44569#true} #41#return; {44569#true} is VALID [2022-04-28 04:05:28,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {44569#true} call ULTIMATE.init(); {44580#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:05:28,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {44580#(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(17, 2);call #Ultimate.allocInit(12, 3); {44569#true} is VALID [2022-04-28 04:05:28,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {44569#true} assume true; {44569#true} is VALID [2022-04-28 04:05:28,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44569#true} {44569#true} #41#return; {44569#true} is VALID [2022-04-28 04:05:28,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {44569#true} call #t~ret4 := main(); {44569#true} is VALID [2022-04-28 04:05:28,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {44569#true} ~x~0 := 0;~y~0 := 500000; {44574#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 04:05:28,796 INFO L290 TraceCheckUtils]: 6: Hoare triple {44574#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [297] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3148 v_main_~x~0_3147))) (or (and (<= 500000 v_main_~x~0_3148) .cse0) (and (< v_main_~x~0_3148 v_main_~x~0_3147) (< v_main_~x~0_3147 500001)) .cse0)) InVars {main_~x~0=v_main_~x~0_3148} OutVars{main_~x~0=v_main_~x~0_3147} AuxVars[] AssignedVars[main_~x~0] {44575#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 04:05:28,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {44575#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [298] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44575#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 04:05:28,797 INFO L290 TraceCheckUtils]: 8: Hoare triple {44575#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [299] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_3150 v_main_~x~0_3149)) (.cse2 (= v_main_~y~0_2518 v_main_~y~0_2517)) (.cse0 (<= 500000 v_main_~x~0_3150))) (or (and (or (not (< v_main_~x~0_3150 1000000)) (not .cse0)) .cse1 .cse2) (and .cse1 .cse2) (let ((.cse3 (+ v_main_~x~0_3150 v_main_~y~0_2517))) (and (< .cse3 (+ 1000001 v_main_~y~0_2518)) (= (+ v_main_~x~0_3149 v_main_~y~0_2518) .cse3) (< v_main_~y~0_2518 v_main_~y~0_2517) .cse0)))) InVars {main_~x~0=v_main_~x~0_3150, main_~y~0=v_main_~y~0_2518} OutVars{main_~x~0=v_main_~x~0_3149, main_~y~0=v_main_~y~0_2517} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {44576#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:05:28,798 INFO L290 TraceCheckUtils]: 9: Hoare triple {44576#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [296] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {44577#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:05:28,798 INFO L272 TraceCheckUtils]: 10: Hoare triple {44577#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {44578#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:05:28,798 INFO L290 TraceCheckUtils]: 11: Hoare triple {44578#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {44579#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:05:28,799 INFO L290 TraceCheckUtils]: 12: Hoare triple {44579#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {44570#false} is VALID [2022-04-28 04:05:28,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {44570#false} assume !false; {44570#false} is VALID [2022-04-28 04:05:28,799 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 04:05:28,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:05:28,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662624821] [2022-04-28 04:05:28,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662624821] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:05:28,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867621300] [2022-04-28 04:05:28,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:05:28,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:05:28,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:05:28,800 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:05:28,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-04-28 04:05:28,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:05:28,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 04:05:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:05:28,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:05:29,142 INFO L272 TraceCheckUtils]: 0: Hoare triple {44569#true} call ULTIMATE.init(); {44569#true} is VALID [2022-04-28 04:05:29,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {44569#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(17, 2);call #Ultimate.allocInit(12, 3); {44569#true} is VALID [2022-04-28 04:05:29,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {44569#true} assume true; {44569#true} is VALID [2022-04-28 04:05:29,142 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44569#true} {44569#true} #41#return; {44569#true} is VALID [2022-04-28 04:05:29,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {44569#true} call #t~ret4 := main(); {44569#true} is VALID [2022-04-28 04:05:29,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {44569#true} ~x~0 := 0;~y~0 := 500000; {44599#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 04:05:29,143 INFO L290 TraceCheckUtils]: 6: Hoare triple {44599#(and (<= main_~x~0 0) (= main_~y~0 500000))} [297] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3148 v_main_~x~0_3147))) (or (and (<= 500000 v_main_~x~0_3148) .cse0) (and (< v_main_~x~0_3148 v_main_~x~0_3147) (< v_main_~x~0_3147 500001)) .cse0)) InVars {main_~x~0=v_main_~x~0_3148} OutVars{main_~x~0=v_main_~x~0_3147} AuxVars[] AssignedVars[main_~x~0] {44603#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 04:05:29,144 INFO L290 TraceCheckUtils]: 7: Hoare triple {44603#(and (= main_~y~0 500000) (< main_~x~0 500001))} [298] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44603#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 04:05:29,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {44603#(and (= main_~y~0 500000) (< main_~x~0 500001))} [299] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_3150 v_main_~x~0_3149)) (.cse2 (= v_main_~y~0_2518 v_main_~y~0_2517)) (.cse0 (<= 500000 v_main_~x~0_3150))) (or (and (or (not (< v_main_~x~0_3150 1000000)) (not .cse0)) .cse1 .cse2) (and .cse1 .cse2) (let ((.cse3 (+ v_main_~x~0_3150 v_main_~y~0_2517))) (and (< .cse3 (+ 1000001 v_main_~y~0_2518)) (= (+ v_main_~x~0_3149 v_main_~y~0_2518) .cse3) (< v_main_~y~0_2518 v_main_~y~0_2517) .cse0)))) InVars {main_~x~0=v_main_~x~0_3150, main_~y~0=v_main_~y~0_2518} OutVars{main_~x~0=v_main_~x~0_3149, main_~y~0=v_main_~y~0_2517} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {44610#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:05:29,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {44610#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [296] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {44614#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:05:29,146 INFO L272 TraceCheckUtils]: 10: Hoare triple {44614#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {44618#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:05:29,146 INFO L290 TraceCheckUtils]: 11: Hoare triple {44618#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {44622#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:05:29,146 INFO L290 TraceCheckUtils]: 12: Hoare triple {44622#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {44570#false} is VALID [2022-04-28 04:05:29,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {44570#false} assume !false; {44570#false} is VALID [2022-04-28 04:05:29,146 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 04:05:29,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:05:29,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {44570#false} assume !false; {44570#false} is VALID [2022-04-28 04:05:29,438 INFO L290 TraceCheckUtils]: 12: Hoare triple {44622#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {44570#false} is VALID [2022-04-28 04:05:29,438 INFO L290 TraceCheckUtils]: 11: Hoare triple {44618#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {44622#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:05:29,439 INFO L272 TraceCheckUtils]: 10: Hoare triple {44577#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {44618#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:05:29,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {44641#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [296] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {44577#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:05:29,440 INFO L290 TraceCheckUtils]: 8: Hoare triple {44645#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [299] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_3150 v_main_~x~0_3149)) (.cse2 (= v_main_~y~0_2518 v_main_~y~0_2517)) (.cse0 (<= 500000 v_main_~x~0_3150))) (or (and (or (not (< v_main_~x~0_3150 1000000)) (not .cse0)) .cse1 .cse2) (and .cse1 .cse2) (let ((.cse3 (+ v_main_~x~0_3150 v_main_~y~0_2517))) (and (< .cse3 (+ 1000001 v_main_~y~0_2518)) (= (+ v_main_~x~0_3149 v_main_~y~0_2518) .cse3) (< v_main_~y~0_2518 v_main_~y~0_2517) .cse0)))) InVars {main_~x~0=v_main_~x~0_3150, main_~y~0=v_main_~y~0_2518} OutVars{main_~x~0=v_main_~x~0_3149, main_~y~0=v_main_~y~0_2517} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {44641#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:05:29,440 INFO L290 TraceCheckUtils]: 7: Hoare triple {44645#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [298] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44645#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:05:29,441 INFO L290 TraceCheckUtils]: 6: Hoare triple {44652#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [297] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3148 v_main_~x~0_3147))) (or (and (<= 500000 v_main_~x~0_3148) .cse0) (and (< v_main_~x~0_3148 v_main_~x~0_3147) (< v_main_~x~0_3147 500001)) .cse0)) InVars {main_~x~0=v_main_~x~0_3148} OutVars{main_~x~0=v_main_~x~0_3147} AuxVars[] AssignedVars[main_~x~0] {44645#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:05:29,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {44569#true} ~x~0 := 0;~y~0 := 500000; {44652#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:05:29,442 INFO L272 TraceCheckUtils]: 4: Hoare triple {44569#true} call #t~ret4 := main(); {44569#true} is VALID [2022-04-28 04:05:29,442 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44569#true} {44569#true} #41#return; {44569#true} is VALID [2022-04-28 04:05:29,442 INFO L290 TraceCheckUtils]: 2: Hoare triple {44569#true} assume true; {44569#true} is VALID [2022-04-28 04:05:29,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {44569#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(17, 2);call #Ultimate.allocInit(12, 3); {44569#true} is VALID [2022-04-28 04:05:29,442 INFO L272 TraceCheckUtils]: 0: Hoare triple {44569#true} call ULTIMATE.init(); {44569#true} is VALID [2022-04-28 04:05:29,442 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 04:05:29,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867621300] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:05:29,442 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:05:29,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 04:05:32,775 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:05:32,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1036799889] [2022-04-28 04:05:32,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1036799889] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:05:32,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:05:32,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [71] imperfect sequences [] total 71 [2022-04-28 04:05:32,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525685204] [2022-04-28 04:05:32,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:05:32,776 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 70 states have (on average 1.957142857142857) internal successors, (137), 69 states have internal predecessors, (137), 2 states have call successors, (3), 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 141 [2022-04-28 04:05:32,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:05:32,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 71 states, 70 states have (on average 1.957142857142857) internal successors, (137), 69 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:05:32,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:05:32,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-04-28 04:05:32,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:05:32,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-04-28 04:05:32,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=6204, Unknown=0, NotChecked=0, Total=6806 [2022-04-28 04:05:32,874 INFO L87 Difference]: Start difference. First operand 143 states and 146 transitions. Second operand has 71 states, 70 states have (on average 1.957142857142857) internal successors, (137), 69 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:05:47,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:05:47,440 INFO L93 Difference]: Finished difference Result 152 states and 157 transitions. [2022-04-28 04:05:47,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-04-28 04:05:47,440 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 70 states have (on average 1.957142857142857) internal successors, (137), 69 states have internal predecessors, (137), 2 states have call successors, (3), 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 141 [2022-04-28 04:05:47,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:05:47,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.957142857142857) internal successors, (137), 69 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:05:47,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 157 transitions. [2022-04-28 04:05:47,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.957142857142857) internal successors, (137), 69 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:05:47,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 157 transitions. [2022-04-28 04:05:47,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 157 transitions. [2022-04-28 04:05:47,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:05:47,563 INFO L225 Difference]: With dead ends: 152 [2022-04-28 04:05:47,564 INFO L226 Difference]: Without dead ends: 145 [2022-04-28 04:05:47,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 85 SyntacticMatches, 3 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4000 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1326, Invalid=20726, Unknown=0, NotChecked=0, Total=22052 [2022-04-28 04:05:47,565 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 137 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 8597 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 8732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 8597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-04-28 04:05:47,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 53 Invalid, 8732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 8597 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2022-04-28 04:05:47,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-04-28 04:05:47,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2022-04-28 04:05:47,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:05:47,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand has 145 states, 140 states have (on average 1.0285714285714285) internal successors, (144), 140 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:05:47,954 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand has 145 states, 140 states have (on average 1.0285714285714285) internal successors, (144), 140 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:05:47,954 INFO L87 Difference]: Start difference. First operand 145 states. Second operand has 145 states, 140 states have (on average 1.0285714285714285) internal successors, (144), 140 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:05:47,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:05:47,955 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2022-04-28 04:05:47,955 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 148 transitions. [2022-04-28 04:05:47,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:05:47,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:05:47,955 INFO L74 IsIncluded]: Start isIncluded. First operand has 145 states, 140 states have (on average 1.0285714285714285) internal successors, (144), 140 states have internal predecessors, (144), 3 states have call successors, (3), 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 145 states. [2022-04-28 04:05:47,955 INFO L87 Difference]: Start difference. First operand has 145 states, 140 states have (on average 1.0285714285714285) internal successors, (144), 140 states have internal predecessors, (144), 3 states have call successors, (3), 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 145 states. [2022-04-28 04:05:47,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:05:47,956 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2022-04-28 04:05:47,956 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 148 transitions. [2022-04-28 04:05:47,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:05:47,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:05:47,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:05:47,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:05:47,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 140 states have (on average 1.0285714285714285) internal successors, (144), 140 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:05:47,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 148 transitions. [2022-04-28 04:05:47,958 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 148 transitions. Word has length 141 [2022-04-28 04:05:47,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:05:47,958 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 148 transitions. [2022-04-28 04:05:47,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 70 states have (on average 1.957142857142857) internal successors, (137), 69 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:05:47,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 145 states and 148 transitions. [2022-04-28 04:05:48,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:05:48,083 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 148 transitions. [2022-04-28 04:05:48,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-04-28 04:05:48,083 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:05:48,083 INFO L195 NwaCegarLoop]: trace histogram [66, 64, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:05:48,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Forceful destruction successful, exit code 0 [2022-04-28 04:05:48,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2022-04-28 04:05:48,284 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:05:48,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:05:48,284 INFO L85 PathProgramCache]: Analyzing trace with hash -328545283, now seen corresponding path program 64 times [2022-04-28 04:05:48,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:05:48,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1206321628] [2022-04-28 04:05:52,353 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:05:52,397 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 04:05:52,584 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 04:05:52,585 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:05:52,589 INFO L85 PathProgramCache]: Analyzing trace with hash 875178671, now seen corresponding path program 1 times [2022-04-28 04:05:52,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:05:52,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594949613] [2022-04-28 04:05:52,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:05:52,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:05:52,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:05:52,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:05:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:05:52,698 INFO L290 TraceCheckUtils]: 0: Hoare triple {45765#(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(17, 2);call #Ultimate.allocInit(12, 3); {45754#true} is VALID [2022-04-28 04:05:52,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {45754#true} assume true; {45754#true} is VALID [2022-04-28 04:05:52,699 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45754#true} {45754#true} #41#return; {45754#true} is VALID [2022-04-28 04:05:52,699 INFO L272 TraceCheckUtils]: 0: Hoare triple {45754#true} call ULTIMATE.init(); {45765#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:05:52,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {45765#(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(17, 2);call #Ultimate.allocInit(12, 3); {45754#true} is VALID [2022-04-28 04:05:52,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {45754#true} assume true; {45754#true} is VALID [2022-04-28 04:05:52,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45754#true} {45754#true} #41#return; {45754#true} is VALID [2022-04-28 04:05:52,699 INFO L272 TraceCheckUtils]: 4: Hoare triple {45754#true} call #t~ret4 := main(); {45754#true} is VALID [2022-04-28 04:05:52,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {45754#true} ~x~0 := 0;~y~0 := 500000; {45759#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 04:05:52,701 INFO L290 TraceCheckUtils]: 6: Hoare triple {45759#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [301] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3230 v_main_~x~0_3229))) (or (and (<= 500000 v_main_~x~0_3230) .cse0) (and (< v_main_~x~0_3230 v_main_~x~0_3229) (< v_main_~x~0_3229 500001)) .cse0)) InVars {main_~x~0=v_main_~x~0_3230} OutVars{main_~x~0=v_main_~x~0_3229} AuxVars[] AssignedVars[main_~x~0] {45760#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 04:05:52,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {45760#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [302] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45760#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 04:05:52,702 INFO L290 TraceCheckUtils]: 8: Hoare triple {45760#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [303] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3232 v_main_~x~0_3231)) (.cse1 (= v_main_~y~0_2590 v_main_~y~0_2589)) (.cse2 (<= 500000 v_main_~x~0_3232))) (or (and .cse0 .cse1) (and .cse0 (or (not .cse2) (not (< v_main_~x~0_3232 1000000))) .cse1) (and (< v_main_~x~0_3232 v_main_~x~0_3231) (< v_main_~x~0_3231 1000001) (= (+ v_main_~x~0_3232 v_main_~y~0_2589) (+ v_main_~x~0_3231 v_main_~y~0_2590)) .cse2))) InVars {main_~x~0=v_main_~x~0_3232, main_~y~0=v_main_~y~0_2590} OutVars{main_~x~0=v_main_~x~0_3231, main_~y~0=v_main_~y~0_2589} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {45761#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:05:52,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {45761#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [300] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {45762#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:05:52,703 INFO L272 TraceCheckUtils]: 10: Hoare triple {45762#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {45763#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:05:52,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {45763#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {45764#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:05:52,704 INFO L290 TraceCheckUtils]: 12: Hoare triple {45764#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {45755#false} is VALID [2022-04-28 04:05:52,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {45755#false} assume !false; {45755#false} is VALID [2022-04-28 04:05:52,704 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 04:05:52,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:05:52,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594949613] [2022-04-28 04:05:52,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594949613] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:05:52,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121526519] [2022-04-28 04:05:52,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:05:52,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:05:52,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:05:52,706 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:05:52,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-04-28 04:05:52,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:05:52,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 04:05:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:05:52,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:05:53,053 INFO L272 TraceCheckUtils]: 0: Hoare triple {45754#true} call ULTIMATE.init(); {45754#true} is VALID [2022-04-28 04:05:53,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {45754#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(17, 2);call #Ultimate.allocInit(12, 3); {45754#true} is VALID [2022-04-28 04:05:53,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {45754#true} assume true; {45754#true} is VALID [2022-04-28 04:05:53,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45754#true} {45754#true} #41#return; {45754#true} is VALID [2022-04-28 04:05:53,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {45754#true} call #t~ret4 := main(); {45754#true} is VALID [2022-04-28 04:05:53,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {45754#true} ~x~0 := 0;~y~0 := 500000; {45784#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 04:05:53,054 INFO L290 TraceCheckUtils]: 6: Hoare triple {45784#(and (<= main_~x~0 0) (= main_~y~0 500000))} [301] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3230 v_main_~x~0_3229))) (or (and (<= 500000 v_main_~x~0_3230) .cse0) (and (< v_main_~x~0_3230 v_main_~x~0_3229) (< v_main_~x~0_3229 500001)) .cse0)) InVars {main_~x~0=v_main_~x~0_3230} OutVars{main_~x~0=v_main_~x~0_3229} AuxVars[] AssignedVars[main_~x~0] {45788#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 04:05:53,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {45788#(and (= main_~y~0 500000) (< main_~x~0 500001))} [302] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45788#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 04:05:53,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {45788#(and (= main_~y~0 500000) (< main_~x~0 500001))} [303] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3232 v_main_~x~0_3231)) (.cse1 (= v_main_~y~0_2590 v_main_~y~0_2589)) (.cse2 (<= 500000 v_main_~x~0_3232))) (or (and .cse0 .cse1) (and .cse0 (or (not .cse2) (not (< v_main_~x~0_3232 1000000))) .cse1) (and (< v_main_~x~0_3232 v_main_~x~0_3231) (< v_main_~x~0_3231 1000001) (= (+ v_main_~x~0_3232 v_main_~y~0_2589) (+ v_main_~x~0_3231 v_main_~y~0_2590)) .cse2))) InVars {main_~x~0=v_main_~x~0_3232, main_~y~0=v_main_~y~0_2590} OutVars{main_~x~0=v_main_~x~0_3231, main_~y~0=v_main_~y~0_2589} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {45795#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:05:53,056 INFO L290 TraceCheckUtils]: 9: Hoare triple {45795#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [300] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {45799#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:05:53,056 INFO L272 TraceCheckUtils]: 10: Hoare triple {45799#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {45803#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:05:53,057 INFO L290 TraceCheckUtils]: 11: Hoare triple {45803#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {45807#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:05:53,057 INFO L290 TraceCheckUtils]: 12: Hoare triple {45807#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {45755#false} is VALID [2022-04-28 04:05:53,057 INFO L290 TraceCheckUtils]: 13: Hoare triple {45755#false} assume !false; {45755#false} is VALID [2022-04-28 04:05:53,057 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 04:05:53,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:05:53,397 INFO L290 TraceCheckUtils]: 13: Hoare triple {45755#false} assume !false; {45755#false} is VALID [2022-04-28 04:05:53,397 INFO L290 TraceCheckUtils]: 12: Hoare triple {45807#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {45755#false} is VALID [2022-04-28 04:05:53,397 INFO L290 TraceCheckUtils]: 11: Hoare triple {45803#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {45807#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:05:53,398 INFO L272 TraceCheckUtils]: 10: Hoare triple {45762#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {45803#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:05:53,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {45826#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [300] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {45762#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:05:53,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {45830#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [303] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3232 v_main_~x~0_3231)) (.cse1 (= v_main_~y~0_2590 v_main_~y~0_2589)) (.cse2 (<= 500000 v_main_~x~0_3232))) (or (and .cse0 .cse1) (and .cse0 (or (not .cse2) (not (< v_main_~x~0_3232 1000000))) .cse1) (and (< v_main_~x~0_3232 v_main_~x~0_3231) (< v_main_~x~0_3231 1000001) (= (+ v_main_~x~0_3232 v_main_~y~0_2589) (+ v_main_~x~0_3231 v_main_~y~0_2590)) .cse2))) InVars {main_~x~0=v_main_~x~0_3232, main_~y~0=v_main_~y~0_2590} OutVars{main_~x~0=v_main_~x~0_3231, main_~y~0=v_main_~y~0_2589} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {45826#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:05:53,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {45830#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [302] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45830#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:05:53,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {45837#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [301] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3230 v_main_~x~0_3229))) (or (and (<= 500000 v_main_~x~0_3230) .cse0) (and (< v_main_~x~0_3230 v_main_~x~0_3229) (< v_main_~x~0_3229 500001)) .cse0)) InVars {main_~x~0=v_main_~x~0_3230} OutVars{main_~x~0=v_main_~x~0_3229} AuxVars[] AssignedVars[main_~x~0] {45830#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:05:53,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {45754#true} ~x~0 := 0;~y~0 := 500000; {45837#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 04:05:53,401 INFO L272 TraceCheckUtils]: 4: Hoare triple {45754#true} call #t~ret4 := main(); {45754#true} is VALID [2022-04-28 04:05:53,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45754#true} {45754#true} #41#return; {45754#true} is VALID [2022-04-28 04:05:53,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {45754#true} assume true; {45754#true} is VALID [2022-04-28 04:05:53,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {45754#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(17, 2);call #Ultimate.allocInit(12, 3); {45754#true} is VALID [2022-04-28 04:05:53,401 INFO L272 TraceCheckUtils]: 0: Hoare triple {45754#true} call ULTIMATE.init(); {45754#true} is VALID [2022-04-28 04:05:53,401 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 04:05:53,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121526519] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:05:53,402 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:05:53,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 04:05:56,860 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:05:56,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1206321628] [2022-04-28 04:05:56,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1206321628] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:05:56,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:05:56,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [72] imperfect sequences [] total 72 [2022-04-28 04:05:56,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867529285] [2022-04-28 04:05:56,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:05:56,866 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 71 states have (on average 1.9577464788732395) internal successors, (139), 70 states have internal predecessors, (139), 2 states have call successors, (3), 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 143 [2022-04-28 04:05:56,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:05:56,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 72 states, 71 states have (on average 1.9577464788732395) internal successors, (139), 70 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:05:56,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:05:56,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-04-28 04:05:56,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:05:56,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-04-28 04:05:56,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=610, Invalid=6362, Unknown=0, NotChecked=0, Total=6972 [2022-04-28 04:05:56,967 INFO L87 Difference]: Start difference. First operand 145 states and 148 transitions. Second operand has 72 states, 71 states have (on average 1.9577464788732395) internal successors, (139), 70 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:06:12,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:06:12,702 INFO L93 Difference]: Finished difference Result 154 states and 159 transitions. [2022-04-28 04:06:12,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-04-28 04:06:12,702 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 71 states have (on average 1.9577464788732395) internal successors, (139), 70 states have internal predecessors, (139), 2 states have call successors, (3), 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 143 [2022-04-28 04:06:12,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:06:12,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.9577464788732395) internal successors, (139), 70 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:06:12,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 159 transitions. [2022-04-28 04:06:12,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.9577464788732395) internal successors, (139), 70 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:06:12,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 159 transitions. [2022-04-28 04:06:12,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 159 transitions. [2022-04-28 04:06:12,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:06:12,828 INFO L225 Difference]: With dead ends: 154 [2022-04-28 04:06:12,828 INFO L226 Difference]: Without dead ends: 147 [2022-04-28 04:06:12,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4093 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1345, Invalid=21305, Unknown=0, NotChecked=0, Total=22650 [2022-04-28 04:06:12,829 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 139 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 9132 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 9269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 9132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-04-28 04:06:12,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 233 Invalid, 9269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 9132 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2022-04-28 04:06:12,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-04-28 04:06:13,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2022-04-28 04:06:13,255 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:06:13,255 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand has 147 states, 142 states have (on average 1.028169014084507) internal successors, (146), 142 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:06:13,255 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand has 147 states, 142 states have (on average 1.028169014084507) internal successors, (146), 142 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:06:13,256 INFO L87 Difference]: Start difference. First operand 147 states. Second operand has 147 states, 142 states have (on average 1.028169014084507) internal successors, (146), 142 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:06:13,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:06:13,257 INFO L93 Difference]: Finished difference Result 147 states and 150 transitions. [2022-04-28 04:06:13,257 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 150 transitions. [2022-04-28 04:06:13,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:06:13,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:06:13,257 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 142 states have (on average 1.028169014084507) internal successors, (146), 142 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 147 states. [2022-04-28 04:06:13,257 INFO L87 Difference]: Start difference. First operand has 147 states, 142 states have (on average 1.028169014084507) internal successors, (146), 142 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 147 states. [2022-04-28 04:06:13,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:06:13,258 INFO L93 Difference]: Finished difference Result 147 states and 150 transitions. [2022-04-28 04:06:13,258 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 150 transitions. [2022-04-28 04:06:13,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:06:13,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:06:13,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:06:13,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:06:13,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 142 states have (on average 1.028169014084507) internal successors, (146), 142 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:06:13,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 150 transitions. [2022-04-28 04:06:13,260 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 150 transitions. Word has length 143 [2022-04-28 04:06:13,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:06:13,260 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 150 transitions. [2022-04-28 04:06:13,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 71 states have (on average 1.9577464788732395) internal successors, (139), 70 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:06:13,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 147 states and 150 transitions. [2022-04-28 04:06:13,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:06:13,383 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 150 transitions. [2022-04-28 04:06:13,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-28 04:06:13,384 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:06:13,384 INFO L195 NwaCegarLoop]: trace histogram [67, 65, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:06:13,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2022-04-28 04:06:13,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:06:13,584 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:06:13,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:06:13,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1962971496, now seen corresponding path program 65 times [2022-04-28 04:06:13,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:06:13,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [619277592] [2022-04-28 04:06:13,660 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 04:06:13,829 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 04:06:13,830 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:06:13,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1370256465, now seen corresponding path program 1 times [2022-04-28 04:06:13,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:06:13,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162621347] [2022-04-28 04:06:13,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:06:13,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:06:13,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:13,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:06:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:13,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {46965#(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(17, 2);call #Ultimate.allocInit(12, 3); {46954#true} is VALID [2022-04-28 04:06:13,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {46954#true} assume true; {46954#true} is VALID [2022-04-28 04:06:13,911 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46954#true} {46954#true} #41#return; {46954#true} is VALID [2022-04-28 04:06:13,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {46954#true} call ULTIMATE.init(); {46965#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:06:13,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {46965#(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(17, 2);call #Ultimate.allocInit(12, 3); {46954#true} is VALID [2022-04-28 04:06:13,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {46954#true} assume true; {46954#true} is VALID [2022-04-28 04:06:13,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46954#true} {46954#true} #41#return; {46954#true} is VALID [2022-04-28 04:06:13,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {46954#true} call #t~ret4 := main(); {46954#true} is VALID [2022-04-28 04:06:13,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {46954#true} ~x~0 := 0;~y~0 := 500000; {46959#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-28 04:06:13,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {46959#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [305] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3313 v_main_~x~0_3312))) (or .cse0 (and .cse0 (not (< v_main_~x~0_3313 500000))) (and (< v_main_~x~0_3313 v_main_~x~0_3312) (< v_main_~x~0_3312 500001)))) InVars {main_~x~0=v_main_~x~0_3313} OutVars{main_~x~0=v_main_~x~0_3312} AuxVars[] AssignedVars[main_~x~0] {46960#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 04:06:13,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {46960#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [306] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {46960#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-28 04:06:13,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {46960#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [307] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_3315 v_main_~x~0_3314)) (.cse2 (= v_main_~y~0_2663 v_main_~y~0_2662)) (.cse0 (<= 500000 v_main_~x~0_3315))) (or (and (< v_main_~x~0_3315 v_main_~x~0_3314) .cse0 (< v_main_~x~0_3314 1000001) (= (+ v_main_~x~0_3314 v_main_~y~0_2663) (+ v_main_~x~0_3315 v_main_~y~0_2662))) (and .cse1 .cse2) (and .cse1 .cse2 (or (not .cse0) (not (< v_main_~x~0_3315 1000000)))))) InVars {main_~x~0=v_main_~x~0_3315, main_~y~0=v_main_~y~0_2663} OutVars{main_~x~0=v_main_~x~0_3314, main_~y~0=v_main_~y~0_2662} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {46961#(or (<= main_~x~0 999999) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 04:06:13,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {46961#(or (<= main_~x~0 999999) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [304] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {46962#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-28 04:06:13,914 INFO L272 TraceCheckUtils]: 10: Hoare triple {46962#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {46963#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:06:13,914 INFO L290 TraceCheckUtils]: 11: Hoare triple {46963#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {46964#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:06:13,915 INFO L290 TraceCheckUtils]: 12: Hoare triple {46964#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {46955#false} is VALID [2022-04-28 04:06:13,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {46955#false} assume !false; {46955#false} is VALID [2022-04-28 04:06:13,915 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 04:06:13,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:06:13,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162621347] [2022-04-28 04:06:13,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162621347] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:06:13,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718740513] [2022-04-28 04:06:13,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:06:13,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:06:13,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:06:13,916 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:06:13,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-04-28 04:06:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:13,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 04:06:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:13,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:06:14,271 INFO L272 TraceCheckUtils]: 0: Hoare triple {46954#true} call ULTIMATE.init(); {46954#true} is VALID [2022-04-28 04:06:14,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {46954#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(17, 2);call #Ultimate.allocInit(12, 3); {46954#true} is VALID [2022-04-28 04:06:14,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {46954#true} assume true; {46954#true} is VALID [2022-04-28 04:06:14,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46954#true} {46954#true} #41#return; {46954#true} is VALID [2022-04-28 04:06:14,272 INFO L272 TraceCheckUtils]: 4: Hoare triple {46954#true} call #t~ret4 := main(); {46954#true} is VALID [2022-04-28 04:06:14,273 INFO L290 TraceCheckUtils]: 5: Hoare triple {46954#true} ~x~0 := 0;~y~0 := 500000; {46984#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-28 04:06:14,273 INFO L290 TraceCheckUtils]: 6: Hoare triple {46984#(and (<= main_~x~0 0) (= main_~y~0 500000))} [305] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3313 v_main_~x~0_3312))) (or .cse0 (and .cse0 (not (< v_main_~x~0_3313 500000))) (and (< v_main_~x~0_3313 v_main_~x~0_3312) (< v_main_~x~0_3312 500001)))) InVars {main_~x~0=v_main_~x~0_3313} OutVars{main_~x~0=v_main_~x~0_3312} AuxVars[] AssignedVars[main_~x~0] {46988#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 04:06:14,274 INFO L290 TraceCheckUtils]: 7: Hoare triple {46988#(and (= main_~y~0 500000) (< main_~x~0 500001))} [306] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {46988#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-28 04:06:14,274 INFO L290 TraceCheckUtils]: 8: Hoare triple {46988#(and (= main_~y~0 500000) (< main_~x~0 500001))} [307] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_3315 v_main_~x~0_3314)) (.cse2 (= v_main_~y~0_2663 v_main_~y~0_2662)) (.cse0 (<= 500000 v_main_~x~0_3315))) (or (and (< v_main_~x~0_3315 v_main_~x~0_3314) .cse0 (< v_main_~x~0_3314 1000001) (= (+ v_main_~x~0_3314 v_main_~y~0_2663) (+ v_main_~x~0_3315 v_main_~y~0_2662))) (and .cse1 .cse2) (and .cse1 .cse2 (or (not .cse0) (not (< v_main_~x~0_3315 1000000)))))) InVars {main_~x~0=v_main_~x~0_3315, main_~y~0=v_main_~y~0_2663} OutVars{main_~x~0=v_main_~x~0_3314, main_~y~0=v_main_~y~0_2662} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {46995#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-28 04:06:14,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {46995#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [304] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {46999#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 04:06:14,275 INFO L272 TraceCheckUtils]: 10: Hoare triple {46999#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {47003#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:06:14,276 INFO L290 TraceCheckUtils]: 11: Hoare triple {47003#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {47007#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:06:14,276 INFO L290 TraceCheckUtils]: 12: Hoare triple {47007#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {46955#false} is VALID [2022-04-28 04:06:14,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {46955#false} assume !false; {46955#false} is VALID [2022-04-28 04:06:14,276 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 04:06:14,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:06:14,585 INFO L290 TraceCheckUtils]: 13: Hoare triple {46955#false} assume !false; {46955#false} is VALID [2022-04-28 04:06:14,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {47007#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {46955#false} is VALID [2022-04-28 04:06:14,585 INFO L290 TraceCheckUtils]: 11: Hoare triple {47003#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {47007#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:06:14,586 INFO L272 TraceCheckUtils]: 10: Hoare triple {46962#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {47003#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:06:14,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {46961#(or (<= main_~x~0 999999) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [304] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {46962#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-28 04:06:14,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {47029#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [307] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_3315 v_main_~x~0_3314)) (.cse2 (= v_main_~y~0_2663 v_main_~y~0_2662)) (.cse0 (<= 500000 v_main_~x~0_3315))) (or (and (< v_main_~x~0_3315 v_main_~x~0_3314) .cse0 (< v_main_~x~0_3314 1000001) (= (+ v_main_~x~0_3314 v_main_~y~0_2663) (+ v_main_~x~0_3315 v_main_~y~0_2662))) (and .cse1 .cse2) (and .cse1 .cse2 (or (not .cse0) (not (< v_main_~x~0_3315 1000000)))))) InVars {main_~x~0=v_main_~x~0_3315, main_~y~0=v_main_~y~0_2663} OutVars{main_~x~0=v_main_~x~0_3314, main_~y~0=v_main_~y~0_2662} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {46961#(or (<= main_~x~0 999999) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 04:06:14,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {47029#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [306] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {47029#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 04:06:14,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {47036#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} [305] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3313 v_main_~x~0_3312))) (or .cse0 (and .cse0 (not (< v_main_~x~0_3313 500000))) (and (< v_main_~x~0_3313 v_main_~x~0_3312) (< v_main_~x~0_3312 500001)))) InVars {main_~x~0=v_main_~x~0_3313} OutVars{main_~x~0=v_main_~x~0_3312} AuxVars[] AssignedVars[main_~x~0] {47029#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 04:06:14,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {46954#true} ~x~0 := 0;~y~0 := 500000; {47036#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-28 04:06:14,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {46954#true} call #t~ret4 := main(); {46954#true} is VALID [2022-04-28 04:06:14,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46954#true} {46954#true} #41#return; {46954#true} is VALID [2022-04-28 04:06:14,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {46954#true} assume true; {46954#true} is VALID [2022-04-28 04:06:14,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {46954#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(17, 2);call #Ultimate.allocInit(12, 3); {46954#true} is VALID [2022-04-28 04:06:14,589 INFO L272 TraceCheckUtils]: 0: Hoare triple {46954#true} call ULTIMATE.init(); {46954#true} is VALID [2022-04-28 04:06:14,589 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 04:06:14,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718740513] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:06:14,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:06:14,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 04:06:18,041 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:06:18,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [619277592] [2022-04-28 04:06:18,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [619277592] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:06:18,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:06:18,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [73] imperfect sequences [] total 73 [2022-04-28 04:06:18,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413522136] [2022-04-28 04:06:18,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:06:18,042 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 72 states have (on average 1.9583333333333333) internal successors, (141), 71 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 145 [2022-04-28 04:06:18,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:06:18,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 73 states, 72 states have (on average 1.9583333333333333) internal successors, (141), 71 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:06:18,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:06:18,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-04-28 04:06:18,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:06:18,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-04-28 04:06:18,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=539, Invalid=6433, Unknown=0, NotChecked=0, Total=6972 [2022-04-28 04:06:18,141 INFO L87 Difference]: Start difference. First operand 147 states and 150 transitions. Second operand has 73 states, 72 states have (on average 1.9583333333333333) internal successors, (141), 71 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)