/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/overflow_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 05:57:40,938 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 05:57:40,939 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 05:57:40,978 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 05:57:40,979 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 05:57:40,979 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 05:57:40,981 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 05:57:40,983 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 05:57:40,984 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 05:57:40,987 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 05:57:40,988 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 05:57:40,989 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 05:57:40,989 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 05:57:40,991 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 05:57:40,991 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 05:57:40,993 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 05:57:40,994 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 05:57:40,994 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 05:57:40,996 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 05:57:40,999 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 05:57:41,001 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 05:57:41,001 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 05:57:41,002 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 05:57:41,002 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 05:57:41,003 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 05:57:41,008 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 05:57:41,008 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 05:57:41,008 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 05:57:41,009 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 05:57:41,009 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 05:57:41,010 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 05:57:41,010 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 05:57:41,011 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 05:57:41,011 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 05:57:41,012 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 05:57:41,012 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 05:57:41,012 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 05:57:41,013 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 05:57:41,013 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 05:57:41,013 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 05:57:41,013 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 05:57:41,015 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 05:57:41,015 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 05:57:41,023 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 05:57:41,023 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 05:57:41,024 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 05:57:41,024 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 05:57:41,024 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 05:57:41,025 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 05:57:41,025 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 05:57:41,025 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 05:57:41,025 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 05:57:41,025 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 05:57:41,025 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 05:57:41,025 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 05:57:41,026 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 05:57:41,026 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 05:57:41,026 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 05:57:41,026 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 05:57:41,026 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 05:57:41,026 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 05:57:41,026 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:57:41,026 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 05:57:41,026 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 05:57:41,026 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 05:57:41,026 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 05:57:41,026 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 05:57:41,027 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 05:57:41,027 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 05:57:41,217 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 05:57:41,241 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 05:57:41,243 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 05:57:41,243 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 05:57:41,244 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 05:57:41,245 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/overflow_1-1.c [2022-04-15 05:57:41,299 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/267e55c12/25efc67682b145fd9bda84416c9749de/FLAG8bb670ec9 [2022-04-15 05:57:41,653 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 05:57:41,654 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/overflow_1-1.c [2022-04-15 05:57:41,658 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/267e55c12/25efc67682b145fd9bda84416c9749de/FLAG8bb670ec9 [2022-04-15 05:57:41,666 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/267e55c12/25efc67682b145fd9bda84416c9749de [2022-04-15 05:57:41,668 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 05:57:41,669 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 05:57:41,670 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 05:57:41,670 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 05:57:41,672 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 05:57:41,672 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:57:41" (1/1) ... [2022-04-15 05:57:41,673 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4068d20a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:57:41, skipping insertion in model container [2022-04-15 05:57:41,673 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:57:41" (1/1) ... [2022-04-15 05:57:41,677 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 05:57:41,684 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 05:57:41,773 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/overflow_1-1.c[324,337] [2022-04-15 05:57:41,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:57:41,793 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 05:57:41,803 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/overflow_1-1.c[324,337] [2022-04-15 05:57:41,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:57:41,840 INFO L208 MainTranslator]: Completed translation [2022-04-15 05:57:41,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:57:41 WrapperNode [2022-04-15 05:57:41,841 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 05:57:41,842 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 05:57:41,842 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 05:57:41,842 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 05:57:41,850 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:57:41" (1/1) ... [2022-04-15 05:57:41,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:57:41" (1/1) ... [2022-04-15 05:57:41,856 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:57:41" (1/1) ... [2022-04-15 05:57:41,856 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:57:41" (1/1) ... [2022-04-15 05:57:41,863 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:57:41" (1/1) ... [2022-04-15 05:57:41,866 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:57:41" (1/1) ... [2022-04-15 05:57:41,870 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:57:41" (1/1) ... [2022-04-15 05:57:41,872 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 05:57:41,873 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 05:57:41,873 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 05:57:41,873 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 05:57:41,874 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:57:41" (1/1) ... [2022-04-15 05:57:41,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:57:41,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:57:41,904 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 05:57:41,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 05:57:41,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 05:57:41,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 05:57:41,931 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 05:57:41,931 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 05:57:41,931 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 05:57:41,931 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 05:57:41,932 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 05:57:41,932 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 05:57:41,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 05:57:41,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 05:57:41,933 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 05:57:41,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 05:57:41,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 05:57:41,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 05:57:41,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 05:57:41,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 05:57:41,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 05:57:41,974 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 05:57:41,975 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 05:57:42,033 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 05:57:42,037 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 05:57:42,038 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 05:57:42,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:57:42 BoogieIcfgContainer [2022-04-15 05:57:42,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 05:57:42,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 05:57:42,040 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 05:57:42,042 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 05:57:42,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:57:41" (1/3) ... [2022-04-15 05:57:42,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@262bde36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:57:42, skipping insertion in model container [2022-04-15 05:57:42,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:57:41" (2/3) ... [2022-04-15 05:57:42,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@262bde36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:57:42, skipping insertion in model container [2022-04-15 05:57:42,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:57:42" (3/3) ... [2022-04-15 05:57:42,044 INFO L111 eAbstractionObserver]: Analyzing ICFG overflow_1-1.c [2022-04-15 05:57:42,047 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 05:57:42,047 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 05:57:42,073 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 05:57:42,078 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 05:57:42,078 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 05:57:42,090 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:57:42,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 05:57:42,094 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:57:42,095 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:57:42,095 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:57:42,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:57:42,099 INFO L85 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 1 times [2022-04-15 05:57:42,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:42,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [670870838] [2022-04-15 05:57:42,115 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:57:42,115 INFO L85 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 2 times [2022-04-15 05:57:42,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:57:42,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861695785] [2022-04-15 05:57:42,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:57:42,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:57:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:42,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:57:42,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:42,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-15 05:57:42,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-15 05:57:42,329 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-15 05:57:42,330 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:57:42,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-15 05:57:42,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-15 05:57:42,331 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-15 05:57:42,331 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret4 := main(); {21#true} is VALID [2022-04-15 05:57:42,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} ~x~0 := 10; {21#true} is VALID [2022-04-15 05:57:42,332 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} assume !true; {22#false} is VALID [2022-04-15 05:57:42,332 INFO L272 TraceCheckUtils]: 7: Hoare triple {22#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {22#false} is VALID [2022-04-15 05:57:42,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2022-04-15 05:57:42,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} assume 0 == ~cond; {22#false} is VALID [2022-04-15 05:57:42,333 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-15 05:57:42,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:57:42,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:57:42,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861695785] [2022-04-15 05:57:42,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861695785] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:57:42,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:57:42,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 05:57:42,336 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:57:42,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [670870838] [2022-04-15 05:57:42,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [670870838] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:57:42,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:57:42,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 05:57:42,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125135436] [2022-04-15 05:57:42,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:57:42,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 05:57:42,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:57:42,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:42,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:42,366 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 05:57:42,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:42,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 05:57:42,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 05:57:42,384 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:42,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:42,468 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-15 05:57:42,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 05:57:42,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 05:57:42,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:57:42,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:42,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-15 05:57:42,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:42,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-15 05:57:42,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2022-04-15 05:57:42,531 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-15 05:57:42,537 INFO L225 Difference]: With dead ends: 29 [2022-04-15 05:57:42,537 INFO L226 Difference]: Without dead ends: 12 [2022-04-15 05:57:42,539 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 05:57:42,542 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:57:42,543 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 20 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:57:42,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-04-15 05:57:42,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-04-15 05:57:42,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:57:42,568 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:42,569 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:42,569 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:42,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:42,570 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-15 05:57:42,571 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-15 05:57:42,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:42,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:42,571 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-15 05:57:42,571 INFO L87 Difference]: Start difference. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-15 05:57:42,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:42,572 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-15 05:57:42,573 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-15 05:57:42,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:42,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:42,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:57:42,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:57:42,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:42,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-04-15 05:57:42,575 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2022-04-15 05:57:42,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:57:42,575 INFO L478 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-04-15 05:57:42,575 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:42,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 12 transitions. [2022-04-15 05:57:42,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:42,613 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-15 05:57:42,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 05:57:42,613 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:57:42,613 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:57:42,613 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 05:57:42,614 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:57:42,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:57:42,614 INFO L85 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 1 times [2022-04-15 05:57:42,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:42,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1015912616] [2022-04-15 05:57:42,615 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:57:42,615 INFO L85 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 2 times [2022-04-15 05:57:42,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:57:42,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075001449] [2022-04-15 05:57:42,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:57:42,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:57:42,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:42,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:57:42,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:42,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {135#true} is VALID [2022-04-15 05:57:42,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {135#true} assume true; {135#true} is VALID [2022-04-15 05:57:42,747 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {135#true} {135#true} #34#return; {135#true} is VALID [2022-04-15 05:57:42,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {135#true} call ULTIMATE.init(); {141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:57:42,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {135#true} is VALID [2022-04-15 05:57:42,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {135#true} assume true; {135#true} is VALID [2022-04-15 05:57:42,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {135#true} {135#true} #34#return; {135#true} is VALID [2022-04-15 05:57:42,750 INFO L272 TraceCheckUtils]: 4: Hoare triple {135#true} call #t~ret4 := main(); {135#true} is VALID [2022-04-15 05:57:42,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {135#true} ~x~0 := 10; {140#(and (<= (div main_~x~0 4294967296) 0) (<= 10 main_~x~0))} is VALID [2022-04-15 05:57:42,753 INFO L290 TraceCheckUtils]: 6: Hoare triple {140#(and (<= (div main_~x~0 4294967296) 0) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {136#false} is VALID [2022-04-15 05:57:42,753 INFO L272 TraceCheckUtils]: 7: Hoare triple {136#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {136#false} is VALID [2022-04-15 05:57:42,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {136#false} ~cond := #in~cond; {136#false} is VALID [2022-04-15 05:57:42,753 INFO L290 TraceCheckUtils]: 9: Hoare triple {136#false} assume 0 == ~cond; {136#false} is VALID [2022-04-15 05:57:42,753 INFO L290 TraceCheckUtils]: 10: Hoare triple {136#false} assume !false; {136#false} is VALID [2022-04-15 05:57:42,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:57:42,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:57:42,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075001449] [2022-04-15 05:57:42,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075001449] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:57:42,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:57:42,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:57:42,755 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:57:42,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1015912616] [2022-04-15 05:57:42,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1015912616] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:57:42,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:57:42,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:57:42,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985705844] [2022-04-15 05:57:42,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:57:42,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 05:57:42,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:57:42,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:42,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:42,770 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:57:42,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:42,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:57:42,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:57:42,771 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:42,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:42,827 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 05:57:42,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:57:42,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 05:57:42,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:57:42,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:42,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-15 05:57:42,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:42,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-15 05:57:42,830 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2022-04-15 05:57:42,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:42,856 INFO L225 Difference]: With dead ends: 18 [2022-04-15 05:57:42,856 INFO L226 Difference]: Without dead ends: 13 [2022-04-15 05:57:42,856 INFO L912 BasicCegarLoop]: 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-15 05:57:42,857 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:57:42,858 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:57:42,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-15 05:57:42,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-15 05:57:42,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:57:42,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:42,864 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:42,864 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:42,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:42,866 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 05:57:42,866 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 05:57:42,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:42,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:42,867 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states 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-15 05:57:42,867 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states 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-15 05:57:42,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:42,870 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 05:57:42,870 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 05:57:42,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:42,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:42,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:57:42,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:57:42,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:42,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-15 05:57:42,872 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-15 05:57:42,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:57:42,873 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-15 05:57:42,873 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:42,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 13 transitions. [2022-04-15 05:57:42,886 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-15 05:57:42,887 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 05:57:42,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 05:57:42,887 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:57:42,888 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:57:42,888 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 05:57:42,888 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:57:42,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:57:42,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1717471862, now seen corresponding path program 1 times [2022-04-15 05:57:42,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:42,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1733520159] [2022-04-15 05:57:45,074 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 05:57:45,178 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-15 05:57:45,180 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 05:57:45,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1867307785, now seen corresponding path program 1 times [2022-04-15 05:57:45,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:57:45,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613224537] [2022-04-15 05:57:45,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:57:45,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:57:45,199 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 2) .v_it_1.0) (* (- 1) main_~x~0_5) (* 4294967296 (div (+ (* 2 .v_it_1.0) main_~x~0_5) 4294967296)) 10) 0) [2022-04-15 05:57:45,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:45,245 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 2) .v_it_1.1) (* (- 1) main_~x~0_5) (* 4294967296 (div (+ (* 2 .v_it_1.1) main_~x~0_5) 4294967296)) 10) 0) [2022-04-15 05:57:45,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:57:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:45,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-15 05:57:45,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-15 05:57:45,386 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-15 05:57:45,386 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:57:45,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-15 05:57:45,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-15 05:57:45,386 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-15 05:57:45,387 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret4 := main(); {234#true} is VALID [2022-04-15 05:57:45,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} ~x~0 := 10; {239#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 05:57:45,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {239#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [40] L15-2-->L15-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_8 v_main_~x~0_7)) (.cse1 (mod v_main_~x~0_8 4294967296))) (or .cse0 (and .cse0 (< .cse1 10)) (and (< 0 (div (+ v_main_~x~0_8 (* (- 1) v_main_~x~0_7)) (- 2))) (= (mod (+ v_main_~x~0_8 v_main_~x~0_7) 2) 0) (<= 10 .cse1) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) (div (+ v_main_~x~0_8 (* (- 1) v_main_~x~0_7)) (- 2)))) (<= 10 (mod (+ (* v_it_1 2) v_main_~x~0_8) 4294967296)) (not (<= 1 v_it_1))))))) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0] {240#(or (<= main_~x~0 (* (div main_~x~0 2) 2)) (and (<= (div main_~x~0 4294967296) 0) (<= 10 main_~x~0)))} is VALID [2022-04-15 05:57:45,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {240#(or (<= main_~x~0 (* (div main_~x~0 2) 2)) (and (<= (div main_~x~0 4294967296) 0) (<= 10 main_~x~0)))} [39] L15-3_primed-->L15-3: Formula: (not (<= 10 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {241#(<= main_~x~0 (* (div main_~x~0 2) 2))} is VALID [2022-04-15 05:57:45,391 INFO L272 TraceCheckUtils]: 8: Hoare triple {241#(<= main_~x~0 (* (div main_~x~0 2) 2))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {242#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 05:57:45,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {242#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {243#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 05:57:45,392 INFO L290 TraceCheckUtils]: 10: Hoare triple {243#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {235#false} is VALID [2022-04-15 05:57:45,392 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-15 05:57:45,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:57:45,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:57:45,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613224537] [2022-04-15 05:57:45,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613224537] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:57:45,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:57:45,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 05:57:45,605 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:57:45,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1733520159] [2022-04-15 05:57:45,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1733520159] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:57:45,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:57:45,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 05:57:45,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762472509] [2022-04-15 05:57:45,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:57:45,606 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 05:57:45,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:57:45,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:45,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:45,632 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 05:57:45,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:45,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 05:57:45,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-04-15 05:57:45,633 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:45,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:45,699 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 05:57:45,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 05:57:45,700 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 05:57:45,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:57:45,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:45,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2022-04-15 05:57:45,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:45,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2022-04-15 05:57:45,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 13 transitions. [2022-04-15 05:57:47,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 12 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:47,801 INFO L225 Difference]: With dead ends: 13 [2022-04-15 05:57:47,801 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 05:57:47,801 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-04-15 05:57:47,802 INFO L913 BasicCegarLoop]: 7 mSDtfsCounter, 3 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:57:47,802 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 24 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 4 Unchecked, 0.0s Time] [2022-04-15 05:57:47,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 05:57:47,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 05:57:47,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:57:47,803 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-15 05:57:47,803 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-15 05:57:47,803 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-15 05:57:47,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:47,803 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 05:57:47,804 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 05:57:47,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:47,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:47,804 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-15 05:57:47,804 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-15 05:57:47,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:47,804 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 05:57:47,804 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 05:57:47,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:47,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:47,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:57:47,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:57:47,804 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-15 05:57:47,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 05:57:47,805 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2022-04-15 05:57:47,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:57:47,805 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 05:57:47,805 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:47,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 05:57:47,805 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-15 05:57:47,805 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 05:57:47,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:47,807 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 05:57:47,807 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 05:57:47,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 05:57:47,978 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-15 05:57:47,979 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-15 05:57:47,979 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-15 05:57:47,979 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 05:57:47,979 INFO L878 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-15 05:57:47,979 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 05:57:47,979 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 05:57:47,979 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 05:57:47,979 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 05:57:47,979 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 05:57:47,979 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 12 20) the Hoare annotation is: true [2022-04-15 05:57:47,980 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 12 20) the Hoare annotation is: true [2022-04-15 05:57:47,980 INFO L878 garLoopResultBuilder]: At program point L15-2(lines 15 17) the Hoare annotation is: (exists ((v_main_~x~0_12 Int)) (and (or (and (<= 10 (mod v_main_~x~0_12 4294967296)) (forall ((v_it_1 Int)) (or (<= 10 (mod (+ (* v_it_1 2) v_main_~x~0_12) 4294967296)) (not (<= 1 v_it_1)) (not (<= (+ v_it_1 1) (div (+ v_main_~x~0_12 (* (- 1) main_~x~0)) (- 2)))))) (= (mod (+ v_main_~x~0_12 main_~x~0) 2) 0) (< 0 (div (+ v_main_~x~0_12 (* (- 1) main_~x~0)) (- 2)))) (= v_main_~x~0_12 main_~x~0)) (<= 10 v_main_~x~0_12) (<= v_main_~x~0_12 10))) [2022-04-15 05:57:47,980 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 12 20) the Hoare annotation is: true [2022-04-15 05:57:47,980 INFO L878 garLoopResultBuilder]: At program point L15-3(lines 15 17) the Hoare annotation is: (<= main_~x~0 (* (div main_~x~0 2) 2)) [2022-04-15 05:57:47,980 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-15 05:57:47,980 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 5 10) the Hoare annotation is: true [2022-04-15 05:57:47,980 INFO L878 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-15 05:57:47,980 INFO L878 garLoopResultBuilder]: At program point L6(lines 6 8) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-15 05:57:47,980 INFO L885 garLoopResultBuilder]: At program point L6-2(lines 5 10) the Hoare annotation is: true [2022-04-15 05:57:47,981 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-15 05:57:47,982 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2022-04-15 05:57:47,983 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 05:57:47,985 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 05:57:47,988 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 05:57:48,038 INFO L163 areAnnotationChecker]: CFG has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 05:57:48,041 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] [2022-04-15 05:57:48,042 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] [2022-04-15 05:57:48,042 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] [2022-04-15 05:57:48,042 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] [2022-04-15 05:57:48,042 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] [2022-04-15 05:57:48,042 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] [2022-04-15 05:57:48,043 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] [2022-04-15 05:57:48,043 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] [2022-04-15 05:57:48,043 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] [2022-04-15 05:57:48,043 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] [2022-04-15 05:57:48,043 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] [2022-04-15 05:57:48,045 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] [2022-04-15 05:57:48,045 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] [2022-04-15 05:57:48,045 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] [2022-04-15 05:57:48,045 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] [2022-04-15 05:57:48,045 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] [2022-04-15 05:57:48,045 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] [2022-04-15 05:57:48,046 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] [2022-04-15 05:57:48,046 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] [2022-04-15 05:57:48,046 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] [2022-04-15 05:57:48,046 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] [2022-04-15 05:57:48,046 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] [2022-04-15 05:57:48,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 05:57:48 BoogieIcfgContainer [2022-04-15 05:57:48,047 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 05:57:48,048 INFO L158 Benchmark]: Toolchain (without parser) took 6378.88ms. Allocated memory was 173.0MB in the beginning and 263.2MB in the end (delta: 90.2MB). Free memory was 117.8MB in the beginning and 189.0MB in the end (delta: -71.2MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-04-15 05:57:48,048 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 173.0MB. Free memory is still 134.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 05:57:48,048 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.83ms. Allocated memory was 173.0MB in the beginning and 263.2MB in the end (delta: 90.2MB). Free memory was 117.7MB in the beginning and 238.2MB in the end (delta: -120.5MB). Peak memory consumption was 14.6MB. Max. memory is 8.0GB. [2022-04-15 05:57:48,048 INFO L158 Benchmark]: Boogie Preprocessor took 30.55ms. Allocated memory is still 263.2MB. Free memory was 238.2MB in the beginning and 236.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 05:57:48,049 INFO L158 Benchmark]: RCFGBuilder took 165.97ms. Allocated memory is still 263.2MB. Free memory was 236.6MB in the beginning and 226.2MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 05:57:48,049 INFO L158 Benchmark]: TraceAbstraction took 6007.04ms. Allocated memory is still 263.2MB. Free memory was 226.0MB in the beginning and 189.0MB in the end (delta: 37.0MB). Peak memory consumption was 38.0MB. Max. memory is 8.0GB. [2022-04-15 05:57:48,050 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 173.0MB. Free memory is still 134.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 171.83ms. Allocated memory was 173.0MB in the beginning and 263.2MB in the end (delta: 90.2MB). Free memory was 117.7MB in the beginning and 238.2MB in the end (delta: -120.5MB). Peak memory consumption was 14.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.55ms. Allocated memory is still 263.2MB. Free memory was 238.2MB in the beginning and 236.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 165.97ms. Allocated memory is still 263.2MB. Free memory was 236.6MB in the beginning and 226.2MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 6007.04ms. Allocated memory is still 263.2MB. Free memory was 226.0MB in the beginning and 189.0MB in the end (delta: 37.0MB). Peak memory consumption was 38.0MB. 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_main_~x~0_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,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: 7]: 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, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 4 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18 IncrementalHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 35 mSDtfsCounter, 18 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 30 PreInvPairs, 40 NumberOfFragments, 101 HoareAnnotationTreeSize, 30 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 18 FomulaSimplificationsInter, 88 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant [2022-04-15 05:57:48,056 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] [2022-04-15 05:57:48,056 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] [2022-04-15 05:57:48,056 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] [2022-04-15 05:57:48,057 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] [2022-04-15 05:57:48,057 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] [2022-04-15 05:57:48,057 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] [2022-04-15 05:57:48,057 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] [2022-04-15 05:57:48,057 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] [2022-04-15 05:57:48,057 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] [2022-04-15 05:57:48,057 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] [2022-04-15 05:57:48,057 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] [2022-04-15 05:57:48,057 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] [2022-04-15 05:57:48,058 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] [2022-04-15 05:57:48,058 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] [2022-04-15 05:57:48,058 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] [2022-04-15 05:57:48,058 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] [2022-04-15 05:57:48,058 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] [2022-04-15 05:57:48,058 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] [2022-04-15 05:57:48,058 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] [2022-04-15 05:57:48,058 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] [2022-04-15 05:57:48,058 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] [2022-04-15 05:57:48,058 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_12,QUANTIFIED] Derived loop invariant: (\exists v_main_~x~0_12 : int :: (((((10 <= v_main_~x~0_12 % 4294967296 && (forall v_it_1 : int :: (10 <= (v_it_1 * 2 + v_main_~x~0_12) % 4294967296 || !(1 <= v_it_1)) || !(v_it_1 + 1 <= (v_main_~x~0_12 + -1 * x) / -2))) && (v_main_~x~0_12 + x) % 2 == 0) && 0 < (v_main_~x~0_12 + -1 * x) / -2) || v_main_~x~0_12 == x) && 10 <= v_main_~x~0_12) && v_main_~x~0_12 <= 10) - ProcedureContractResult [Line: 12]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 5]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-15 05:57:48,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...