/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_8.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 06:52:57,936 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 06:52:57,938 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 06:52:57,984 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 06:52:57,984 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 06:52:57,985 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 06:52:57,986 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 06:52:57,987 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 06:52:57,988 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 06:52:57,988 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 06:52:57,989 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 06:52:57,989 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 06:52:57,990 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 06:52:57,990 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 06:52:57,991 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 06:52:57,991 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 06:52:57,992 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 06:52:57,992 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 06:52:57,993 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 06:52:57,995 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 06:52:57,998 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 06:52:58,002 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 06:52:58,004 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 06:52:58,005 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 06:52:58,009 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 06:52:58,017 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 06:52:58,018 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 06:52:58,018 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 06:52:58,018 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 06:52:58,018 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 06:52:58,019 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 06:52:58,019 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 06:52:58,019 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 06:52:58,020 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 06:52:58,020 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 06:52:58,021 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 06:52:58,021 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 06:52:58,021 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 06:52:58,021 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 06:52:58,022 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 06:52:58,022 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 06:52:58,025 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 06:52:58,026 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 06:52:58,034 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 06:52:58,034 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 06:52:58,035 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 06:52:58,035 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 06:52:58,035 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 06:52:58,035 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 06:52:58,036 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 06:52:58,036 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 06:52:58,036 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 06:52:58,036 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 06:52:58,036 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 06:52:58,036 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 06:52:58,037 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 06:52:58,037 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 06:52:58,037 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 06:52:58,037 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 06:52:58,037 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 06:52:58,037 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 06:52:58,037 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:52:58,037 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 06:52:58,037 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 06:52:58,037 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 06:52:58,037 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 06:52:58,038 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 06:52:58,038 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 06:52:58,038 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-15 06:52:58,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 06:52:58,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 06:52:58,248 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 06:52:58,249 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 06:52:58,250 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 06:52:58,251 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_8.c [2022-04-15 06:52:58,299 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f8ef3634/ab5c04307acf49019f7aa61184b63b1c/FLAGbe8c30055 [2022-04-15 06:52:58,670 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 06:52:58,670 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_8.c [2022-04-15 06:52:58,676 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f8ef3634/ab5c04307acf49019f7aa61184b63b1c/FLAGbe8c30055 [2022-04-15 06:52:59,078 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f8ef3634/ab5c04307acf49019f7aa61184b63b1c [2022-04-15 06:52:59,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 06:52:59,082 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 06:52:59,083 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 06:52:59,083 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 06:52:59,086 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 06:52:59,086 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:52:59" (1/1) ... [2022-04-15 06:52:59,087 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61f5a675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:52:59, skipping insertion in model container [2022-04-15 06:52:59,087 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:52:59" (1/1) ... [2022-04-15 06:52:59,092 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 06:52:59,098 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 06:52:59,200 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_8.c[318,331] [2022-04-15 06:52:59,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:52:59,240 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 06:52:59,247 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_8.c[318,331] [2022-04-15 06:52:59,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:52:59,260 INFO L208 MainTranslator]: Completed translation [2022-04-15 06:52:59,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:52:59 WrapperNode [2022-04-15 06:52:59,261 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 06:52:59,262 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 06:52:59,262 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 06:52:59,262 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 06:52:59,268 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:52:59" (1/1) ... [2022-04-15 06:52:59,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:52:59" (1/1) ... [2022-04-15 06:52:59,272 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:52:59" (1/1) ... [2022-04-15 06:52:59,272 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:52:59" (1/1) ... [2022-04-15 06:52:59,275 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:52:59" (1/1) ... [2022-04-15 06:52:59,277 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:52:59" (1/1) ... [2022-04-15 06:52:59,278 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:52:59" (1/1) ... [2022-04-15 06:52:59,279 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 06:52:59,279 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 06:52:59,280 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 06:52:59,280 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 06:52:59,283 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:52:59" (1/1) ... [2022-04-15 06:52:59,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:52:59,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:52:59,307 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-15 06:52:59,319 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-15 06:52:59,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 06:52:59,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 06:52:59,343 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 06:52:59,343 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 06:52:59,344 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 06:52:59,344 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 06:52:59,344 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 06:52:59,344 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 06:52:59,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 06:52:59,344 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 06:52:59,344 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 06:52:59,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 06:52:59,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 06:52:59,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 06:52:59,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 06:52:59,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 06:52:59,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 06:52:59,391 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 06:52:59,392 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 06:52:59,536 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 06:52:59,540 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 06:52:59,540 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 06:52:59,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:52:59 BoogieIcfgContainer [2022-04-15 06:52:59,542 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 06:52:59,543 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 06:52:59,543 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 06:52:59,562 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 06:52:59,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:52:59" (1/3) ... [2022-04-15 06:52:59,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a289b90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:52:59, skipping insertion in model container [2022-04-15 06:52:59,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:52:59" (2/3) ... [2022-04-15 06:52:59,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a289b90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:52:59, skipping insertion in model container [2022-04-15 06:52:59,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:52:59" (3/3) ... [2022-04-15 06:52:59,564 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_8.c [2022-04-15 06:52:59,568 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 06:52:59,569 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 06:52:59,604 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 06:52:59,609 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 06:52:59,609 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 06:52:59,629 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 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-15 06:52:59,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 06:52:59,634 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:52:59,634 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:52:59,634 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:52:59,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:52:59,638 INFO L85 PathProgramCache]: Analyzing trace with hash -2135496849, now seen corresponding path program 1 times [2022-04-15 06:52:59,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:52:59,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [956317321] [2022-04-15 06:52:59,667 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:52:59,667 INFO L85 PathProgramCache]: Analyzing trace with hash -2135496849, now seen corresponding path program 2 times [2022-04-15 06:52:59,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:52:59,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103596046] [2022-04-15 06:52:59,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:52:59,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:52:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:59,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:52:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:59,834 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {24#true} is VALID [2022-04-15 06:52:59,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-15 06:52:59,835 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #42#return; {24#true} is VALID [2022-04-15 06:52:59,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:52:59,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {24#true} is VALID [2022-04-15 06:52:59,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-15 06:52:59,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #42#return; {24#true} is VALID [2022-04-15 06:52:59,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret6 := main(); {24#true} is VALID [2022-04-15 06:52:59,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {24#true} is VALID [2022-04-15 06:52:59,838 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !true; {25#false} is VALID [2022-04-15 06:52:59,838 INFO L272 TraceCheckUtils]: 7: Hoare triple {25#false} call __VERIFIER_assert((if 0 == ~z~0 % 4294967296 then 1 else 0)); {25#false} is VALID [2022-04-15 06:52:59,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-15 06:52:59,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-15 06:52:59,839 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-15 06:52:59,839 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-15 06:52:59,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:52:59,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103596046] [2022-04-15 06:52:59,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103596046] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:52:59,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:52:59,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:52:59,856 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:52:59,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [956317321] [2022-04-15 06:52:59,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [956317321] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:52:59,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:52:59,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:52:59,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676229422] [2022-04-15 06:52:59,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:52:59,861 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-15 06:52:59,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:52:59,864 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-15 06:52:59,884 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-15 06:52:59,884 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 06:52:59,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:52:59,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 06:52:59,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 06:52:59,907 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 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-15 06:52:59,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:52:59,986 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-15 06:52:59,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 06:52:59,987 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-15 06:52:59,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:52:59,987 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-15 06:52:59,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-15 06:52:59,992 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-15 06:52:59,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-15 06:52:59,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 37 transitions. [2022-04-15 06:53:00,071 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-15 06:53:00,076 INFO L225 Difference]: With dead ends: 33 [2022-04-15 06:53:00,076 INFO L226 Difference]: Without dead ends: 14 [2022-04-15 06:53:00,083 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 06:53:00,085 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:53:00,086 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:53:00,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-15 06:53:00,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-15 06:53:00,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:53:00,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:00,113 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:00,114 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:00,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:00,120 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-15 06:53:00,120 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 06:53:00,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:53:00,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:53:00,121 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 06:53:00,122 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 06:53:00,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:00,125 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-15 06:53:00,125 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 06:53:00,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:53:00,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:53:00,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:53:00,126 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:53:00,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:00,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-15 06:53:00,129 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-15 06:53:00,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:53:00,129 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-15 06:53:00,129 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:00,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 15 transitions. [2022-04-15 06:53:00,151 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-15 06:53:00,152 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 06:53:00,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 06:53:00,155 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:53:00,155 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:53:00,158 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 06:53:00,158 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:53:00,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:53:00,158 INFO L85 PathProgramCache]: Analyzing trace with hash -2145655580, now seen corresponding path program 1 times [2022-04-15 06:53:00,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:53:00,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1275072024] [2022-04-15 06:53:00,159 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:53:00,159 INFO L85 PathProgramCache]: Analyzing trace with hash -2145655580, now seen corresponding path program 2 times [2022-04-15 06:53:00,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:53:00,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215713829] [2022-04-15 06:53:00,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:53:00,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:53:00,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:00,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:53:00,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:00,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {160#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {154#true} is VALID [2022-04-15 06:53:00,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {154#true} assume true; {154#true} is VALID [2022-04-15 06:53:00,276 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {154#true} {154#true} #42#return; {154#true} is VALID [2022-04-15 06:53:00,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {154#true} call ULTIMATE.init(); {160#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:53:00,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {160#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {154#true} is VALID [2022-04-15 06:53:00,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {154#true} assume true; {154#true} is VALID [2022-04-15 06:53:00,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {154#true} {154#true} #42#return; {154#true} is VALID [2022-04-15 06:53:00,278 INFO L272 TraceCheckUtils]: 4: Hoare triple {154#true} call #t~ret6 := main(); {154#true} is VALID [2022-04-15 06:53:00,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {154#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {159#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 06:53:00,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {159#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {155#false} is VALID [2022-04-15 06:53:00,281 INFO L272 TraceCheckUtils]: 7: Hoare triple {155#false} call __VERIFIER_assert((if 0 == ~z~0 % 4294967296 then 1 else 0)); {155#false} is VALID [2022-04-15 06:53:00,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {155#false} ~cond := #in~cond; {155#false} is VALID [2022-04-15 06:53:00,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {155#false} assume 0 == ~cond; {155#false} is VALID [2022-04-15 06:53:00,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {155#false} assume !false; {155#false} is VALID [2022-04-15 06:53:00,281 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-15 06:53:00,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:53:00,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215713829] [2022-04-15 06:53:00,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215713829] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:53:00,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:53:00,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:53:00,282 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:53:00,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1275072024] [2022-04-15 06:53:00,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1275072024] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:53:00,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:53:00,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:53:00,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305497128] [2022-04-15 06:53:00,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:53:00,283 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-15 06:53:00,284 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:53:00,284 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-15 06:53:00,298 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-15 06:53:00,298 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 06:53:00,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:53:00,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 06:53:00,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 06:53:00,299 INFO L87 Difference]: Start difference. First operand 14 states and 15 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-15 06:53:00,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:00,381 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-15 06:53:00,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 06:53:00,381 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-15 06:53:00,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:53:00,381 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-15 06:53:00,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-04-15 06:53:00,383 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-15 06:53:00,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-04-15 06:53:00,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 29 transitions. [2022-04-15 06:53:00,420 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-15 06:53:00,422 INFO L225 Difference]: With dead ends: 25 [2022-04-15 06:53:00,422 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 06:53:00,423 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 06:53:00,424 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:53:00,425 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 19 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:53:00,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 06:53:00,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-15 06:53:00,433 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:53:00,433 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:00,433 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:00,434 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:00,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:00,435 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-15 06:53:00,435 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-15 06:53:00,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:53:00,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:53:00,435 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states 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-15 06:53:00,435 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states 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-15 06:53:00,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:00,436 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-15 06:53:00,436 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-15 06:53:00,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:53:00,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:53:00,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:53:00,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:53:00,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:00,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-15 06:53:00,438 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2022-04-15 06:53:00,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:53:00,438 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-15 06:53:00,438 INFO L479 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-15 06:53:00,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 17 transitions. [2022-04-15 06:53:00,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:53:00,460 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-15 06:53:00,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 06:53:00,460 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:53:00,461 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:53:00,461 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 06:53:00,461 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:53:00,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:53:00,462 INFO L85 PathProgramCache]: Analyzing trace with hash -79339060, now seen corresponding path program 1 times [2022-04-15 06:53:00,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:53:00,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [553515973] [2022-04-15 06:53:05,166 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:53:05,509 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:53:05,511 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:53:05,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1115131409, now seen corresponding path program 1 times [2022-04-15 06:53:05,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:53:05,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901830516] [2022-04-15 06:53:05,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:53:05,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:53:05,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:05,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:53:05,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:05,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {288#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {281#true} is VALID [2022-04-15 06:53:05,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {281#true} assume true; {281#true} is VALID [2022-04-15 06:53:05,742 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {281#true} {281#true} #42#return; {281#true} is VALID [2022-04-15 06:53:05,743 INFO L272 TraceCheckUtils]: 0: Hoare triple {281#true} call ULTIMATE.init(); {288#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:53:05,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {288#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {281#true} is VALID [2022-04-15 06:53:05,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {281#true} assume true; {281#true} is VALID [2022-04-15 06:53:05,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {281#true} {281#true} #42#return; {281#true} is VALID [2022-04-15 06:53:05,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {281#true} call #t~ret6 := main(); {281#true} is VALID [2022-04-15 06:53:05,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {281#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {286#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-15 06:53:05,746 INFO L290 TraceCheckUtils]: 6: Hoare triple {286#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} [48] L11-2-->L11-3_primed: Formula: (let ((.cse6 (mod v_main_~x~0_9 4294967296))) (let ((.cse0 (= v_main_~x~0_9 v_main_~x~0_8)) (.cse1 (= |v_main_#t~post5_4| |v_main_#t~post5_3|)) (.cse5 (< .cse6 5000000)) (.cse3 (mod v_main_~y~0_4 4294967296))) (or (and .cse0 .cse1 (= v_main_~y~0_4 v_main_~y~0_4)) (let ((.cse2 (* (- 1) v_main_~x~0_8)) (.cse4 (+ (div (+ v_main_~x~0_9 (- 4294967295)) 4294967296) 1))) (and (< v_main_~x~0_9 v_main_~x~0_8) (<= (div (+ .cse2 .cse3) (- 4294967296)) .cse4) .cse5 (<= (div (+ 5000000 .cse2) (- 4294967296)) .cse4))) (and .cse0 .cse1 (or (not .cse5) (not (< .cse6 .cse3))))))) InVars {main_~y~0=v_main_~y~0_4, main_#t~post5=|v_main_#t~post5_4|, main_~x~0=v_main_~x~0_9} OutVars{main_#t~post5=|v_main_#t~post5_3|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {287#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ 5000000 main_~x~0) main_~y~0))} is VALID [2022-04-15 06:53:05,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {287#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ 5000000 main_~x~0) main_~y~0))} [47] L11-3_primed-->L11-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {282#false} is VALID [2022-04-15 06:53:05,747 INFO L272 TraceCheckUtils]: 8: Hoare triple {282#false} call __VERIFIER_assert((if 0 == ~z~0 % 4294967296 then 1 else 0)); {282#false} is VALID [2022-04-15 06:53:05,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {282#false} ~cond := #in~cond; {282#false} is VALID [2022-04-15 06:53:05,747 INFO L290 TraceCheckUtils]: 10: Hoare triple {282#false} assume 0 == ~cond; {282#false} is VALID [2022-04-15 06:53:05,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {282#false} assume !false; {282#false} is VALID [2022-04-15 06:53:05,747 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-15 06:53:05,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:53:05,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901830516] [2022-04-15 06:53:05,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901830516] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:53:05,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:53:05,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:53:05,893 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:53:05,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [553515973] [2022-04-15 06:53:05,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [553515973] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:53:05,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:53:05,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:53:05,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983959786] [2022-04-15 06:53:05,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:53:05,895 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 06:53:05,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:53:05,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:05,906 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-15 06:53:05,906 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:53:05,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:53:05,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:53:05,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-15 06:53:05,908 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:06,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:06,105 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-15 06:53:06,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 06:53:06,106 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 06:53:06,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:53:06,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:06,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-15 06:53:06,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:06,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-15 06:53:06,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 28 transitions. [2022-04-15 06:53:06,138 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-15 06:53:06,139 INFO L225 Difference]: With dead ends: 26 [2022-04-15 06:53:06,139 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 06:53:06,140 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-04-15 06:53:06,140 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 21 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:53:06,141 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 18 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:53:06,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 06:53:06,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2022-04-15 06:53:06,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:53:06,164 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:06,164 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:06,164 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:06,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:06,165 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-15 06:53:06,166 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 06:53:06,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:53:06,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:53:06,166 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-15 06:53:06,166 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-15 06:53:06,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:06,167 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-15 06:53:06,167 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 06:53:06,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:53:06,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:53:06,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:53:06,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:53:06,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:06,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-15 06:53:06,169 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 14 [2022-04-15 06:53:06,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:53:06,169 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-15 06:53:06,169 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:06,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions. [2022-04-15 06:53:06,193 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-15 06:53:06,193 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 06:53:06,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 06:53:06,194 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:53:06,194 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:53:06,194 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 06:53:06,194 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:53:06,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:53:06,195 INFO L85 PathProgramCache]: Analyzing trace with hash 309814626, now seen corresponding path program 1 times [2022-04-15 06:53:06,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:53:06,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1232339061] [2022-04-15 06:53:08,518 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:53:12,309 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:53:12,598 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:53:16,881 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:53:20,462 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:53:20,747 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:53:20,748 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:53:20,752 INFO L85 PathProgramCache]: Analyzing trace with hash 764545454, now seen corresponding path program 1 times [2022-04-15 06:53:20,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:53:20,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639950209] [2022-04-15 06:53:20,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:53:20,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:53:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:21,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:53:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:21,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {443#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {432#true} is VALID [2022-04-15 06:53:21,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {432#true} assume true; {432#true} is VALID [2022-04-15 06:53:21,098 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {432#true} {432#true} #42#return; {432#true} is VALID [2022-04-15 06:53:21,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {432#true} call ULTIMATE.init(); {443#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:53:21,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {443#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {432#true} is VALID [2022-04-15 06:53:21,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {432#true} assume true; {432#true} is VALID [2022-04-15 06:53:21,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {432#true} {432#true} #42#return; {432#true} is VALID [2022-04-15 06:53:21,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {432#true} call #t~ret6 := main(); {432#true} is VALID [2022-04-15 06:53:21,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {432#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {437#(and (= main_~x~0 0) (<= main_~y~0 (+ 5000000 main_~z~0)) (<= 10000000 main_~y~0) (<= main_~y~0 10000000) (<= (+ 5000000 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:53:21,104 INFO L290 TraceCheckUtils]: 6: Hoare triple {437#(and (= main_~x~0 0) (<= main_~y~0 (+ 5000000 main_~z~0)) (<= 10000000 main_~y~0) (<= main_~y~0 10000000) (<= (+ 5000000 main_~z~0) main_~y~0))} [50] L11-2-->L11-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_16 4294967296)) (.cse3 (mod v_main_~y~0_6 4294967296))) (let ((.cse0 (< .cse1 .cse3)) (.cse2 (= v_main_~x~0_16 v_main_~x~0_15))) (or (and (or (not .cse0) (not (< .cse1 5000000))) (= |v_main_#t~post5_8| |v_main_#t~post5_10|) .cse2) (let ((.cse4 (* (- 1) v_main_~x~0_15)) (.cse5 (+ 1 (div (+ v_main_~x~0_16 (- 4294967295)) 4294967296)))) (and .cse0 (<= (div (+ .cse3 .cse4) (- 4294967296)) .cse5) (< v_main_~x~0_16 v_main_~x~0_15) (<= (div (+ 5000000 .cse4) (- 4294967296)) .cse5))) (and (= |v_main_#t~post5_10| |v_main_#t~post5_8|) .cse2 (= v_main_~y~0_6 v_main_~y~0_6))))) InVars {main_~y~0=v_main_~y~0_6, main_#t~post5=|v_main_#t~post5_10|, main_~x~0=v_main_~x~0_16} OutVars{main_#t~post5=|v_main_#t~post5_8|, main_~y~0=v_main_~y~0_6, main_~x~0=v_main_~x~0_15} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {438#(and (or (= main_~x~0 0) (and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= (+ main_~z~0 main_~x~0) (+ main_~y~0 (* (div (+ 5000000 (* (- 1) main_~x~0)) (- 4294967296)) 4294967296))) (<= (+ main_~y~0 (* (div (+ 5000000 (* (- 1) main_~x~0)) (- 4294967296)) 4294967296)) (+ 5000000 main_~z~0)))) (or (and (<= 1 main_~x~0) (<= (+ 5000000 main_~x~0) main_~y~0) (<= (div main_~y~0 4294967296) 0)) (and (<= (+ main_~x~0 10000000) main_~y~0) (<= (div main_~y~0 4294967296) 0))))} is VALID [2022-04-15 06:53:21,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {438#(and (or (= main_~x~0 0) (and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= (+ main_~z~0 main_~x~0) (+ main_~y~0 (* (div (+ 5000000 (* (- 1) main_~x~0)) (- 4294967296)) 4294967296))) (<= (+ main_~y~0 (* (div (+ 5000000 (* (- 1) main_~x~0)) (- 4294967296)) 4294967296)) (+ 5000000 main_~z~0)))) (or (and (<= 1 main_~x~0) (<= (+ 5000000 main_~x~0) main_~y~0) (<= (div main_~y~0 4294967296) 0)) (and (<= (+ main_~x~0 10000000) main_~y~0) (<= (div main_~y~0 4294967296) 0))))} [51] L11-3_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {438#(and (or (= main_~x~0 0) (and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= (+ main_~z~0 main_~x~0) (+ main_~y~0 (* (div (+ 5000000 (* (- 1) main_~x~0)) (- 4294967296)) 4294967296))) (<= (+ main_~y~0 (* (div (+ 5000000 (* (- 1) main_~x~0)) (- 4294967296)) 4294967296)) (+ 5000000 main_~z~0)))) (or (and (<= 1 main_~x~0) (<= (+ 5000000 main_~x~0) main_~y~0) (<= (div main_~y~0 4294967296) 0)) (and (<= (+ main_~x~0 10000000) main_~y~0) (<= (div main_~y~0 4294967296) 0))))} is VALID [2022-04-15 06:53:21,113 INFO L290 TraceCheckUtils]: 8: Hoare triple {438#(and (or (= main_~x~0 0) (and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= (+ main_~z~0 main_~x~0) (+ main_~y~0 (* (div (+ 5000000 (* (- 1) main_~x~0)) (- 4294967296)) 4294967296))) (<= (+ main_~y~0 (* (div (+ 5000000 (* (- 1) main_~x~0)) (- 4294967296)) 4294967296)) (+ 5000000 main_~z~0)))) (or (and (<= 1 main_~x~0) (<= (+ 5000000 main_~x~0) main_~y~0) (<= (div main_~y~0 4294967296) 0)) (and (<= (+ main_~x~0 10000000) main_~y~0) (<= (div main_~y~0 4294967296) 0))))} [52] L11-2-->L11-3_primed: Formula: (let ((.cse6 (mod v_main_~x~0_18 4294967296)) (.cse5 (mod v_main_~y~0_7 4294967296))) (let ((.cse2 (= v_main_~z~0_7 v_main_~z~0_6)) (.cse3 (= v_main_~x~0_18 v_main_~x~0_17)) (.cse4 (= |v_main_#t~post4_4| |v_main_#t~post4_3|)) (.cse1 (< .cse6 .cse5)) (.cse0 (<= 5000000 .cse6))) (or (and (or (not .cse0) (not .cse1)) .cse2 .cse3 (= |v_main_#t~post5_9| |v_main_#t~post5_13|) .cse4) (and (= |v_main_#t~post5_13| |v_main_#t~post5_9|) (= v_main_~y~0_7 v_main_~y~0_7) .cse2 .cse3 .cse4) (and .cse1 (<= (div (+ (* (- 1) v_main_~x~0_18) v_main_~z~0_6 (* (- 1) v_main_~z~0_7) .cse5) (- 4294967296)) (+ (div (+ v_main_~x~0_18 (- 4294967295)) 4294967296) 1)) .cse0 (= (+ v_main_~x~0_17 v_main_~z~0_6) (+ v_main_~x~0_18 v_main_~z~0_7)) (< v_main_~z~0_6 v_main_~z~0_7))))) InVars {main_#t~post4=|v_main_#t~post4_4|, main_~y~0=v_main_~y~0_7, main_#t~post5=|v_main_#t~post5_13|, main_~x~0=v_main_~x~0_18, main_~z~0=v_main_~z~0_7} OutVars{main_#t~post4=|v_main_#t~post4_3|, main_#t~post5=|v_main_#t~post5_9|, main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_17, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post4, main_#t~post5] {439#(or (and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (or (<= (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0 main_~x~0) (+ main_~y~0 (* (div main_~z~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))) (and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ 5000000 main_~x~0) main_~y~0)))} is VALID [2022-04-15 06:53:21,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {439#(or (and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (or (<= (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0 main_~x~0) (+ main_~y~0 (* (div main_~z~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))) (and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ 5000000 main_~x~0) main_~y~0)))} [49] L11-3_primed-->L11-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {440#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 06:53:21,116 INFO L272 TraceCheckUtils]: 10: Hoare triple {440#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~z~0 % 4294967296 then 1 else 0)); {441#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:53:21,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {441#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {442#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:53:21,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {442#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {433#false} is VALID [2022-04-15 06:53:21,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {433#false} assume !false; {433#false} is VALID [2022-04-15 06:53:21,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:53:21,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:53:21,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639950209] [2022-04-15 06:53:21,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639950209] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:53:21,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452998478] [2022-04-15 06:53:21,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:53:21,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:53:21,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:53:21,120 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-15 06:53:21,123 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-15 06:53:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:21,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 06:53:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:21,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:53:29,104 INFO L272 TraceCheckUtils]: 0: Hoare triple {432#true} call ULTIMATE.init(); {432#true} is VALID [2022-04-15 06:53:29,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {432#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {432#true} is VALID [2022-04-15 06:53:29,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {432#true} assume true; {432#true} is VALID [2022-04-15 06:53:29,104 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {432#true} {432#true} #42#return; {432#true} is VALID [2022-04-15 06:53:29,105 INFO L272 TraceCheckUtils]: 4: Hoare triple {432#true} call #t~ret6 := main(); {432#true} is VALID [2022-04-15 06:53:29,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {432#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {437#(and (= main_~x~0 0) (<= main_~y~0 (+ 5000000 main_~z~0)) (<= 10000000 main_~y~0) (<= main_~y~0 10000000) (<= (+ 5000000 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:53:29,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {437#(and (= main_~x~0 0) (<= main_~y~0 (+ 5000000 main_~z~0)) (<= 10000000 main_~y~0) (<= main_~y~0 10000000) (<= (+ 5000000 main_~z~0) main_~y~0))} [50] L11-2-->L11-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_16 4294967296)) (.cse3 (mod v_main_~y~0_6 4294967296))) (let ((.cse0 (< .cse1 .cse3)) (.cse2 (= v_main_~x~0_16 v_main_~x~0_15))) (or (and (or (not .cse0) (not (< .cse1 5000000))) (= |v_main_#t~post5_8| |v_main_#t~post5_10|) .cse2) (let ((.cse4 (* (- 1) v_main_~x~0_15)) (.cse5 (+ 1 (div (+ v_main_~x~0_16 (- 4294967295)) 4294967296)))) (and .cse0 (<= (div (+ .cse3 .cse4) (- 4294967296)) .cse5) (< v_main_~x~0_16 v_main_~x~0_15) (<= (div (+ 5000000 .cse4) (- 4294967296)) .cse5))) (and (= |v_main_#t~post5_10| |v_main_#t~post5_8|) .cse2 (= v_main_~y~0_6 v_main_~y~0_6))))) InVars {main_~y~0=v_main_~y~0_6, main_#t~post5=|v_main_#t~post5_10|, main_~x~0=v_main_~x~0_16} OutVars{main_#t~post5=|v_main_#t~post5_8|, main_~y~0=v_main_~y~0_6, main_~x~0=v_main_~x~0_15} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {465#(and (or (= main_~x~0 0) (and (<= (div (+ 5000000 (* (- 1) main_~x~0)) (- 4294967296)) 0) (< 0 main_~x~0))) (<= main_~y~0 (+ 5000000 main_~z~0)) (<= 10000000 main_~y~0) (<= main_~y~0 10000000) (<= (+ 5000000 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:53:29,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {465#(and (or (= main_~x~0 0) (and (<= (div (+ 5000000 (* (- 1) main_~x~0)) (- 4294967296)) 0) (< 0 main_~x~0))) (<= main_~y~0 (+ 5000000 main_~z~0)) (<= 10000000 main_~y~0) (<= main_~y~0 10000000) (<= (+ 5000000 main_~z~0) main_~y~0))} [51] L11-3_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {465#(and (or (= main_~x~0 0) (and (<= (div (+ 5000000 (* (- 1) main_~x~0)) (- 4294967296)) 0) (< 0 main_~x~0))) (<= main_~y~0 (+ 5000000 main_~z~0)) (<= 10000000 main_~y~0) (<= main_~y~0 10000000) (<= (+ 5000000 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:53:31,134 WARN L290 TraceCheckUtils]: 8: Hoare triple {465#(and (or (= main_~x~0 0) (and (<= (div (+ 5000000 (* (- 1) main_~x~0)) (- 4294967296)) 0) (< 0 main_~x~0))) (<= main_~y~0 (+ 5000000 main_~z~0)) (<= 10000000 main_~y~0) (<= main_~y~0 10000000) (<= (+ 5000000 main_~z~0) main_~y~0))} [52] L11-2-->L11-3_primed: Formula: (let ((.cse6 (mod v_main_~x~0_18 4294967296)) (.cse5 (mod v_main_~y~0_7 4294967296))) (let ((.cse2 (= v_main_~z~0_7 v_main_~z~0_6)) (.cse3 (= v_main_~x~0_18 v_main_~x~0_17)) (.cse4 (= |v_main_#t~post4_4| |v_main_#t~post4_3|)) (.cse1 (< .cse6 .cse5)) (.cse0 (<= 5000000 .cse6))) (or (and (or (not .cse0) (not .cse1)) .cse2 .cse3 (= |v_main_#t~post5_9| |v_main_#t~post5_13|) .cse4) (and (= |v_main_#t~post5_13| |v_main_#t~post5_9|) (= v_main_~y~0_7 v_main_~y~0_7) .cse2 .cse3 .cse4) (and .cse1 (<= (div (+ (* (- 1) v_main_~x~0_18) v_main_~z~0_6 (* (- 1) v_main_~z~0_7) .cse5) (- 4294967296)) (+ (div (+ v_main_~x~0_18 (- 4294967295)) 4294967296) 1)) .cse0 (= (+ v_main_~x~0_17 v_main_~z~0_6) (+ v_main_~x~0_18 v_main_~z~0_7)) (< v_main_~z~0_6 v_main_~z~0_7))))) InVars {main_#t~post4=|v_main_#t~post4_4|, main_~y~0=v_main_~y~0_7, main_#t~post5=|v_main_#t~post5_13|, main_~x~0=v_main_~x~0_18, main_~z~0=v_main_~z~0_7} OutVars{main_#t~post4=|v_main_#t~post4_3|, main_#t~post5=|v_main_#t~post5_9|, main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_17, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post4, main_#t~post5] {472#(and (or (and (or (= main_~x~0 0) (and (<= (div (+ 5000000 (* (- 1) main_~x~0)) (- 4294967296)) 0) (< 0 main_~x~0))) (<= main_~y~0 (+ 5000000 main_~z~0)) (<= (+ 5000000 main_~z~0) main_~y~0)) (exists ((aux_div_v_main_~z~0_11_80 Int) (aux_div_aux_mod_v_main_~z~0_11_80_120 Int) (aux_mod_aux_mod_v_main_~z~0_11_80_120 Int)) (and (<= (div (+ (mod main_~y~0 4294967296) (* (- 1) main_~x~0)) (- 4294967296)) (+ aux_div_v_main_~z~0_11_80 1)) (< (+ 5000000 (* aux_div_aux_mod_v_main_~z~0_11_80_120 4294967296)) (+ aux_mod_aux_mod_v_main_~z~0_11_80_120 main_~x~0)) (<= aux_div_aux_mod_v_main_~z~0_11_80_120 0) (<= 0 aux_mod_aux_mod_v_main_~z~0_11_80_120) (<= (+ aux_mod_aux_mod_v_main_~z~0_11_80_120 main_~z~0 main_~x~0) (+ main_~y~0 (* aux_div_aux_mod_v_main_~z~0_11_80_120 4294967296))) (< aux_mod_aux_mod_v_main_~z~0_11_80_120 (+ 5000000 (* aux_div_aux_mod_v_main_~z~0_11_80_120 4294967296))) (<= (+ aux_mod_aux_mod_v_main_~z~0_11_80_120 4289967295 (* 4294967296 aux_div_v_main_~z~0_11_80)) (* aux_div_aux_mod_v_main_~z~0_11_80_120 4294967296)) (<= (+ main_~y~0 (* aux_div_aux_mod_v_main_~z~0_11_80_120 4294967296)) (+ aux_mod_aux_mod_v_main_~z~0_11_80_120 main_~z~0 main_~x~0)) (<= 5000000 (mod (+ 5000000 (* aux_mod_aux_mod_v_main_~z~0_11_80_120 4294967295)) 4294967296))))) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is UNKNOWN [2022-04-15 06:53:33,212 WARN L290 TraceCheckUtils]: 9: Hoare triple {472#(and (or (and (or (= main_~x~0 0) (and (<= (div (+ 5000000 (* (- 1) main_~x~0)) (- 4294967296)) 0) (< 0 main_~x~0))) (<= main_~y~0 (+ 5000000 main_~z~0)) (<= (+ 5000000 main_~z~0) main_~y~0)) (exists ((aux_div_v_main_~z~0_11_80 Int) (aux_div_aux_mod_v_main_~z~0_11_80_120 Int) (aux_mod_aux_mod_v_main_~z~0_11_80_120 Int)) (and (<= (div (+ (mod main_~y~0 4294967296) (* (- 1) main_~x~0)) (- 4294967296)) (+ aux_div_v_main_~z~0_11_80 1)) (< (+ 5000000 (* aux_div_aux_mod_v_main_~z~0_11_80_120 4294967296)) (+ aux_mod_aux_mod_v_main_~z~0_11_80_120 main_~x~0)) (<= aux_div_aux_mod_v_main_~z~0_11_80_120 0) (<= 0 aux_mod_aux_mod_v_main_~z~0_11_80_120) (<= (+ aux_mod_aux_mod_v_main_~z~0_11_80_120 main_~z~0 main_~x~0) (+ main_~y~0 (* aux_div_aux_mod_v_main_~z~0_11_80_120 4294967296))) (< aux_mod_aux_mod_v_main_~z~0_11_80_120 (+ 5000000 (* aux_div_aux_mod_v_main_~z~0_11_80_120 4294967296))) (<= (+ aux_mod_aux_mod_v_main_~z~0_11_80_120 4289967295 (* 4294967296 aux_div_v_main_~z~0_11_80)) (* aux_div_aux_mod_v_main_~z~0_11_80_120 4294967296)) (<= (+ main_~y~0 (* aux_div_aux_mod_v_main_~z~0_11_80_120 4294967296)) (+ aux_mod_aux_mod_v_main_~z~0_11_80_120 main_~z~0 main_~x~0)) (<= 5000000 (mod (+ 5000000 (* aux_mod_aux_mod_v_main_~z~0_11_80_120 4294967295)) 4294967296))))) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} [49] L11-3_primed-->L11-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {476#(exists ((aux_div_main_~y~0_26 Int) (aux_div_aux_mod_main_~x~0_26_133 Int) (aux_div_v_main_~z~0_11_80 Int) (aux_div_aux_mod_v_main_~z~0_11_80_120 Int) (aux_div_aux_mod_main_~y~0_26_37 Int) (aux_div_main_~x~0_26 Int) (aux_mod_aux_mod_v_main_~z~0_11_80_120 Int)) (and (<= aux_div_aux_mod_v_main_~z~0_11_80_120 0) (<= (* 4294967296 aux_div_main_~y~0_26) 10000000) (<= 0 aux_mod_aux_mod_v_main_~z~0_11_80_120) (< (* aux_div_aux_mod_v_main_~z~0_11_80_120 4294967296) (+ (* 4294967296 aux_div_main_~x~0_26) aux_mod_aux_mod_v_main_~z~0_11_80_120 4289967295)) (<= aux_div_aux_mod_main_~x~0_26_133 (+ aux_div_v_main_~z~0_11_80 1)) (< aux_mod_aux_mod_v_main_~z~0_11_80_120 (+ 5000000 (* aux_div_aux_mod_v_main_~z~0_11_80_120 4294967296))) (<= (+ (* 4294967296 aux_div_main_~x~0_26) aux_mod_aux_mod_v_main_~z~0_11_80_120 main_~z~0) (+ (* 4294967296 aux_div_main_~y~0_26) (* aux_div_aux_mod_v_main_~z~0_11_80_120 4294967296))) (< 0 (+ 4284967296 (* aux_div_aux_mod_main_~y~0_26_37 4294967296) (* 4294967296 aux_div_main_~y~0_26))) (<= (+ (* aux_div_aux_mod_main_~y~0_26_37 4294967296) (* 4294967296 aux_div_main_~y~0_26) (* aux_div_aux_mod_v_main_~z~0_11_80_120 4294967296)) (+ (* aux_div_aux_mod_main_~x~0_26_133 4294967296) aux_mod_aux_mod_v_main_~z~0_11_80_120 main_~z~0)) (<= (+ aux_mod_aux_mod_v_main_~z~0_11_80_120 4289967295 (* 4294967296 aux_div_v_main_~z~0_11_80)) (* aux_div_aux_mod_v_main_~z~0_11_80_120 4294967296)) (<= 5000000 (mod (+ 5000000 (* aux_mod_aux_mod_v_main_~z~0_11_80_120 4294967295)) 4294967296))))} is UNKNOWN [2022-04-15 06:53:33,248 INFO L272 TraceCheckUtils]: 10: Hoare triple {476#(exists ((aux_div_main_~y~0_26 Int) (aux_div_aux_mod_main_~x~0_26_133 Int) (aux_div_v_main_~z~0_11_80 Int) (aux_div_aux_mod_v_main_~z~0_11_80_120 Int) (aux_div_aux_mod_main_~y~0_26_37 Int) (aux_div_main_~x~0_26 Int) (aux_mod_aux_mod_v_main_~z~0_11_80_120 Int)) (and (<= aux_div_aux_mod_v_main_~z~0_11_80_120 0) (<= (* 4294967296 aux_div_main_~y~0_26) 10000000) (<= 0 aux_mod_aux_mod_v_main_~z~0_11_80_120) (< (* aux_div_aux_mod_v_main_~z~0_11_80_120 4294967296) (+ (* 4294967296 aux_div_main_~x~0_26) aux_mod_aux_mod_v_main_~z~0_11_80_120 4289967295)) (<= aux_div_aux_mod_main_~x~0_26_133 (+ aux_div_v_main_~z~0_11_80 1)) (< aux_mod_aux_mod_v_main_~z~0_11_80_120 (+ 5000000 (* aux_div_aux_mod_v_main_~z~0_11_80_120 4294967296))) (<= (+ (* 4294967296 aux_div_main_~x~0_26) aux_mod_aux_mod_v_main_~z~0_11_80_120 main_~z~0) (+ (* 4294967296 aux_div_main_~y~0_26) (* aux_div_aux_mod_v_main_~z~0_11_80_120 4294967296))) (< 0 (+ 4284967296 (* aux_div_aux_mod_main_~y~0_26_37 4294967296) (* 4294967296 aux_div_main_~y~0_26))) (<= (+ (* aux_div_aux_mod_main_~y~0_26_37 4294967296) (* 4294967296 aux_div_main_~y~0_26) (* aux_div_aux_mod_v_main_~z~0_11_80_120 4294967296)) (+ (* aux_div_aux_mod_main_~x~0_26_133 4294967296) aux_mod_aux_mod_v_main_~z~0_11_80_120 main_~z~0)) (<= (+ aux_mod_aux_mod_v_main_~z~0_11_80_120 4289967295 (* 4294967296 aux_div_v_main_~z~0_11_80)) (* aux_div_aux_mod_v_main_~z~0_11_80_120 4294967296)) (<= 5000000 (mod (+ 5000000 (* aux_mod_aux_mod_v_main_~z~0_11_80_120 4294967295)) 4294967296))))} call __VERIFIER_assert((if 0 == ~z~0 % 4294967296 then 1 else 0)); {480#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:53:33,249 INFO L290 TraceCheckUtils]: 11: Hoare triple {480#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {484#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:53:33,249 INFO L290 TraceCheckUtils]: 12: Hoare triple {484#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {433#false} is VALID [2022-04-15 06:53:33,250 INFO L290 TraceCheckUtils]: 13: Hoare triple {433#false} assume !false; {433#false} is VALID [2022-04-15 06:53:33,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:53:33,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:02:06,905 WARN L232 SmtUtils]: Spent 6.50s on a formula simplification that was a NOOP. DAG size: 84 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 07:02:06,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {433#false} assume !false; {433#false} is VALID [2022-04-15 07:02:06,934 INFO L290 TraceCheckUtils]: 12: Hoare triple {484#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {433#false} is VALID [2022-04-15 07:02:06,934 INFO L290 TraceCheckUtils]: 11: Hoare triple {480#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {484#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:02:06,935 INFO L272 TraceCheckUtils]: 10: Hoare triple {440#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~z~0 % 4294967296 then 1 else 0)); {480#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:02:06,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {503#(or (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)) (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296)))} [49] L11-3_primed-->L11-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {440#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 07:02:07,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {507#(and (or (<= (div (+ (* (- 1) main_~z~0) (mod main_~y~0 4294967296) (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ (* (- 1) (mod main_~y~0 4294967296)) main_~z~0 main_~x~0 (- 4294967296)) 4294967296) 1)) (not (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod main_~x~0 4294967296)))) (or (<= (div (- main_~z~0) (- 4294967296)) (+ (div (+ main_~z~0 (- 4294967296)) 4294967296) 1)) (<= (div (+ (- 1) (mod main_~y~0 4294967296) (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))))} [52] L11-2-->L11-3_primed: Formula: (let ((.cse6 (mod v_main_~x~0_18 4294967296)) (.cse5 (mod v_main_~y~0_7 4294967296))) (let ((.cse2 (= v_main_~z~0_7 v_main_~z~0_6)) (.cse3 (= v_main_~x~0_18 v_main_~x~0_17)) (.cse4 (= |v_main_#t~post4_4| |v_main_#t~post4_3|)) (.cse1 (< .cse6 .cse5)) (.cse0 (<= 5000000 .cse6))) (or (and (or (not .cse0) (not .cse1)) .cse2 .cse3 (= |v_main_#t~post5_9| |v_main_#t~post5_13|) .cse4) (and (= |v_main_#t~post5_13| |v_main_#t~post5_9|) (= v_main_~y~0_7 v_main_~y~0_7) .cse2 .cse3 .cse4) (and .cse1 (<= (div (+ (* (- 1) v_main_~x~0_18) v_main_~z~0_6 (* (- 1) v_main_~z~0_7) .cse5) (- 4294967296)) (+ (div (+ v_main_~x~0_18 (- 4294967295)) 4294967296) 1)) .cse0 (= (+ v_main_~x~0_17 v_main_~z~0_6) (+ v_main_~x~0_18 v_main_~z~0_7)) (< v_main_~z~0_6 v_main_~z~0_7))))) InVars {main_#t~post4=|v_main_#t~post4_4|, main_~y~0=v_main_~y~0_7, main_#t~post5=|v_main_#t~post5_13|, main_~x~0=v_main_~x~0_18, main_~z~0=v_main_~z~0_7} OutVars{main_#t~post4=|v_main_#t~post4_3|, main_#t~post5=|v_main_#t~post5_9|, main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_17, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post4, main_#t~post5] {503#(or (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)) (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-15 07:02:07,151 INFO L290 TraceCheckUtils]: 7: Hoare triple {507#(and (or (<= (div (+ (* (- 1) main_~z~0) (mod main_~y~0 4294967296) (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ (* (- 1) (mod main_~y~0 4294967296)) main_~z~0 main_~x~0 (- 4294967296)) 4294967296) 1)) (not (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod main_~x~0 4294967296)))) (or (<= (div (- main_~z~0) (- 4294967296)) (+ (div (+ main_~z~0 (- 4294967296)) 4294967296) 1)) (<= (div (+ (- 1) (mod main_~y~0 4294967296) (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))))} [51] L11-3_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {507#(and (or (<= (div (+ (* (- 1) main_~z~0) (mod main_~y~0 4294967296) (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ (* (- 1) (mod main_~y~0 4294967296)) main_~z~0 main_~x~0 (- 4294967296)) 4294967296) 1)) (not (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod main_~x~0 4294967296)))) (or (<= (div (- main_~z~0) (- 4294967296)) (+ (div (+ main_~z~0 (- 4294967296)) 4294967296) 1)) (<= (div (+ (- 1) (mod main_~y~0 4294967296) (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))))} is VALID [2022-04-15 07:02:09,160 WARN L290 TraceCheckUtils]: 6: Hoare triple {514#(and (or (<= (div (+ (* (- 1) main_~z~0) (mod main_~y~0 4294967296) (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ (* (- 1) (mod main_~y~0 4294967296)) main_~z~0 main_~x~0 (- 4294967296)) 4294967296) 1)) (not (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod main_~x~0 4294967296)))) (or (<= (div (- main_~z~0) (- 4294967296)) (+ (div (+ main_~z~0 (- 4294967296)) 4294967296) 1)) (<= (div (+ (- 1) (mod main_~y~0 4294967296) (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))) (or (not (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296))) (and (or (<= (+ (div (+ (- 4299967297) (mod main_~y~0 4294967296)) (- 4294967296)) (div (+ main_~x~0 (- 4294967295)) 4294967296)) (+ (div (+ (- 8589934591) main_~x~0) 4294967296) 2)) (<= (div (- main_~z~0) (- 4294967296)) (+ (div (+ main_~z~0 (- 4294967296)) 4294967296) 1))) (or (<= (+ (div (+ main_~x~0 (- 4294967295)) 4294967296) 1) (div (+ (div (+ (- 8589934591) main_~x~0) 4294967296) 5 (* (- 1) (div (+ (* (- 1) (mod main_~y~0 4294967296)) 4299967295) (- 4294967296))) (div (+ (* (- 1) (mod main_~y~0 4294967296)) (- 8589934591) main_~z~0 main_~x~0) 4294967296) (* (- 1) (div (+ (* (- 1) main_~z~0) (- 4294967296)) (- 4294967296)))) 2)) (<= (+ (div (+ main_~x~0 (- 4294967295)) 4294967296) 1) (div (+ (- 5000000) main_~x~0) 4294967296)) (<= (+ (div (+ (- 4299967296) (* (- 1) main_~z~0) (mod main_~y~0 4294967296)) (- 4294967296)) (div (+ main_~x~0 (- 4294967295)) 4294967296) (div (+ (* (- 1) (mod main_~y~0 4294967296)) (* main_~z~0 (- 4294967295)) (- 4289967296)) (- 4294967296))) (+ (div (+ (- 8589934591) main_~x~0) 4294967296) main_~z~0 3))))))} [50] L11-2-->L11-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_16 4294967296)) (.cse3 (mod v_main_~y~0_6 4294967296))) (let ((.cse0 (< .cse1 .cse3)) (.cse2 (= v_main_~x~0_16 v_main_~x~0_15))) (or (and (or (not .cse0) (not (< .cse1 5000000))) (= |v_main_#t~post5_8| |v_main_#t~post5_10|) .cse2) (let ((.cse4 (* (- 1) v_main_~x~0_15)) (.cse5 (+ 1 (div (+ v_main_~x~0_16 (- 4294967295)) 4294967296)))) (and .cse0 (<= (div (+ .cse3 .cse4) (- 4294967296)) .cse5) (< v_main_~x~0_16 v_main_~x~0_15) (<= (div (+ 5000000 .cse4) (- 4294967296)) .cse5))) (and (= |v_main_#t~post5_10| |v_main_#t~post5_8|) .cse2 (= v_main_~y~0_6 v_main_~y~0_6))))) InVars {main_~y~0=v_main_~y~0_6, main_#t~post5=|v_main_#t~post5_10|, main_~x~0=v_main_~x~0_16} OutVars{main_#t~post5=|v_main_#t~post5_8|, main_~y~0=v_main_~y~0_6, main_~x~0=v_main_~x~0_15} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {507#(and (or (<= (div (+ (* (- 1) main_~z~0) (mod main_~y~0 4294967296) (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ (* (- 1) (mod main_~y~0 4294967296)) main_~z~0 main_~x~0 (- 4294967296)) 4294967296) 1)) (not (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod main_~x~0 4294967296)))) (or (<= (div (- main_~z~0) (- 4294967296)) (+ (div (+ main_~z~0 (- 4294967296)) 4294967296) 1)) (<= (div (+ (- 1) (mod main_~y~0 4294967296) (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))))} is UNKNOWN [2022-04-15 07:02:09,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {432#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {514#(and (or (<= (div (+ (* (- 1) main_~z~0) (mod main_~y~0 4294967296) (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ (* (- 1) (mod main_~y~0 4294967296)) main_~z~0 main_~x~0 (- 4294967296)) 4294967296) 1)) (not (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod main_~x~0 4294967296)))) (or (<= (div (- main_~z~0) (- 4294967296)) (+ (div (+ main_~z~0 (- 4294967296)) 4294967296) 1)) (<= (div (+ (- 1) (mod main_~y~0 4294967296) (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))) (or (not (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296))) (and (or (<= (+ (div (+ (- 4299967297) (mod main_~y~0 4294967296)) (- 4294967296)) (div (+ main_~x~0 (- 4294967295)) 4294967296)) (+ (div (+ (- 8589934591) main_~x~0) 4294967296) 2)) (<= (div (- main_~z~0) (- 4294967296)) (+ (div (+ main_~z~0 (- 4294967296)) 4294967296) 1))) (or (<= (+ (div (+ main_~x~0 (- 4294967295)) 4294967296) 1) (div (+ (div (+ (- 8589934591) main_~x~0) 4294967296) 5 (* (- 1) (div (+ (* (- 1) (mod main_~y~0 4294967296)) 4299967295) (- 4294967296))) (div (+ (* (- 1) (mod main_~y~0 4294967296)) (- 8589934591) main_~z~0 main_~x~0) 4294967296) (* (- 1) (div (+ (* (- 1) main_~z~0) (- 4294967296)) (- 4294967296)))) 2)) (<= (+ (div (+ main_~x~0 (- 4294967295)) 4294967296) 1) (div (+ (- 5000000) main_~x~0) 4294967296)) (<= (+ (div (+ (- 4299967296) (* (- 1) main_~z~0) (mod main_~y~0 4294967296)) (- 4294967296)) (div (+ main_~x~0 (- 4294967295)) 4294967296) (div (+ (* (- 1) (mod main_~y~0 4294967296)) (* main_~z~0 (- 4294967295)) (- 4289967296)) (- 4294967296))) (+ (div (+ (- 8589934591) main_~x~0) 4294967296) main_~z~0 3))))))} is VALID [2022-04-15 07:02:09,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {432#true} call #t~ret6 := main(); {432#true} is VALID [2022-04-15 07:02:09,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {432#true} {432#true} #42#return; {432#true} is VALID [2022-04-15 07:02:09,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {432#true} assume true; {432#true} is VALID [2022-04-15 07:02:09,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {432#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {432#true} is VALID [2022-04-15 07:02:09,163 INFO L272 TraceCheckUtils]: 0: Hoare triple {432#true} call ULTIMATE.init(); {432#true} is VALID [2022-04-15 07:02:09,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:02:09,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452998478] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:02:09,163 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 07:02:09,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-15 07:02:12,993 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:02:12,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1232339061] [2022-04-15 07:02:12,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1232339061] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:02:12,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:02:12,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 07:02:12,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094724325] [2022-04-15 07:02:12,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:02:12,994 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 07:02:12,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:02:12,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:02:13,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:02:13,020 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 07:02:13,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:02:13,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 07:02:13,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=330, Unknown=1, NotChecked=0, Total=420 [2022-04-15 07:02:13,022 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:02:17,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:02:17,654 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-15 07:02:17,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 07:02:17,654 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 07:02:17,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:02:17,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:02:17,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2022-04-15 07:02:17,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:02:17,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2022-04-15 07:02:17,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 36 transitions. [2022-04-15 07:02:17,703 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-15 07:02:17,704 INFO L225 Difference]: With dead ends: 31 [2022-04-15 07:02:17,704 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 07:02:17,705 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=140, Invalid=509, Unknown=1, NotChecked=0, Total=650 [2022-04-15 07:02:17,706 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 18 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:02:17,706 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 53 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 07:02:17,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 07:02:17,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-15 07:02:17,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:02:17,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 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-15 07:02:17,743 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 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-15 07:02:17,743 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 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-15 07:02:17,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:02:17,745 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-15 07:02:17,745 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-15 07:02:17,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:02:17,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:02:17,745 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 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 23 states. [2022-04-15 07:02:17,746 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 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 23 states. [2022-04-15 07:02:17,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:02:17,747 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-15 07:02:17,747 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-15 07:02:17,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:02:17,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:02:17,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:02:17,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:02:17,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 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-15 07:02:17,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-04-15 07:02:17,749 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 17 [2022-04-15 07:02:17,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:02:17,749 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-04-15 07:02:17,749 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:02:17,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 24 transitions. [2022-04-15 07:02:17,781 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-15 07:02:17,782 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-15 07:02:17,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 07:02:17,782 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:02:17,782 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:02:17,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 07:02:17,983 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:02:17,983 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:02:17,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:02:17,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1470542348, now seen corresponding path program 2 times [2022-04-15 07:02:17,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:02:17,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1863330828] [2022-04-15 07:02:21,037 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:02:21,341 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:02:25,596 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:02:25,901 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:02:25,902 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:02:25,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1480889682, now seen corresponding path program 1 times [2022-04-15 07:02:25,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:02:25,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581475402] [2022-04-15 07:02:25,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:02:25,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:02:25,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:02:26,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:02:26,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:02:26,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {712#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {701#true} is VALID [2022-04-15 07:02:26,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {701#true} assume true; {701#true} is VALID [2022-04-15 07:02:26,239 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {701#true} {701#true} #42#return; {701#true} is VALID [2022-04-15 07:02:26,240 INFO L272 TraceCheckUtils]: 0: Hoare triple {701#true} call ULTIMATE.init(); {712#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:02:26,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {712#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {701#true} is VALID [2022-04-15 07:02:26,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {701#true} assume true; {701#true} is VALID [2022-04-15 07:02:26,240 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {701#true} {701#true} #42#return; {701#true} is VALID [2022-04-15 07:02:26,240 INFO L272 TraceCheckUtils]: 4: Hoare triple {701#true} call #t~ret6 := main(); {701#true} is VALID [2022-04-15 07:02:26,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {701#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {706#(and (= main_~x~0 0) (<= main_~y~0 (+ 5000000 main_~z~0)) (<= 10000000 main_~y~0) (<= (+ 5000000 main_~z~0) main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 07:02:26,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {706#(and (= main_~x~0 0) (<= main_~y~0 (+ 5000000 main_~z~0)) (<= 10000000 main_~y~0) (<= (+ 5000000 main_~z~0) main_~y~0) (<= (div main_~y~0 4294967296) 0))} [54] L11-2-->L11-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_35 4294967296))) (let ((.cse0 (= |v_main_#t~post5_24| |v_main_#t~post5_22|)) (.cse1 (= v_main_~x~0_35 v_main_~x~0_34)) (.cse4 (mod v_main_~y~0_11 4294967296)) (.cse2 (< .cse3 5000000))) (or (and (= v_main_~y~0_11 v_main_~y~0_11) .cse0 .cse1) (and (or (not .cse2) (not (< .cse3 .cse4))) .cse0 .cse1) (let ((.cse5 (* (- 1) v_main_~x~0_34)) (.cse6 (+ (div (+ v_main_~x~0_35 (- 4294967295)) 4294967296) 1))) (and (<= (div (+ .cse5 .cse4) (- 4294967296)) .cse6) .cse2 (< v_main_~x~0_35 v_main_~x~0_34) (<= (div (+ 5000000 .cse5) (- 4294967296)) .cse6)))))) InVars {main_~y~0=v_main_~y~0_11, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_35} OutVars{main_#t~post5=|v_main_#t~post5_22|, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_34} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {707#(and (or (= main_~x~0 0) (and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= (+ main_~z~0 main_~x~0) (+ main_~y~0 (* (div (+ 5000000 (* (- 1) main_~x~0)) (- 4294967296)) 4294967296))) (<= (+ 5000000 main_~x~0) main_~y~0) (<= (+ main_~y~0 (* (div (+ 5000000 (* (- 1) main_~x~0)) (- 4294967296)) 4294967296)) (+ 5000000 main_~z~0)))) (or (<= 10000000 main_~y~0) (not (= main_~x~0 0))) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 07:02:26,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {707#(and (or (= main_~x~0 0) (and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= (+ main_~z~0 main_~x~0) (+ main_~y~0 (* (div (+ 5000000 (* (- 1) main_~x~0)) (- 4294967296)) 4294967296))) (<= (+ 5000000 main_~x~0) main_~y~0) (<= (+ main_~y~0 (* (div (+ 5000000 (* (- 1) main_~x~0)) (- 4294967296)) 4294967296)) (+ 5000000 main_~z~0)))) (or (<= 10000000 main_~y~0) (not (= main_~x~0 0))) (<= (div main_~y~0 4294967296) 0))} [55] L11-3_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {707#(and (or (= main_~x~0 0) (and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= (+ main_~z~0 main_~x~0) (+ main_~y~0 (* (div (+ 5000000 (* (- 1) main_~x~0)) (- 4294967296)) 4294967296))) (<= (+ 5000000 main_~x~0) main_~y~0) (<= (+ main_~y~0 (* (div (+ 5000000 (* (- 1) main_~x~0)) (- 4294967296)) 4294967296)) (+ 5000000 main_~z~0)))) (or (<= 10000000 main_~y~0) (not (= main_~x~0 0))) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 07:02:26,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {707#(and (or (= main_~x~0 0) (and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= (+ main_~z~0 main_~x~0) (+ main_~y~0 (* (div (+ 5000000 (* (- 1) main_~x~0)) (- 4294967296)) 4294967296))) (<= (+ 5000000 main_~x~0) main_~y~0) (<= (+ main_~y~0 (* (div (+ 5000000 (* (- 1) main_~x~0)) (- 4294967296)) 4294967296)) (+ 5000000 main_~z~0)))) (or (<= 10000000 main_~y~0) (not (= main_~x~0 0))) (<= (div main_~y~0 4294967296) 0))} [56] L11-2-->L11-3_primed: Formula: (let ((.cse7 (mod v_main_~x~0_37 4294967296)) (.cse0 (mod v_main_~y~0_12 4294967296))) (let ((.cse3 (= v_main_~x~0_37 v_main_~x~0_36)) (.cse4 (= v_main_~z~0_17 v_main_~z~0_16)) (.cse2 (< .cse7 .cse0)) (.cse1 (<= 5000000 .cse7)) (.cse5 (= |v_main_#t~post4_11| |v_main_#t~post4_10|)) (.cse6 (= |v_main_#t~post5_27| |v_main_#t~post5_23|))) (or (and (<= (div (+ v_main_~z~0_16 (* (- 1) v_main_~x~0_37) .cse0 (* (- 1) v_main_~z~0_17)) (- 4294967296)) (+ (div (+ v_main_~x~0_37 (- 4294967295)) 4294967296) 1)) .cse1 (= (+ v_main_~x~0_36 v_main_~z~0_16) (+ v_main_~x~0_37 v_main_~z~0_17)) (< v_main_~z~0_16 v_main_~z~0_17) .cse2) (and .cse3 .cse4 .cse5 (= v_main_~y~0_12 v_main_~y~0_12) .cse6) (and .cse3 .cse4 (or (not .cse2) (not .cse1)) .cse5 .cse6)))) InVars {main_#t~post4=|v_main_#t~post4_11|, main_~y~0=v_main_~y~0_12, main_#t~post5=|v_main_#t~post5_27|, main_~x~0=v_main_~x~0_37, main_~z~0=v_main_~z~0_17} OutVars{main_#t~post4=|v_main_#t~post4_10|, main_#t~post5=|v_main_#t~post5_23|, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_36, main_~z~0=v_main_~z~0_16} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post4, main_#t~post5] {708#(and (or (and (or (<= (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0 main_~x~0) (+ main_~y~0 (* (div main_~z~0 4294967296) 4294967296))) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))) (not (<= (+ (div main_~x~0 4294967296) 1) 0))) (and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ 5000000 main_~x~0) main_~y~0))) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 07:02:26,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {708#(and (or (and (or (<= (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0 main_~x~0) (+ main_~y~0 (* (div main_~z~0 4294967296) 4294967296))) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))) (not (<= (+ (div main_~x~0 4294967296) 1) 0))) (and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ 5000000 main_~x~0) main_~y~0))) (<= (div main_~y~0 4294967296) 0))} [53] L11-3_primed-->L11-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {709#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 07:02:26,251 INFO L272 TraceCheckUtils]: 10: Hoare triple {709#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~z~0 % 4294967296 then 1 else 0)); {710#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:02:26,251 INFO L290 TraceCheckUtils]: 11: Hoare triple {710#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {711#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:02:26,253 INFO L290 TraceCheckUtils]: 12: Hoare triple {711#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {702#false} is VALID [2022-04-15 07:02:26,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {702#false} assume !false; {702#false} is VALID [2022-04-15 07:02:26,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:02:26,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:02:26,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581475402] [2022-04-15 07:02:26,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581475402] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:02:26,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246809507] [2022-04-15 07:02:26,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:02:26,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:02:26,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:02:26,255 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-15 07:02:26,256 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-15 07:02:26,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:02:26,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 07:02:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:02:26,322 INFO L286 TraceCheckSpWp]: Computing forward predicates...