/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_12.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:43:19,995 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:43:19,996 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:43:20,043 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:43:20,043 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:43:20,045 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:43:20,051 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:43:20,056 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:43:20,057 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:43:20,061 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:43:20,062 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:43:20,062 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:43:20,063 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:43:20,063 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:43:20,064 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:43:20,064 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:43:20,065 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:43:20,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:43:20,066 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:43:20,067 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:43:20,068 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:43:20,072 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:43:20,073 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:43:20,073 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:43:20,075 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:43:20,083 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:43:20,083 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:43:20,083 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:43:20,084 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:43:20,085 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:43:20,085 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:43:20,085 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:43:20,087 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:43:20,087 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:43:20,088 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:43:20,088 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:43:20,088 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:43:20,089 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:43:20,089 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:43:20,089 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:43:20,089 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:43:20,091 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:43:20,092 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 03:43:20,104 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:43:20,104 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:43:20,107 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:43:20,107 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:43:20,107 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:43:20,107 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:43:20,107 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:43:20,107 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:43:20,108 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:43:20,108 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:43:20,108 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:43:20,108 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:43:20,109 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:43:20,109 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:43:20,109 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:43:20,109 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:43:20,109 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:43:20,109 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:43:20,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:43:20,109 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:43:20,109 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:43:20,109 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:43:20,110 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:43:20,110 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:43:20,110 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:43:20,110 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 03:43:20,314 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:43:20,335 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:43:20,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:43:20,340 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:43:20,341 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:43:20,342 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_12.c [2022-04-28 03:43:20,393 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f315dee5/8c64eedea7a84aba9f116a62927311ec/FLAG0567fcc3d [2022-04-28 03:43:20,724 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:43:20,724 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_12.c [2022-04-28 03:43:20,728 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f315dee5/8c64eedea7a84aba9f116a62927311ec/FLAG0567fcc3d [2022-04-28 03:43:21,180 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f315dee5/8c64eedea7a84aba9f116a62927311ec [2022-04-28 03:43:21,182 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:43:21,183 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:43:21,191 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:43:21,192 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:43:21,194 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:43:21,195 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:43:21" (1/1) ... [2022-04-28 03:43:21,195 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6708b362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:43:21, skipping insertion in model container [2022-04-28 03:43:21,195 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:43:21" (1/1) ... [2022-04-28 03:43:21,202 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:43:21,226 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:43:21,378 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_12.c[319,332] [2022-04-28 03:43:21,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:43:21,415 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:43:21,423 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_12.c[319,332] [2022-04-28 03:43:21,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:43:21,437 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:43:21,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:43:21 WrapperNode [2022-04-28 03:43:21,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:43:21,438 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:43:21,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:43:21,439 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:43:21,445 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:43:21" (1/1) ... [2022-04-28 03:43:21,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:43:21" (1/1) ... [2022-04-28 03:43:21,450 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:43:21" (1/1) ... [2022-04-28 03:43:21,450 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:43:21" (1/1) ... [2022-04-28 03:43:21,457 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:43:21" (1/1) ... [2022-04-28 03:43:21,459 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:43:21" (1/1) ... [2022-04-28 03:43:21,460 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:43:21" (1/1) ... [2022-04-28 03:43:21,462 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:43:21,463 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:43:21,463 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:43:21,463 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:43:21,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:43:21" (1/1) ... [2022-04-28 03:43:21,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:43:21,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:43:21,512 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 03:43:21,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 03:43:21,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:43:21,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:43:21,596 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:43:21,596 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:43:21,596 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:43:21,596 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:43:21,596 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:43:21,596 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:43:21,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:43:21,596 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:43:21,597 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:43:21,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:43:21,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:43:21,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:43:21,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:43:21,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:43:21,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:43:21,637 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:43:21,638 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:43:21,714 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:43:21,718 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:43:21,719 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 03:43:21,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:43:21 BoogieIcfgContainer [2022-04-28 03:43:21,720 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:43:21,721 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:43:21,721 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:43:21,723 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:43:21,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:43:21" (1/3) ... [2022-04-28 03:43:21,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71b9286d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:43:21, skipping insertion in model container [2022-04-28 03:43:21,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:43:21" (2/3) ... [2022-04-28 03:43:21,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71b9286d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:43:21, skipping insertion in model container [2022-04-28 03:43:21,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:43:21" (3/3) ... [2022-04-28 03:43:21,725 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_12.c [2022-04-28 03:43:21,733 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:43:21,733 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:43:21,759 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:43:21,763 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@d91c388, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@56cd46ea [2022-04-28 03:43:21,763 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:43:21,768 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-28 03:43:21,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 03:43:21,772 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:43:21,772 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:43:21,773 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:21,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:21,776 INFO L85 PathProgramCache]: Analyzing trace with hash -2135496849, now seen corresponding path program 1 times [2022-04-28 03:43:21,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:21,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [982203948] [2022-04-28 03:43:21,787 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:43:21,788 INFO L85 PathProgramCache]: Analyzing trace with hash -2135496849, now seen corresponding path program 2 times [2022-04-28 03:43:21,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:43:21,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729099967] [2022-04-28 03:43:21,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:21,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:43:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:21,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:43:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:21,976 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(18, 2);call #Ultimate.allocInit(12, 3); {24#true} is VALID [2022-04-28 03:43:21,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 03:43:21,976 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #42#return; {24#true} is VALID [2022-04-28 03:43:21,978 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:43:21,978 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(18, 2);call #Ultimate.allocInit(12, 3); {24#true} is VALID [2022-04-28 03:43:21,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 03:43:21,978 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #42#return; {24#true} is VALID [2022-04-28 03:43:21,978 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret5 := main(); {24#true} is VALID [2022-04-28 03:43:21,978 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 0; {24#true} is VALID [2022-04-28 03:43:21,979 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !true; {25#false} is VALID [2022-04-28 03:43:21,979 INFO L272 TraceCheckUtils]: 7: Hoare triple {25#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 2 then ~z~0 % 4294967296 % 2 - 2 else ~z~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {25#false} is VALID [2022-04-28 03:43:21,979 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-28 03:43:21,979 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-28 03:43:21,980 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-28 03:43:21,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:43:21,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:43:21,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729099967] [2022-04-28 03:43:21,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729099967] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:21,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:21,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:43:21,983 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:43:21,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [982203948] [2022-04-28 03:43:21,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [982203948] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:21,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:21,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:43:21,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411021272] [2022-04-28 03:43:21,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:43:21,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-28 03:43:21,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:43:21,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:22,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:22,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 03:43:22,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:22,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 03:43:22,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 03:43:22,022 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-28 03:43:22,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:22,101 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-28 03:43:22,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 03:43:22,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 03:43:22,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:43:22,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:22,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-28 03:43:22,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:22,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-28 03:43:22,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 37 transitions. [2022-04-28 03:43:22,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:22,166 INFO L225 Difference]: With dead ends: 33 [2022-04-28 03:43:22,166 INFO L226 Difference]: Without dead ends: 14 [2022-04-28 03:43:22,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 03:43:22,172 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:43:22,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:43:22,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-28 03:43:22,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-28 03:43:22,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:43:22,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:22,204 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:22,205 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:22,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:22,210 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-28 03:43:22,210 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-28 03:43:22,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:22,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:22,211 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-28 03:43:22,211 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-28 03:43:22,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:22,215 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-28 03:43:22,215 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-28 03:43:22,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:22,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:22,216 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:43:22,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:43:22,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:22,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-28 03:43:22,219 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-28 03:43:22,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:43:22,219 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-28 03:43:22,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:22,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 15 transitions. [2022-04-28 03:43:22,239 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:22,239 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-28 03:43:22,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 03:43:22,242 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:43:22,242 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:43:22,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:43:22,246 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:22,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:22,248 INFO L85 PathProgramCache]: Analyzing trace with hash -2145655580, now seen corresponding path program 1 times [2022-04-28 03:43:22,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:22,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2042545488] [2022-04-28 03:43:22,254 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:43:22,254 INFO L85 PathProgramCache]: Analyzing trace with hash -2145655580, now seen corresponding path program 2 times [2022-04-28 03:43:22,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:43:22,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15752894] [2022-04-28 03:43:22,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:22,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:43:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:22,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:43:22,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:22,343 INFO L290 TraceCheckUtils]: 0: Hoare triple {162#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {154#true} is VALID [2022-04-28 03:43:22,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {154#true} assume true; {154#true} is VALID [2022-04-28 03:43:22,343 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {154#true} {154#true} #42#return; {154#true} is VALID [2022-04-28 03:43:22,344 INFO L272 TraceCheckUtils]: 0: Hoare triple {154#true} call ULTIMATE.init(); {162#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:43:22,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {162#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {154#true} is VALID [2022-04-28 03:43:22,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {154#true} assume true; {154#true} is VALID [2022-04-28 03:43:22,344 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {154#true} {154#true} #42#return; {154#true} is VALID [2022-04-28 03:43:22,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {154#true} call #t~ret5 := main(); {154#true} is VALID [2022-04-28 03:43:22,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {154#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 0; {159#(= main_~z~0 0)} is VALID [2022-04-28 03:43:22,345 INFO L290 TraceCheckUtils]: 6: Hoare triple {159#(= main_~z~0 0)} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {159#(= main_~z~0 0)} is VALID [2022-04-28 03:43:22,346 INFO L272 TraceCheckUtils]: 7: Hoare triple {159#(= main_~z~0 0)} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 2 then ~z~0 % 4294967296 % 2 - 2 else ~z~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {160#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:43:22,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {160#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {161#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:43:22,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {161#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {155#false} is VALID [2022-04-28 03:43:22,347 INFO L290 TraceCheckUtils]: 10: Hoare triple {155#false} assume !false; {155#false} is VALID [2022-04-28 03:43:22,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:43:22,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:43:22,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15752894] [2022-04-28 03:43:22,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15752894] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:22,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:22,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:43:22,348 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:43:22,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2042545488] [2022-04-28 03:43:22,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2042545488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:22,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:22,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:43:22,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611335146] [2022-04-28 03:43:22,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:43:22,350 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 03:43:22,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:43:22,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:22,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:22,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:43:22,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:22,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:43:22,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:43:22,360 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:22,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:22,450 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-28 03:43:22,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:43:22,450 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 03:43:22,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:43:22,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:22,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-28 03:43:22,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:22,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-28 03:43:22,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 24 transitions. [2022-04-28 03:43:22,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:22,474 INFO L225 Difference]: With dead ends: 22 [2022-04-28 03:43:22,474 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 03:43:22,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 03:43:22,475 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:43:22,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 31 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:43:22,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 03:43:22,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 03:43:22,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:43:22,479 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:22,479 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:22,479 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:22,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:22,480 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 03:43:22,480 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 03:43:22,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:22,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:22,481 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 03:43:22,481 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 03:43:22,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:22,482 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 03:43:22,482 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 03:43:22,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:22,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:22,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:43:22,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:43:22,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:22,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-28 03:43:22,483 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-28 03:43:22,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:43:22,483 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-28 03:43:22,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:22,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-28 03:43:22,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:22,499 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 03:43:22,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 03:43:22,500 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:43:22,500 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:43:22,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:43:22,500 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:22,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:22,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1854346422, now seen corresponding path program 1 times [2022-04-28 03:43:22,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:22,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2145571682] [2022-04-28 03:43:26,950 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:43:30,969 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:43:31,253 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:43:31,255 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:43:31,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1115131409, now seen corresponding path program 1 times [2022-04-28 03:43:31,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:43:31,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699965321] [2022-04-28 03:43:31,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:31,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:43:31,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:31,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:43:31,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:31,340 INFO L290 TraceCheckUtils]: 0: Hoare triple {292#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {283#true} is VALID [2022-04-28 03:43:31,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {283#true} assume true; {283#true} is VALID [2022-04-28 03:43:31,340 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {283#true} {283#true} #42#return; {283#true} is VALID [2022-04-28 03:43:31,340 INFO L272 TraceCheckUtils]: 0: Hoare triple {283#true} call ULTIMATE.init(); {292#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:43:31,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {292#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {283#true} is VALID [2022-04-28 03:43:31,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {283#true} assume true; {283#true} is VALID [2022-04-28 03:43:31,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {283#true} {283#true} #42#return; {283#true} is VALID [2022-04-28 03:43:31,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {283#true} call #t~ret5 := main(); {283#true} is VALID [2022-04-28 03:43:31,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {283#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 0; {288#(and (= main_~z~0 0) (= main_~x~0 0))} is VALID [2022-04-28 03:43:31,342 INFO L290 TraceCheckUtils]: 6: Hoare triple {288#(and (= main_~z~0 0) (= main_~x~0 0))} [48] L10-2-->L10-3_primed: Formula: (let ((.cse6 (mod v_main_~x~0_9 4294967296)) (.cse1 (mod v_main_~y~0_4 4294967296))) (let ((.cse3 (= v_main_~x~0_9 v_main_~x~0_8)) (.cse4 (= v_main_~z~0_7 v_main_~z~0_6)) (.cse2 (< .cse6 .cse1)) (.cse0 (<= 5000000 .cse6)) (.cse5 (= |v_main_#t~post4_4| |v_main_#t~post4_3|))) (or (and (= (+ v_main_~z~0_6 (* v_main_~x~0_9 2)) (+ v_main_~z~0_7 (* v_main_~x~0_8 2))) (< v_main_~x~0_9 v_main_~x~0_8) .cse0 (<= (div (+ (* (- 1) v_main_~x~0_8) .cse1) (- 4294967296)) (+ (div (+ v_main_~x~0_9 (- 4294967295)) 4294967296) 1)) .cse2) (and .cse3 .cse4 .cse5 (= v_main_~y~0_4 v_main_~y~0_4)) (and .cse3 .cse4 (or (not .cse2) (not .cse0)) .cse5)))) InVars {main_#t~post4=|v_main_#t~post4_4|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_7} OutVars{main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_8, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post4] {289#(and (<= main_~z~0 (* 2 (div main_~z~0 2))) (not (<= (+ (div main_~z~0 2) 1) 0)))} is VALID [2022-04-28 03:43:31,343 INFO L290 TraceCheckUtils]: 7: Hoare triple {289#(and (<= main_~z~0 (* 2 (div main_~z~0 2))) (not (<= (+ (div main_~z~0 2) 1) 0)))} [47] L10-3_primed-->L10-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[] {289#(and (<= main_~z~0 (* 2 (div main_~z~0 2))) (not (<= (+ (div main_~z~0 2) 1) 0)))} is VALID [2022-04-28 03:43:31,344 INFO L272 TraceCheckUtils]: 8: Hoare triple {289#(and (<= main_~z~0 (* 2 (div main_~z~0 2))) (not (<= (+ (div main_~z~0 2) 1) 0)))} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 2 then ~z~0 % 4294967296 % 2 - 2 else ~z~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {290#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:43:31,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {290#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {291#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:43:31,344 INFO L290 TraceCheckUtils]: 10: Hoare triple {291#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {284#false} is VALID [2022-04-28 03:43:31,345 INFO L290 TraceCheckUtils]: 11: Hoare triple {284#false} assume !false; {284#false} is VALID [2022-04-28 03:43:31,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:43:31,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:43:31,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699965321] [2022-04-28 03:43:31,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699965321] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:31,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:31,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:43:31,376 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:43:31,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2145571682] [2022-04-28 03:43:31,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2145571682] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:31,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:31,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:43:31,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077298057] [2022-04-28 03:43:31,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:43:31,377 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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-28 03:43:31,377 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:43:31,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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-28 03:43:31,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:31,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:43:31,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:31,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:43:31,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-28 03:43:31,388 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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-28 03:43:31,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:31,538 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-28 03:43:31,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:43:31,538 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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-28 03:43:31,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:43:31,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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-28 03:43:31,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2022-04-28 03:43:31,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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-28 03:43:31,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2022-04-28 03:43:31,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 27 transitions. [2022-04-28 03:43:31,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:31,564 INFO L225 Difference]: With dead ends: 26 [2022-04-28 03:43:31,564 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 03:43:31,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-28 03:43:31,565 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 18 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:43:31,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 25 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:43:31,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 03:43:31,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 03:43:31,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:43:31,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 03:43:31,567 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 03:43:31,567 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 03:43:31,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:31,567 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 03:43:31,567 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:43:31,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:31,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:31,567 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 03:43:31,567 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 03:43:31,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:31,568 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 03:43:31,568 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:43:31,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:31,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:31,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:43:31,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:43:31,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 03:43:31,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 03:43:31,568 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-04-28 03:43:31,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:43:31,569 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 03:43:31,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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-28 03:43:31,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 03:43:31,569 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:31,569 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:43:31,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:31,571 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 03:43:31,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 03:43:31,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 03:43:31,663 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-28 03:43:31,663 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-28 03:43:31,663 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-28 03:43:31,663 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 03:43:31,663 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 03:43:31,663 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 03:43:31,663 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 03:43:31,663 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 03:43:31,664 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 03:43:31,664 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 03:43:31,664 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 6 17) the Hoare annotation is: true [2022-04-28 03:43:31,664 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 6 17) the Hoare annotation is: true [2022-04-28 03:43:31,664 INFO L902 garLoopResultBuilder]: At program point L15(line 15) the Hoare annotation is: true [2022-04-28 03:43:31,664 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 6 17) the Hoare annotation is: true [2022-04-28 03:43:31,664 INFO L895 garLoopResultBuilder]: At program point L11(lines 11 12) the Hoare annotation is: (let ((.cse0 (div main_~z~0 2))) (and (<= main_~z~0 (* 2 .cse0)) (not (<= (+ .cse0 1) 0)))) [2022-04-28 03:43:31,664 INFO L895 garLoopResultBuilder]: At program point L11-2(lines 11 12) the Hoare annotation is: (let ((.cse0 (div main_~z~0 2))) (and (<= main_~z~0 (* 2 .cse0)) (not (<= (+ .cse0 1) 0)))) [2022-04-28 03:43:31,664 INFO L895 garLoopResultBuilder]: At program point L10-2(lines 10 14) the Hoare annotation is: (let ((.cse0 (div main_~z~0 2))) (and (<= main_~z~0 (* 2 .cse0)) (not (<= (+ .cse0 1) 0)))) [2022-04-28 03:43:31,664 INFO L895 garLoopResultBuilder]: At program point L10-3(lines 10 14) the Hoare annotation is: (let ((.cse0 (div main_~z~0 2))) (and (<= main_~z~0 (* 2 .cse0)) (not (<= (+ .cse0 1) 0)))) [2022-04-28 03:43:31,665 INFO L902 garLoopResultBuilder]: At program point L4-3(line 4) the Hoare annotation is: true [2022-04-28 03:43:31,665 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(line 4) the Hoare annotation is: true [2022-04-28 03:43:31,665 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(line 4) the Hoare annotation is: true [2022-04-28 03:43:31,665 INFO L895 garLoopResultBuilder]: At program point L4(line 4) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 03:43:31,665 INFO L895 garLoopResultBuilder]: At program point L4-1(line 4) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 03:43:31,665 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 03:43:31,667 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2022-04-28 03:43:31,668 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 03:43:31,671 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 03:43:31,672 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 03:43:31,678 INFO L163 areAnnotationChecker]: CFG has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 03:43:31,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 03:43:31 BoogieIcfgContainer [2022-04-28 03:43:31,684 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 03:43:31,685 INFO L158 Benchmark]: Toolchain (without parser) took 10502.17ms. Allocated memory was 232.8MB in the beginning and 305.1MB in the end (delta: 72.4MB). Free memory was 184.8MB in the beginning and 259.7MB in the end (delta: -75.0MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 03:43:31,685 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 232.8MB. Free memory was 200.8MB in the beginning and 200.7MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 03:43:31,685 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.18ms. Allocated memory is still 232.8MB. Free memory was 184.6MB in the beginning and 209.1MB in the end (delta: -24.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 03:43:31,686 INFO L158 Benchmark]: Boogie Preprocessor took 23.80ms. Allocated memory is still 232.8MB. Free memory was 209.1MB in the beginning and 207.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 03:43:31,686 INFO L158 Benchmark]: RCFGBuilder took 257.21ms. Allocated memory is still 232.8MB. Free memory was 207.5MB in the beginning and 197.6MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-28 03:43:31,686 INFO L158 Benchmark]: TraceAbstraction took 9963.32ms. Allocated memory was 232.8MB in the beginning and 305.1MB in the end (delta: 72.4MB). Free memory was 197.0MB in the beginning and 259.7MB in the end (delta: -62.7MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. [2022-04-28 03:43:31,687 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 232.8MB. Free memory was 200.8MB in the beginning and 200.7MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 246.18ms. Allocated memory is still 232.8MB. Free memory was 184.6MB in the beginning and 209.1MB in the end (delta: -24.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.80ms. Allocated memory is still 232.8MB. Free memory was 209.1MB in the beginning and 207.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 257.21ms. Allocated memory is still 232.8MB. Free memory was 207.5MB in the beginning and 197.6MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 9963.32ms. Allocated memory was 232.8MB in the beginning and 305.1MB in the end (delta: 72.4MB). Free memory was 197.0MB in the beginning and 259.7MB in the end (delta: -62.7MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 4]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.9s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 49 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 80 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 63 IncrementalHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 43 mSDtfsCounter, 63 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 39 PreInvPairs, 61 NumberOfFragments, 98 HoareAnnotationTreeSize, 39 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 111 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: z <= 2 * (z / 2) && !(z / 2 + 1 <= 0) - ProcedureContractResult [Line: 6]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 4]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-28 03:43:31,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...