/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-acceleration/diamond_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 02:56:19,023 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 02:56:19,024 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 02:56:19,041 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 02:56:19,042 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 02:56:19,042 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 02:56:19,043 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 02:56:19,044 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 02:56:19,045 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 02:56:19,045 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 02:56:19,046 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 02:56:19,047 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 02:56:19,047 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 02:56:19,048 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 02:56:19,048 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 02:56:19,049 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 02:56:19,049 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 02:56:19,050 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 02:56:19,051 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 02:56:19,052 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 02:56:19,053 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 02:56:19,054 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 02:56:19,054 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 02:56:19,055 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 02:56:19,055 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 02:56:19,057 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 02:56:19,058 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 02:56:19,058 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 02:56:19,058 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 02:56:19,059 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 02:56:19,059 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 02:56:19,059 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 02:56:19,060 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 02:56:19,060 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 02:56:19,061 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 02:56:19,061 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 02:56:19,062 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 02:56:19,062 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 02:56:19,062 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 02:56:19,062 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 02:56:19,063 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 02:56:19,063 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 02:56:19,064 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 02:56:19,069 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 02:56:19,070 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 02:56:19,070 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 02:56:19,070 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 02:56:19,070 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 02:56:19,071 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 02:56:19,071 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 02:56:19,071 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 02:56:19,071 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 02:56:19,071 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 02:56:19,071 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 02:56:19,071 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 02:56:19,071 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 02:56:19,071 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 02:56:19,071 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 02:56:19,071 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 02:56:19,071 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 02:56:19,072 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 02:56:19,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:56:19,072 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 02:56:19,072 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 02:56:19,072 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 02:56:19,072 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 02:56:19,072 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 02:56:19,072 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 02:56:19,072 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 02:56:19,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 02:56:19,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 02:56:19,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 02:56:19,262 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 02:56:19,263 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 02:56:19,264 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_1-1.c [2022-04-28 02:56:19,310 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33e120771/7ccd66ef2a6f4be89f60b8e2d731edfd/FLAG1e189f08c [2022-04-28 02:56:19,622 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 02:56:19,623 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_1-1.c [2022-04-28 02:56:19,628 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33e120771/7ccd66ef2a6f4be89f60b8e2d731edfd/FLAG1e189f08c [2022-04-28 02:56:19,640 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33e120771/7ccd66ef2a6f4be89f60b8e2d731edfd [2022-04-28 02:56:19,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 02:56:19,645 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 02:56:19,646 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 02:56:19,646 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 02:56:19,649 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 02:56:19,649 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:56:19" (1/1) ... [2022-04-28 02:56:19,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e1f0094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:19, skipping insertion in model container [2022-04-28 02:56:19,650 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:56:19" (1/1) ... [2022-04-28 02:56:19,655 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 02:56:19,663 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 02:56:19,762 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_1-1.c[373,386] [2022-04-28 02:56:19,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:56:19,784 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 02:56:19,805 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_1-1.c[373,386] [2022-04-28 02:56:19,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:56:19,819 INFO L208 MainTranslator]: Completed translation [2022-04-28 02:56:19,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:19 WrapperNode [2022-04-28 02:56:19,820 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 02:56:19,820 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 02:56:19,820 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 02:56:19,820 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 02:56:19,827 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:19" (1/1) ... [2022-04-28 02:56:19,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:19" (1/1) ... [2022-04-28 02:56:19,846 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:19" (1/1) ... [2022-04-28 02:56:19,846 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:19" (1/1) ... [2022-04-28 02:56:19,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:19" (1/1) ... [2022-04-28 02:56:19,851 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:19" (1/1) ... [2022-04-28 02:56:19,852 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:19" (1/1) ... [2022-04-28 02:56:19,853 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 02:56:19,853 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 02:56:19,853 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 02:56:19,853 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 02:56:19,854 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:19" (1/1) ... [2022-04-28 02:56:19,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:56:19,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:19,872 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 02:56:19,887 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 02:56:19,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 02:56:19,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 02:56:19,906 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 02:56:19,906 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 02:56:19,906 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 02:56:19,906 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 02:56:19,906 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 02:56:19,906 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 02:56:19,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 02:56:19,907 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 02:56:19,907 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 02:56:19,907 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 02:56:19,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 02:56:19,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 02:56:19,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 02:56:19,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 02:56:19,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 02:56:19,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 02:56:19,954 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 02:56:19,956 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 02:56:20,084 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 02:56:20,105 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 02:56:20,105 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 02:56:20,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:56:20 BoogieIcfgContainer [2022-04-28 02:56:20,106 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 02:56:20,107 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 02:56:20,107 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 02:56:20,110 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 02:56:20,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:56:19" (1/3) ... [2022-04-28 02:56:20,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f892677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:56:20, skipping insertion in model container [2022-04-28 02:56:20,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:19" (2/3) ... [2022-04-28 02:56:20,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f892677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:56:20, skipping insertion in model container [2022-04-28 02:56:20,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:56:20" (3/3) ... [2022-04-28 02:56:20,112 INFO L111 eAbstractionObserver]: Analyzing ICFG diamond_1-1.c [2022-04-28 02:56:20,121 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 02:56:20,121 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 02:56:20,173 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 02:56:20,178 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@6babc7aa, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@26c1b70f [2022-04-28 02:56:20,178 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 02:56:20,183 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 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 02:56:20,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 02:56:20,188 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:20,188 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:20,189 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:20,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:20,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1418018830, now seen corresponding path program 1 times [2022-04-28 02:56:20,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:20,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2002379926] [2022-04-28 02:56:20,204 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:56:20,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1418018830, now seen corresponding path program 2 times [2022-04-28 02:56:20,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:20,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542651173] [2022-04-28 02:56:20,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:20,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:20,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:20,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:20,377 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {22#true} is VALID [2022-04-28 02:56:20,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-28 02:56:20,378 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #42#return; {22#true} is VALID [2022-04-28 02:56:20,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:20,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {22#true} is VALID [2022-04-28 02:56:20,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-28 02:56:20,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} #42#return; {22#true} is VALID [2022-04-28 02:56:20,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} call #t~ret6 := main(); {22#true} is VALID [2022-04-28 02:56:20,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {22#true} is VALID [2022-04-28 02:56:20,385 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#true} assume !true; {23#false} is VALID [2022-04-28 02:56:20,386 INFO L272 TraceCheckUtils]: 7: Hoare triple {23#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {23#false} is VALID [2022-04-28 02:56:20,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2022-04-28 02:56:20,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2022-04-28 02:56:20,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-04-28 02:56:20,387 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 02:56:20,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:20,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542651173] [2022-04-28 02:56:20,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542651173] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:20,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:20,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 02:56:20,391 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:20,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2002379926] [2022-04-28 02:56:20,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2002379926] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:20,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:20,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 02:56:20,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816067450] [2022-04-28 02:56:20,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:20,397 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 02:56:20,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:20,400 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 02:56:20,417 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 02:56:20,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 02:56:20,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:20,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 02:56:20,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 02:56:20,442 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 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 02:56:20,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:20,503 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-28 02:56:20,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 02:56:20,503 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 02:56:20,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:20,504 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 02:56:20,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-28 02:56:20,508 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 02:56:20,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-28 02:56:20,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2022-04-28 02:56:20,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:20,578 INFO L225 Difference]: With dead ends: 30 [2022-04-28 02:56:20,578 INFO L226 Difference]: Without dead ends: 13 [2022-04-28 02:56:20,580 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 02:56:20,582 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 22 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 02:56:20,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 22 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:56:20,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-28 02:56:20,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-28 02:56:20,609 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:20,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:20,611 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:20,612 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:20,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:20,620 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-28 02:56:20,620 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-28 02:56:20,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:20,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:20,621 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-28 02:56:20,621 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-28 02:56:20,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:20,624 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-28 02:56:20,624 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-28 02:56:20,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:20,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:20,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:20,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:20,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:20,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-04-28 02:56:20,628 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-04-28 02:56:20,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:20,628 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-04-28 02:56:20,629 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 02:56:20,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 14 transitions. [2022-04-28 02:56:20,646 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 02:56:20,647 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-28 02:56:20,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 02:56:20,649 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:20,652 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:20,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 02:56:20,653 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:20,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:20,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1427254040, now seen corresponding path program 1 times [2022-04-28 02:56:20,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:20,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2022242086] [2022-04-28 02:56:20,660 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:56:20,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1427254040, now seen corresponding path program 2 times [2022-04-28 02:56:20,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:20,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500953054] [2022-04-28 02:56:20,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:20,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:20,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:20,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:20,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {148#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {142#true} is VALID [2022-04-28 02:56:20,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {142#true} assume true; {142#true} is VALID [2022-04-28 02:56:20,789 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {142#true} {142#true} #42#return; {142#true} is VALID [2022-04-28 02:56:20,790 INFO L272 TraceCheckUtils]: 0: Hoare triple {142#true} call ULTIMATE.init(); {148#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:20,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {142#true} is VALID [2022-04-28 02:56:20,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {142#true} assume true; {142#true} is VALID [2022-04-28 02:56:20,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {142#true} {142#true} #42#return; {142#true} is VALID [2022-04-28 02:56:20,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {142#true} call #t~ret6 := main(); {142#true} is VALID [2022-04-28 02:56:20,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {142#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {147#(= main_~x~0 0)} is VALID [2022-04-28 02:56:20,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {147#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 99); {143#false} is VALID [2022-04-28 02:56:20,793 INFO L272 TraceCheckUtils]: 7: Hoare triple {143#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {143#false} is VALID [2022-04-28 02:56:20,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {143#false} ~cond := #in~cond; {143#false} is VALID [2022-04-28 02:56:20,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {143#false} assume 0 == ~cond; {143#false} is VALID [2022-04-28 02:56:20,793 INFO L290 TraceCheckUtils]: 10: Hoare triple {143#false} assume !false; {143#false} is VALID [2022-04-28 02:56:20,794 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 02:56:20,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:20,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500953054] [2022-04-28 02:56:20,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500953054] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:20,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:20,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:56:20,795 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:20,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2022242086] [2022-04-28 02:56:20,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2022242086] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:20,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:20,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:56:20,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601549782] [2022-04-28 02:56:20,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:20,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 02:56:20,797 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:20,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:20,809 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 02:56:20,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:56:20,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:20,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:56:20,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:56:20,811 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:20,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:20,880 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-28 02:56:20,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:56:20,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 02:56:20,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:20,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:20,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-04-28 02:56:20,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:20,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-04-28 02:56:20,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 22 transitions. [2022-04-28 02:56:20,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:20,950 INFO L225 Difference]: With dead ends: 20 [2022-04-28 02:56:20,951 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 02:56:20,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:56:20,954 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:20,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 18 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:56:20,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 02:56:20,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2022-04-28 02:56:20,963 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:20,963 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 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 02:56:20,963 INFO L74 IsIncluded]: Start isIncluded. First operand 15 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 02:56:20,964 INFO L87 Difference]: Start difference. First operand 15 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 02:56:20,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:20,965 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-28 02:56:20,965 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-28 02:56:20,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:20,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:20,966 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 15 states. [2022-04-28 02:56:20,966 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 15 states. [2022-04-28 02:56:20,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:20,967 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-28 02:56:20,967 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-28 02:56:20,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:20,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:20,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:20,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:20,968 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 02:56:20,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-28 02:56:20,969 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-28 02:56:20,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:20,970 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-28 02:56:20,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:20,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 15 transitions. [2022-04-28 02:56:20,983 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 02:56:20,984 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-28 02:56:20,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 02:56:20,984 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:20,985 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:20,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 02:56:20,986 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:20,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:20,987 INFO L85 PathProgramCache]: Analyzing trace with hash -397340509, now seen corresponding path program 1 times [2022-04-28 02:56:20,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:20,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1073664784] [2022-04-28 02:56:22,591 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:56:22,796 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-28 02:56:22,798 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:56:22,801 INFO L85 PathProgramCache]: Analyzing trace with hash -230057778, now seen corresponding path program 1 times [2022-04-28 02:56:22,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:22,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084076828] [2022-04-28 02:56:22,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:22,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:22,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:23,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:23,003 INFO L290 TraceCheckUtils]: 0: Hoare triple {261#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {251#true} is VALID [2022-04-28 02:56:23,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {251#true} assume true; {251#true} is VALID [2022-04-28 02:56:23,004 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {251#true} {251#true} #42#return; {251#true} is VALID [2022-04-28 02:56:23,004 INFO L272 TraceCheckUtils]: 0: Hoare triple {251#true} call ULTIMATE.init(); {261#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:23,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {261#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {251#true} is VALID [2022-04-28 02:56:23,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {251#true} assume true; {251#true} is VALID [2022-04-28 02:56:23,005 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {251#true} {251#true} #42#return; {251#true} is VALID [2022-04-28 02:56:23,005 INFO L272 TraceCheckUtils]: 4: Hoare triple {251#true} call #t~ret6 := main(); {251#true} is VALID [2022-04-28 02:56:23,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {251#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {256#(= main_~x~0 0)} is VALID [2022-04-28 02:56:23,007 INFO L290 TraceCheckUtils]: 6: Hoare triple {256#(= main_~x~0 0)} [46] L18-2-->L17-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_11 v_main_~x~0_10)) (.cse3 (< (mod v_main_~x~0_11 4294967296) 99)) (.cse2 (= (mod v_main_~y~0_6 2) 0)) (.cse1 (= |v_main_#t~post5_4| |v_main_#t~post5_3|))) (or (and .cse0 .cse1 (= v_main_~y~0_6 v_main_~y~0_6)) (and (not .cse2) .cse3 (<= (div (+ (* (- 1) v_main_~x~0_10) 99) (- 4294967296)) (+ (div (+ v_main_~x~0_11 (- 4294967295)) 4294967296) 1)) (< v_main_~x~0_11 v_main_~x~0_10)) (and .cse0 (or (not .cse3) .cse2) .cse1))) InVars {main_~y~0=v_main_~y~0_6, main_#t~post5=|v_main_#t~post5_4|, main_~x~0=v_main_~x~0_11} OutVars{main_#t~post5=|v_main_#t~post5_3|, main_~y~0=v_main_~y~0_6, main_~x~0=v_main_~x~0_10} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {257#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (or (not (<= (+ (* (div main_~y~0 2) 2) main_~x~0) (+ (div main_~x~0 2) main_~y~0 48 (* (div (+ (* (- 1) main_~x~0) 99) (- 4294967296)) 2147483648)))) (<= (+ main_~y~0 (* (div (+ (* (- 1) main_~x~0) 99) (- 4294967296)) 2147483648)) (+ (* (div main_~y~0 2) 2) 1))) (<= (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2))))} is VALID [2022-04-28 02:56:23,008 INFO L290 TraceCheckUtils]: 7: Hoare triple {257#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (or (not (<= (+ (* (div main_~y~0 2) 2) main_~x~0) (+ (div main_~x~0 2) main_~y~0 48 (* (div (+ (* (- 1) main_~x~0) 99) (- 4294967296)) 2147483648)))) (<= (+ main_~y~0 (* (div (+ (* (- 1) main_~x~0) 99) (- 4294967296)) 2147483648)) (+ (* (div main_~y~0 2) 2) 1))) (<= (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2))))} [45] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_5 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {258#(and (not (<= (+ (* (div main_~y~0 2) 2) main_~x~0) (+ (div main_~x~0 2) main_~y~0 48 (* (div (+ (* (- 1) main_~x~0) 99) (- 4294967296)) 2147483648)))) (<= (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2))) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2022-04-28 02:56:23,009 INFO L272 TraceCheckUtils]: 8: Hoare triple {258#(and (not (<= (+ (* (div main_~y~0 2) 2) main_~x~0) (+ (div main_~x~0 2) main_~y~0 48 (* (div (+ (* (- 1) main_~x~0) 99) (- 4294967296)) 2147483648)))) (<= (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2))) (< 0 (+ (div main_~x~0 4294967296) 1)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {259#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:56:23,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {259#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {260#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:56:23,010 INFO L290 TraceCheckUtils]: 10: Hoare triple {260#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {252#false} is VALID [2022-04-28 02:56:23,010 INFO L290 TraceCheckUtils]: 11: Hoare triple {252#false} assume !false; {252#false} is VALID [2022-04-28 02:56:23,011 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 02:56:23,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:23,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084076828] [2022-04-28 02:56:23,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084076828] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:23,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:23,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 02:56:23,111 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:23,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1073664784] [2022-04-28 02:56:23,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1073664784] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:23,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:23,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 02:56:23,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982623946] [2022-04-28 02:56:23,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:23,112 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 02:56:23,113 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:23,113 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:23,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:23,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 02:56:23,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:23,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 02:56:23,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-28 02:56:23,127 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:23,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:23,427 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-04-28 02:56:23,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 02:56:23,428 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 02:56:23,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:23,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:23,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2022-04-28 02:56:23,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:23,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2022-04-28 02:56:23,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 32 transitions. [2022-04-28 02:56:23,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:23,461 INFO L225 Difference]: With dead ends: 27 [2022-04-28 02:56:23,461 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 02:56:23,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-04-28 02:56:23,462 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 18 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:23,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 31 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:56:23,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 02:56:23,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 02:56:23,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:23,468 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:23,468 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:23,468 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:23,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:23,469 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-28 02:56:23,469 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 02:56:23,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:23,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:23,469 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 02:56:23,470 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 02:56:23,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:23,470 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-28 02:56:23,470 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 02:56:23,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:23,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:23,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:23,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:23,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:23,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-28 02:56:23,471 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2022-04-28 02:56:23,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:23,472 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-28 02:56:23,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:23,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-28 02:56:23,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:23,499 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 02:56:23,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 02:56:23,499 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:23,500 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:23,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 02:56:23,500 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:23,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:23,500 INFO L85 PathProgramCache]: Analyzing trace with hash -454598811, now seen corresponding path program 1 times [2022-04-28 02:56:23,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:23,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [894475863] [2022-04-28 02:56:23,743 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:56:23,745 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:56:23,747 INFO L85 PathProgramCache]: Analyzing trace with hash -170952434, now seen corresponding path program 1 times [2022-04-28 02:56:23,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:23,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713869455] [2022-04-28 02:56:23,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:23,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:23,757 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_2.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_2.0)) 4294967296)) 99) 0)) [2022-04-28 02:56:23,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:23,797 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_2.1) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_2.1)) 4294967296)) 99) 0)) [2022-04-28 02:56:23,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:23,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:23,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {403#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {393#true} is VALID [2022-04-28 02:56:23,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {393#true} assume true; {393#true} is VALID [2022-04-28 02:56:23,924 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {393#true} {393#true} #42#return; {393#true} is VALID [2022-04-28 02:56:23,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {393#true} call ULTIMATE.init(); {403#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:23,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {403#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {393#true} is VALID [2022-04-28 02:56:23,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {393#true} assume true; {393#true} is VALID [2022-04-28 02:56:23,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {393#true} {393#true} #42#return; {393#true} is VALID [2022-04-28 02:56:23,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {393#true} call #t~ret6 := main(); {393#true} is VALID [2022-04-28 02:56:23,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {393#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {398#(= main_~x~0 0)} is VALID [2022-04-28 02:56:23,927 INFO L290 TraceCheckUtils]: 6: Hoare triple {398#(= main_~x~0 0)} [48] L18-2-->L17-2_primed: Formula: (let ((.cse0 (= (mod v_main_~y~0_8 2) 0)) (.cse1 (< (mod v_main_~x~0_18 4294967296) 99)) (.cse2 (= v_main_~x~0_18 v_main_~x~0_17))) (or (and (or (not .cse0) (not .cse1)) .cse2) (and (< 0 (div (+ v_main_~x~0_18 (* (- 1) v_main_~x~0_17)) (- 2))) (= (mod (+ v_main_~x~0_18 v_main_~x~0_17) 2) 0) .cse0 (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (not (<= (+ v_it_2 1) (div (+ v_main_~x~0_18 (* (- 1) v_main_~x~0_17)) (- 2)))) (< (mod (+ v_main_~x~0_18 (* v_it_2 2)) 4294967296) 99))) .cse1) (and .cse2 (= v_main_~y~0_8 v_main_~y~0_8)))) InVars {main_~x~0=v_main_~x~0_18, main_~y~0=v_main_~y~0_8} OutVars{main_~x~0=v_main_~x~0_17, main_~y~0=v_main_~y~0_8} AuxVars[] AssignedVars[main_~x~0] {399#(or (= main_~x~0 0) (and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1))))} is VALID [2022-04-28 02:56:23,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {399#(or (= main_~x~0 0) (and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1))))} [47] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_5 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {400#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 02:56:23,928 INFO L272 TraceCheckUtils]: 8: Hoare triple {400#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {401#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:56:23,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {401#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {402#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:56:23,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {402#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {394#false} is VALID [2022-04-28 02:56:23,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {394#false} assume !false; {394#false} is VALID [2022-04-28 02:56:23,930 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 02:56:23,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:23,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713869455] [2022-04-28 02:56:23,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713869455] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:23,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:23,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 02:56:24,195 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:24,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [894475863] [2022-04-28 02:56:24,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [894475863] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:24,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:24,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 02:56:24,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149164265] [2022-04-28 02:56:24,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:24,196 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 02:56:24,196 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:24,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:24,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:24,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 02:56:24,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:24,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 02:56:24,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-28 02:56:24,211 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:24,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:24,314 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-28 02:56:24,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 02:56:24,314 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 02:56:24,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:24,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:24,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-28 02:56:24,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:24,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-28 02:56:24,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 23 transitions. [2022-04-28 02:56:24,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:24,366 INFO L225 Difference]: With dead ends: 22 [2022-04-28 02:56:24,366 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 02:56:24,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-04-28 02:56:24,367 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:24,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 36 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 17 Unchecked, 0.0s Time] [2022-04-28 02:56:24,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 02:56:24,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 02:56:24,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:24,379 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 02:56:24,379 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 02:56:24,380 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 02:56:24,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:24,380 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 02:56:24,380 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 02:56:24,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:24,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:24,381 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 02:56:24,381 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 02:56:24,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:24,382 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 02:56:24,382 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 02:56:24,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:24,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:24,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:24,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:24,382 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 02:56:24,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-28 02:56:24,383 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2022-04-28 02:56:24,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:24,383 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-28 02:56:24,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:24,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-28 02:56:24,409 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 02:56:24,409 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 02:56:24,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 02:56:24,409 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:24,409 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:24,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 02:56:24,410 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:24,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:24,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1978535968, now seen corresponding path program 1 times [2022-04-28 02:56:24,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:24,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [224217128] [2022-04-28 02:56:24,575 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:56:26,491 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:56:26,648 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-28 02:56:26,649 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:56:26,652 INFO L85 PathProgramCache]: Analyzing trace with hash 2055943693, now seen corresponding path program 1 times [2022-04-28 02:56:26,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:26,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462797251] [2022-04-28 02:56:26,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:26,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:26,660 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_3.0) (* (- 1) main_~x~0_5) (* 4294967296 (div (+ (* 2 .v_it_3.0) main_~x~0_5) 4294967296)) 99) 0)) [2022-04-28 02:56:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:26,685 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_3.2) (* (- 1) main_~x~0_5) (* 4294967296 (div (+ (* 2 .v_it_3.2) main_~x~0_5) 4294967296)) 99) 0)) [2022-04-28 02:56:26,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:26,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:26,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {538#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {527#true} is VALID [2022-04-28 02:56:26,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {527#true} assume true; {527#true} is VALID [2022-04-28 02:56:26,856 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {527#true} {527#true} #42#return; {527#true} is VALID [2022-04-28 02:56:26,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {527#true} call ULTIMATE.init(); {538#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:26,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {538#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {527#true} is VALID [2022-04-28 02:56:26,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {527#true} assume true; {527#true} is VALID [2022-04-28 02:56:26,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {527#true} {527#true} #42#return; {527#true} is VALID [2022-04-28 02:56:26,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {527#true} call #t~ret6 := main(); {527#true} is VALID [2022-04-28 02:56:26,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {527#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {532#(= main_~x~0 0)} is VALID [2022-04-28 02:56:26,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {532#(= main_~x~0 0)} [50] L18-2-->L17-2_primed: Formula: (let ((.cse0 (< (mod v_main_~x~0_25 4294967296) 99)) (.cse1 (= (mod v_main_~y~0_10 2) 0)) (.cse2 (= v_main_~x~0_25 v_main_~x~0_24))) (or (and (or (not .cse0) (not .cse1)) .cse2) (and (= 0 (mod (+ v_main_~x~0_25 v_main_~x~0_24) 2)) (< 0 (div (+ v_main_~x~0_25 (* (- 1) v_main_~x~0_24)) (- 2))) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< (mod (+ (* v_it_3 2) v_main_~x~0_25) 4294967296) 99) (not (<= (+ v_it_3 1) (div (+ v_main_~x~0_25 (* (- 1) v_main_~x~0_24)) (- 2)))))) .cse0 .cse1) (and (= v_main_~y~0_10 v_main_~y~0_10) .cse2))) InVars {main_~x~0=v_main_~x~0_25, main_~y~0=v_main_~y~0_10} OutVars{main_~x~0=v_main_~x~0_24, main_~y~0=v_main_~y~0_10} AuxVars[] AssignedVars[main_~x~0] {533#(or (= main_~x~0 0) (and (<= (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2))) (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)))} is VALID [2022-04-28 02:56:26,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {533#(or (= main_~x~0 0) (and (<= (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2))) (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)))} [51] L17-2_primed-->L18-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {533#(or (= main_~x~0 0) (and (<= (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2))) (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)))} is VALID [2022-04-28 02:56:26,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {533#(or (= main_~x~0 0) (and (<= (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2))) (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)))} [52] L18-2-->L17-2_primed: Formula: (let ((.cse1 (= (mod v_main_~y~0_11 2) 0)) (.cse0 (< (mod v_main_~x~0_27 4294967296) 99)) (.cse2 (= |v_main_#t~post5_9| |v_main_#t~post5_8|)) (.cse3 (= v_main_~x~0_27 v_main_~x~0_26))) (or (and .cse0 (< v_main_~x~0_27 v_main_~x~0_26) (<= (div (+ (* (- 1) v_main_~x~0_26) 99) (- 4294967296)) (+ (div (+ v_main_~x~0_27 (- 4294967295)) 4294967296) 1)) (not .cse1)) (and (= v_main_~y~0_11 v_main_~y~0_11) .cse2 .cse3) (and (or .cse1 (not .cse0)) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_11, main_#t~post5=|v_main_#t~post5_9|, main_~x~0=v_main_~x~0_27} OutVars{main_#t~post5=|v_main_#t~post5_8|, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_26} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {534#(or (and (not (<= (+ main_~y~0 (* (div main_~x~0 2) 2) 1) (+ (* (div main_~y~0 2) 2) main_~x~0))) (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= (+ main_~y~0 (* (div (+ (* (- 1) main_~x~0) 99) (- 4294967296)) 2147483648)) (+ (* (div main_~y~0 2) 2) 1))) (and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1))))} is VALID [2022-04-28 02:56:26,863 INFO L290 TraceCheckUtils]: 9: Hoare triple {534#(or (and (not (<= (+ main_~y~0 (* (div main_~x~0 2) 2) 1) (+ (* (div main_~y~0 2) 2) main_~x~0))) (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= (+ main_~y~0 (* (div (+ (* (- 1) main_~x~0) 99) (- 4294967296)) 2147483648)) (+ (* (div main_~y~0 2) 2) 1))) (and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1))))} [49] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_5 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {535#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 02:56:26,864 INFO L272 TraceCheckUtils]: 10: Hoare triple {535#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {536#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:56:26,864 INFO L290 TraceCheckUtils]: 11: Hoare triple {536#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {537#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:56:26,864 INFO L290 TraceCheckUtils]: 12: Hoare triple {537#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {528#false} is VALID [2022-04-28 02:56:26,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {528#false} assume !false; {528#false} is VALID [2022-04-28 02:56:26,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:26,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:26,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462797251] [2022-04-28 02:56:26,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462797251] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:26,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032289894] [2022-04-28 02:56:26,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:26,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:26,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:26,891 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:26,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 02:56:26,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:26,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 02:56:26,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:26,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:29,304 INFO L272 TraceCheckUtils]: 0: Hoare triple {527#true} call ULTIMATE.init(); {527#true} is VALID [2022-04-28 02:56:29,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {527#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {527#true} is VALID [2022-04-28 02:56:29,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {527#true} assume true; {527#true} is VALID [2022-04-28 02:56:29,304 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {527#true} {527#true} #42#return; {527#true} is VALID [2022-04-28 02:56:29,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {527#true} call #t~ret6 := main(); {527#true} is VALID [2022-04-28 02:56:29,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {527#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {532#(= main_~x~0 0)} is VALID [2022-04-28 02:56:29,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {532#(= main_~x~0 0)} [50] L18-2-->L17-2_primed: Formula: (let ((.cse0 (< (mod v_main_~x~0_25 4294967296) 99)) (.cse1 (= (mod v_main_~y~0_10 2) 0)) (.cse2 (= v_main_~x~0_25 v_main_~x~0_24))) (or (and (or (not .cse0) (not .cse1)) .cse2) (and (= 0 (mod (+ v_main_~x~0_25 v_main_~x~0_24) 2)) (< 0 (div (+ v_main_~x~0_25 (* (- 1) v_main_~x~0_24)) (- 2))) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< (mod (+ (* v_it_3 2) v_main_~x~0_25) 4294967296) 99) (not (<= (+ v_it_3 1) (div (+ v_main_~x~0_25 (* (- 1) v_main_~x~0_24)) (- 2)))))) .cse0 .cse1) (and (= v_main_~y~0_10 v_main_~y~0_10) .cse2))) InVars {main_~x~0=v_main_~x~0_25, main_~y~0=v_main_~y~0_10} OutVars{main_~x~0=v_main_~x~0_24, main_~y~0=v_main_~y~0_10} AuxVars[] AssignedVars[main_~x~0] {560#(or (and (< 0 (div (* (- 1) main_~x~0) (- 2))) (= (mod main_~y~0 2) 0) (= (mod main_~x~0 2) 0) (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) (div (* (- 1) main_~x~0) (- 2)))) (not (<= 1 v_it_3)) (< (mod (* v_it_3 2) 4294967296) 99)))) (= main_~x~0 0))} is VALID [2022-04-28 02:56:29,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {560#(or (and (< 0 (div (* (- 1) main_~x~0) (- 2))) (= (mod main_~y~0 2) 0) (= (mod main_~x~0 2) 0) (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) (div (* (- 1) main_~x~0) (- 2)))) (not (<= 1 v_it_3)) (< (mod (* v_it_3 2) 4294967296) 99)))) (= main_~x~0 0))} [51] L17-2_primed-->L18-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {560#(or (and (< 0 (div (* (- 1) main_~x~0) (- 2))) (= (mod main_~y~0 2) 0) (= (mod main_~x~0 2) 0) (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) (div (* (- 1) main_~x~0) (- 2)))) (not (<= 1 v_it_3)) (< (mod (* v_it_3 2) 4294967296) 99)))) (= main_~x~0 0))} is VALID [2022-04-28 02:56:29,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {560#(or (and (< 0 (div (* (- 1) main_~x~0) (- 2))) (= (mod main_~y~0 2) 0) (= (mod main_~x~0 2) 0) (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) (div (* (- 1) main_~x~0) (- 2)))) (not (<= 1 v_it_3)) (< (mod (* v_it_3 2) 4294967296) 99)))) (= main_~x~0 0))} [52] L18-2-->L17-2_primed: Formula: (let ((.cse1 (= (mod v_main_~y~0_11 2) 0)) (.cse0 (< (mod v_main_~x~0_27 4294967296) 99)) (.cse2 (= |v_main_#t~post5_9| |v_main_#t~post5_8|)) (.cse3 (= v_main_~x~0_27 v_main_~x~0_26))) (or (and .cse0 (< v_main_~x~0_27 v_main_~x~0_26) (<= (div (+ (* (- 1) v_main_~x~0_26) 99) (- 4294967296)) (+ (div (+ v_main_~x~0_27 (- 4294967295)) 4294967296) 1)) (not .cse1)) (and (= v_main_~y~0_11 v_main_~y~0_11) .cse2 .cse3) (and (or .cse1 (not .cse0)) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_11, main_#t~post5=|v_main_#t~post5_9|, main_~x~0=v_main_~x~0_27} OutVars{main_#t~post5=|v_main_#t~post5_8|, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_26} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {567#(or (and (< 0 (div (* (- 1) main_~x~0) (- 2))) (= (mod main_~y~0 2) 0) (= (mod main_~x~0 2) 0) (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) (div (* (- 1) main_~x~0) (- 2)))) (not (<= 1 v_it_3)) (< (mod (* v_it_3 2) 4294967296) 99)))) (= main_~x~0 0) (and (<= (div (+ (* (- 1) main_~x~0) 99) (- 4294967296)) 0) (not (= (mod main_~y~0 2) 0)) (< 0 main_~x~0)))} is VALID [2022-04-28 02:56:29,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {567#(or (and (< 0 (div (* (- 1) main_~x~0) (- 2))) (= (mod main_~y~0 2) 0) (= (mod main_~x~0 2) 0) (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) (div (* (- 1) main_~x~0) (- 2)))) (not (<= 1 v_it_3)) (< (mod (* v_it_3 2) 4294967296) 99)))) (= main_~x~0 0) (and (<= (div (+ (* (- 1) main_~x~0) 99) (- 4294967296)) 0) (not (= (mod main_~y~0 2) 0)) (< 0 main_~x~0)))} [49] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_5 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {571#(and (or (and (< 0 (div (* (- 1) main_~x~0) (- 2))) (= (mod main_~y~0 2) 0) (= (mod main_~x~0 2) 0) (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) (div (* (- 1) main_~x~0) (- 2)))) (not (<= 1 v_it_3)) (< (mod (* v_it_3 2) 4294967296) 99)))) (and (<= (div (+ (* (- 1) main_~x~0) 99) (- 4294967296)) 0) (not (= (mod main_~y~0 2) 0)) (< 0 main_~x~0))) (not (< (mod main_~x~0 4294967296) 99)))} is VALID [2022-04-28 02:56:29,312 INFO L272 TraceCheckUtils]: 10: Hoare triple {571#(and (or (and (< 0 (div (* (- 1) main_~x~0) (- 2))) (= (mod main_~y~0 2) 0) (= (mod main_~x~0 2) 0) (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) (div (* (- 1) main_~x~0) (- 2)))) (not (<= 1 v_it_3)) (< (mod (* v_it_3 2) 4294967296) 99)))) (and (<= (div (+ (* (- 1) main_~x~0) 99) (- 4294967296)) 0) (not (= (mod main_~y~0 2) 0)) (< 0 main_~x~0))) (not (< (mod main_~x~0 4294967296) 99)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {575#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:56:29,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {575#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {579#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:56:29,312 INFO L290 TraceCheckUtils]: 12: Hoare triple {579#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {528#false} is VALID [2022-04-28 02:56:29,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {528#false} assume !false; {528#false} is VALID [2022-04-28 02:56:29,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:29,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:38,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {528#false} assume !false; {528#false} is VALID [2022-04-28 02:56:38,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {579#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {528#false} is VALID [2022-04-28 02:56:38,641 INFO L290 TraceCheckUtils]: 11: Hoare triple {575#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {579#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:56:38,643 INFO L272 TraceCheckUtils]: 10: Hoare triple {535#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {575#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:56:38,643 INFO L290 TraceCheckUtils]: 9: Hoare triple {598#(or (< (mod main_~x~0 4294967296) 99) (and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1))))} [49] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_5 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {535#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 02:56:38,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {598#(or (< (mod main_~x~0 4294967296) 99) (and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1))))} [52] L18-2-->L17-2_primed: Formula: (let ((.cse1 (= (mod v_main_~y~0_11 2) 0)) (.cse0 (< (mod v_main_~x~0_27 4294967296) 99)) (.cse2 (= |v_main_#t~post5_9| |v_main_#t~post5_8|)) (.cse3 (= v_main_~x~0_27 v_main_~x~0_26))) (or (and .cse0 (< v_main_~x~0_27 v_main_~x~0_26) (<= (div (+ (* (- 1) v_main_~x~0_26) 99) (- 4294967296)) (+ (div (+ v_main_~x~0_27 (- 4294967295)) 4294967296) 1)) (not .cse1)) (and (= v_main_~y~0_11 v_main_~y~0_11) .cse2 .cse3) (and (or .cse1 (not .cse0)) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_11, main_#t~post5=|v_main_#t~post5_9|, main_~x~0=v_main_~x~0_27} OutVars{main_#t~post5=|v_main_#t~post5_8|, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_26} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {598#(or (< (mod main_~x~0 4294967296) 99) (and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1))))} is VALID [2022-04-28 02:56:38,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {598#(or (< (mod main_~x~0 4294967296) 99) (and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1))))} [51] L17-2_primed-->L18-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {598#(or (< (mod main_~x~0 4294967296) 99) (and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1))))} is VALID [2022-04-28 02:56:40,670 WARN L290 TraceCheckUtils]: 6: Hoare triple {608#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (forall ((aux_div_aux_mod_aux_mod_v_main_~x~0_37_31_78_58 Int) (aux_div_v_main_~x~0_37_31 Int) (aux_div_aux_mod_v_main_~x~0_37_31_78 Int)) (or (<= (+ main_~x~0 (* aux_div_v_main_~x~0_37_31 4294967296) 4294967296) (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_37_31_78_58 2) (* 2 aux_div_aux_mod_v_main_~x~0_37_31_78))) (<= (+ aux_div_aux_mod_aux_mod_v_main_~x~0_37_31_78_58 aux_div_aux_mod_v_main_~x~0_37_31_78) main_~x~0) (<= (+ main_~x~0 2) (* aux_div_aux_mod_aux_mod_v_main_~x~0_37_31_78_58 2)) (< (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_37_31_78_58 2) (* 2 aux_div_aux_mod_v_main_~x~0_37_31_78)) (+ main_~x~0 (* aux_div_v_main_~x~0_37_31 4294967296) 99)) (< (* aux_div_aux_mod_aux_mod_v_main_~x~0_37_31_78_58 2) (+ main_~x~0 1)) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 main_~x~0 1) (+ aux_div_aux_mod_aux_mod_v_main_~x~0_37_31_78_58 aux_div_aux_mod_v_main_~x~0_37_31_78)) (<= 1 v_it_3) (not (< (mod (+ (* v_it_3 2) main_~x~0) 4294967296) 99)))))))} [50] L18-2-->L17-2_primed: Formula: (let ((.cse0 (< (mod v_main_~x~0_25 4294967296) 99)) (.cse1 (= (mod v_main_~y~0_10 2) 0)) (.cse2 (= v_main_~x~0_25 v_main_~x~0_24))) (or (and (or (not .cse0) (not .cse1)) .cse2) (and (= 0 (mod (+ v_main_~x~0_25 v_main_~x~0_24) 2)) (< 0 (div (+ v_main_~x~0_25 (* (- 1) v_main_~x~0_24)) (- 2))) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< (mod (+ (* v_it_3 2) v_main_~x~0_25) 4294967296) 99) (not (<= (+ v_it_3 1) (div (+ v_main_~x~0_25 (* (- 1) v_main_~x~0_24)) (- 2)))))) .cse0 .cse1) (and (= v_main_~y~0_10 v_main_~y~0_10) .cse2))) InVars {main_~x~0=v_main_~x~0_25, main_~y~0=v_main_~y~0_10} OutVars{main_~x~0=v_main_~x~0_24, main_~y~0=v_main_~y~0_10} AuxVars[] AssignedVars[main_~x~0] {598#(or (< (mod main_~x~0 4294967296) 99) (and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1))))} is UNKNOWN [2022-04-28 02:56:40,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {527#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {608#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (forall ((aux_div_aux_mod_aux_mod_v_main_~x~0_37_31_78_58 Int) (aux_div_v_main_~x~0_37_31 Int) (aux_div_aux_mod_v_main_~x~0_37_31_78 Int)) (or (<= (+ main_~x~0 (* aux_div_v_main_~x~0_37_31 4294967296) 4294967296) (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_37_31_78_58 2) (* 2 aux_div_aux_mod_v_main_~x~0_37_31_78))) (<= (+ aux_div_aux_mod_aux_mod_v_main_~x~0_37_31_78_58 aux_div_aux_mod_v_main_~x~0_37_31_78) main_~x~0) (<= (+ main_~x~0 2) (* aux_div_aux_mod_aux_mod_v_main_~x~0_37_31_78_58 2)) (< (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_37_31_78_58 2) (* 2 aux_div_aux_mod_v_main_~x~0_37_31_78)) (+ main_~x~0 (* aux_div_v_main_~x~0_37_31 4294967296) 99)) (< (* aux_div_aux_mod_aux_mod_v_main_~x~0_37_31_78_58 2) (+ main_~x~0 1)) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 main_~x~0 1) (+ aux_div_aux_mod_aux_mod_v_main_~x~0_37_31_78_58 aux_div_aux_mod_v_main_~x~0_37_31_78)) (<= 1 v_it_3) (not (< (mod (+ (* v_it_3 2) main_~x~0) 4294967296) 99)))))))} is VALID [2022-04-28 02:56:40,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {527#true} call #t~ret6 := main(); {527#true} is VALID [2022-04-28 02:56:40,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {527#true} {527#true} #42#return; {527#true} is VALID [2022-04-28 02:56:40,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {527#true} assume true; {527#true} is VALID [2022-04-28 02:56:40,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {527#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {527#true} is VALID [2022-04-28 02:56:40,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {527#true} call ULTIMATE.init(); {527#true} is VALID [2022-04-28 02:56:40,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 02:56:40,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032289894] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:40,677 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:40,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 16 [2022-04-28 02:56:41,256 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:41,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [224217128] [2022-04-28 02:56:41,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [224217128] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:41,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:41,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 02:56:41,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213075281] [2022-04-28 02:56:41,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:41,257 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 02:56:41,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:41,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:41,277 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 02:56:41,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 02:56:41,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:41,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 02:56:41,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=260, Unknown=1, NotChecked=0, Total=342 [2022-04-28 02:56:41,278 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:41,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:41,355 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 02:56:41,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 02:56:41,356 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 02:56:41,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:41,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:41,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2022-04-28 02:56:41,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:41,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2022-04-28 02:56:41,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 19 transitions. [2022-04-28 02:56:41,420 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 02:56:41,421 INFO L225 Difference]: With dead ends: 17 [2022-04-28 02:56:41,421 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 02:56:41,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=89, Invalid=290, Unknown=1, NotChecked=0, Total=380 [2022-04-28 02:56:41,422 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 1 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:41,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 28 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 4 Unchecked, 0.0s Time] [2022-04-28 02:56:41,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 02:56:41,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 02:56:41,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:41,422 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 02:56:41,422 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 02:56:41,422 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 02:56:41,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:41,423 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 02:56:41,423 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 02:56:41,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:41,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:41,423 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 02:56:41,423 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 02:56:41,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:41,424 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 02:56:41,424 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 02:56:41,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:41,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:41,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:41,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:41,424 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 02:56:41,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 02:56:41,424 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2022-04-28 02:56:41,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:41,424 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 02:56:41,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:41,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 02:56:41,425 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 02:56:41,425 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 02:56:41,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:41,430 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 02:56:41,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 02:56:41,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:41,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 02:56:42,047 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-28 02:56:42,048 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-28 02:56:42,048 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-28 02:56:42,048 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 13 26) the Hoare annotation is: true [2022-04-28 02:56:42,048 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 13 26) the Hoare annotation is: true [2022-04-28 02:56:42,048 INFO L895 garLoopResultBuilder]: At program point L18(lines 18 22) the Hoare annotation is: (let ((.cse1 (* (- 1) main_~x~0)) (.cse0 (< (mod main_~x~0 4294967296) 99))) (or (= main_~x~0 0) (and .cse0 (or (and (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< (mod (* v_it_3 2) 4294967296) 99) (not (<= (+ v_it_3 1) (div (+ 2 (* (- 1) main_~x~0)) (- 2)))))) (< 0 (div (+ 2 .cse1) (- 2))) (= (mod main_~x~0 2) 0)) (= main_~x~0 2))) (and (not (= (mod main_~y~0 2) 0)) (or (= main_~x~0 1) (and (< 1 main_~x~0) (<= (div (+ .cse1 100) (- 4294967296)) 0))) .cse0))) [2022-04-28 02:56:42,048 INFO L895 garLoopResultBuilder]: At program point L18-2(lines 17 23) the Hoare annotation is: (let ((.cse0 (= (mod main_~y~0 2) 0)) (.cse1 (* (- 1) main_~x~0))) (or (= main_~x~0 0) (and (< (mod (+ main_~x~0 4294967294) 4294967296) 99) .cse0 (or (and (< 0 (div (+ 2 .cse1) (- 2))) (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (< (mod (* v_it_2 2) 4294967296) 99) (not (<= (+ v_it_2 1) (div (+ 2 (* (- 1) main_~x~0)) (- 2)))))) (= (mod main_~x~0 2) 0)) (= main_~x~0 2))) (and (not .cse0) (or (= main_~x~0 1) (and (< 1 main_~x~0) (<= (div (+ .cse1 100) (- 4294967296)) 0))) (< (mod (+ main_~x~0 4294967295) 4294967296) 99)))) [2022-04-28 02:56:42,048 INFO L895 garLoopResultBuilder]: At program point L17-2(lines 17 23) the Hoare annotation is: (let ((.cse1 (+ (* (div main_~y~0 2) 2) main_~x~0)) (.cse0 (* (div main_~x~0 2) 2))) (and (<= (+ main_~y~0 .cse0) .cse1) (< .cse1 (+ main_~y~0 .cse0 1)))) [2022-04-28 02:56:42,048 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 13 26) the Hoare annotation is: true [2022-04-28 02:56:42,049 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 02:56:42,049 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 02:56:42,049 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 02:56:42,049 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 02:56:42,049 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 02:56:42,049 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 02:56:42,049 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 02:56:42,049 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2022-04-28 02:56:42,049 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: true [2022-04-28 02:56:42,049 INFO L895 garLoopResultBuilder]: At program point L8(line 8) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 02:56:42,049 INFO L895 garLoopResultBuilder]: At program point L7(lines 7 9) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 02:56:42,049 INFO L902 garLoopResultBuilder]: At program point L7-2(lines 6 11) the Hoare annotation is: true [2022-04-28 02:56:42,049 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 02:56:42,051 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:42,053 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 02:56:42,069 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 02:56:42,072 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 02:56:42,104 INFO L163 areAnnotationChecker]: CFG has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 02:56:42,109 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_2,QUANTIFIED] [2022-04-28 02:56:42,109 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_2,QUANTIFIED] [2022-04-28 02:56:42,110 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_2,QUANTIFIED] [2022-04-28 02:56:42,112 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_2,QUANTIFIED] [2022-04-28 02:56:42,112 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_2,QUANTIFIED] [2022-04-28 02:56:42,112 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_2,QUANTIFIED] [2022-04-28 02:56:42,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 02:56:42 BoogieIcfgContainer [2022-04-28 02:56:42,120 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 02:56:42,122 INFO L158 Benchmark]: Toolchain (without parser) took 22475.85ms. Allocated memory was 218.1MB in the beginning and 332.4MB in the end (delta: 114.3MB). Free memory was 169.0MB in the beginning and 235.3MB in the end (delta: -66.4MB). Peak memory consumption was 49.3MB. Max. memory is 8.0GB. [2022-04-28 02:56:42,123 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 218.1MB. Free memory is still 185.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 02:56:42,123 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.02ms. Allocated memory is still 218.1MB. Free memory was 168.6MB in the beginning and 195.0MB in the end (delta: -26.4MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. [2022-04-28 02:56:42,124 INFO L158 Benchmark]: Boogie Preprocessor took 32.53ms. Allocated memory is still 218.1MB. Free memory was 195.0MB in the beginning and 193.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 02:56:42,124 INFO L158 Benchmark]: RCFGBuilder took 253.14ms. Allocated memory is still 218.1MB. Free memory was 193.4MB in the beginning and 182.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 02:56:42,124 INFO L158 Benchmark]: TraceAbstraction took 22012.85ms. Allocated memory was 218.1MB in the beginning and 332.4MB in the end (delta: 114.3MB). Free memory was 182.4MB in the beginning and 235.3MB in the end (delta: -52.9MB). Peak memory consumption was 62.8MB. Max. memory is 8.0GB. [2022-04-28 02:56:42,125 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.10ms. Allocated memory is still 218.1MB. Free memory is still 185.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 174.02ms. Allocated memory is still 218.1MB. Free memory was 168.6MB in the beginning and 195.0MB in the end (delta: -26.4MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.53ms. Allocated memory is still 218.1MB. Free memory was 195.0MB in the beginning and 193.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 253.14ms. Allocated memory is still 218.1MB. Free memory was 193.4MB in the beginning and 182.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 22012.85ms. Allocated memory was 218.1MB in the beginning and 332.4MB in the end (delta: 114.3MB). Free memory was 182.4MB in the beginning and 235.3MB in the end (delta: -52.9MB). Peak memory consumption was 62.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_2,QUANTIFIED] * 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: 8]: 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, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.9s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 47 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46 mSDsluCounter, 135 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 21 IncrementalHoareTripleChecker+Unchecked, 81 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 90 IncrementalHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 54 mSDtfsCounter, 90 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 49 PreInvPairs, 71 NumberOfFragments, 240 HoareAnnotationTreeSize, 49 FomulaSimplifications, 119 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 19 FomulaSimplificationsInter, 269 FormulaSimplificationTreeSizeReductionInter, 0.4s 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: 17]: Loop Invariant [2022-04-28 02:56:42,129 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_2,QUANTIFIED] [2022-04-28 02:56:42,129 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_2,QUANTIFIED] [2022-04-28 02:56:42,129 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_2,QUANTIFIED] [2022-04-28 02:56:42,129 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_2,QUANTIFIED] [2022-04-28 02:56:42,129 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_2,QUANTIFIED] [2022-04-28 02:56:42,129 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_2,QUANTIFIED] Derived loop invariant: (x == 0 || (((x + 4294967294) % 4294967296 < 99 && y % 2 == 0) && (((0 < (2 + -1 * x) / -2 && (forall v_it_2 : int :: (!(1 <= v_it_2) || v_it_2 * 2 % 4294967296 < 99) || !(v_it_2 + 1 <= (2 + -1 * x) / -2))) && x % 2 == 0) || x == 2))) || ((!(y % 2 == 0) && (x == 1 || (1 < x && (-1 * x + 100) / -4294967296 <= 0))) && (x + 4294967295) % 4294967296 < 99) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-28 02:56:42,142 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...