/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-lit/cggmp2005b.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 09:39:47,826 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 09:39:47,835 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 09:39:47,883 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 09:39:47,884 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 09:39:47,885 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 09:39:47,888 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 09:39:47,890 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 09:39:47,892 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 09:39:47,896 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 09:39:47,897 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 09:39:47,898 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 09:39:47,899 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 09:39:47,901 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 09:39:47,901 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 09:39:47,904 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 09:39:47,905 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 09:39:47,905 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 09:39:47,907 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 09:39:47,913 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 09:39:47,915 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 09:39:47,916 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 09:39:47,917 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 09:39:47,917 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 09:39:47,919 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 09:39:47,925 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 09:39:47,925 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 09:39:47,925 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 09:39:47,926 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 09:39:47,926 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 09:39:47,927 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 09:39:47,928 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 09:39:47,929 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 09:39:47,930 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 09:39:47,930 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 09:39:47,931 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 09:39:47,931 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 09:39:47,932 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 09:39:47,932 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 09:39:47,932 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 09:39:47,933 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 09:39:47,934 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 09:39:47,935 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 09:39:47,944 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 09:39:47,945 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 09:39:47,946 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 09:39:47,946 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 09:39:47,946 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 09:39:47,947 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 09:39:47,947 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 09:39:47,947 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 09:39:47,947 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 09:39:47,948 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 09:39:47,948 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 09:39:47,948 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 09:39:47,948 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 09:39:47,949 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 09:39:47,949 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 09:39:47,949 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:39:47,949 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 09:39:47,949 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 09:39:47,949 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 09:39:47,950 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 09:39:47,950 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 09:39:47,950 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 09:39:47,950 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 09:39:48,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 09:39:48,218 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 09:39:48,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 09:39:48,222 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 09:39:48,222 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 09:39:48,223 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/cggmp2005b.i [2022-04-28 09:39:48,279 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/749390abe/2736b67939354b2ba4a69953e87368de/FLAG511f77b6f [2022-04-28 09:39:48,690 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 09:39:48,690 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/cggmp2005b.i [2022-04-28 09:39:48,696 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/749390abe/2736b67939354b2ba4a69953e87368de/FLAG511f77b6f [2022-04-28 09:39:49,107 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/749390abe/2736b67939354b2ba4a69953e87368de [2022-04-28 09:39:49,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 09:39:49,111 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 09:39:49,112 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 09:39:49,113 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 09:39:49,115 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 09:39:49,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:39:49" (1/1) ... [2022-04-28 09:39:49,117 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cbbd33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:49, skipping insertion in model container [2022-04-28 09:39:49,117 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:39:49" (1/1) ... [2022-04-28 09:39:49,128 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 09:39:49,140 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 09:39:49,353 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-lit/cggmp2005b.i[895,908] [2022-04-28 09:39:49,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:39:49,390 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 09:39:49,409 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-lit/cggmp2005b.i[895,908] [2022-04-28 09:39:49,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:39:49,430 INFO L208 MainTranslator]: Completed translation [2022-04-28 09:39:49,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:49 WrapperNode [2022-04-28 09:39:49,431 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 09:39:49,432 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 09:39:49,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 09:39:49,433 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 09:39:49,442 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:49" (1/1) ... [2022-04-28 09:39:49,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:49" (1/1) ... [2022-04-28 09:39:49,449 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:49" (1/1) ... [2022-04-28 09:39:49,450 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:49" (1/1) ... [2022-04-28 09:39:49,458 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:49" (1/1) ... [2022-04-28 09:39:49,466 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:49" (1/1) ... [2022-04-28 09:39:49,475 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:49" (1/1) ... [2022-04-28 09:39:49,479 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 09:39:49,481 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 09:39:49,481 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 09:39:49,481 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 09:39:49,482 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:49" (1/1) ... [2022-04-28 09:39:49,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:39:49,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:39:49,512 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 09:39:49,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 09:39:49,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 09:39:49,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 09:39:49,567 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 09:39:49,568 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 09:39:49,568 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 09:39:49,568 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 09:39:49,568 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 09:39:49,568 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 09:39:49,568 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 09:39:49,568 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 09:39:49,569 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 09:39:49,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 09:39:49,569 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 09:39:49,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 09:39:49,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 09:39:49,571 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 09:39:49,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 09:39:49,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 09:39:49,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 09:39:49,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 09:39:49,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 09:39:49,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 09:39:49,638 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 09:39:49,639 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 09:39:49,761 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 09:39:49,767 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 09:39:49,767 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-28 09:39:49,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:39:49 BoogieIcfgContainer [2022-04-28 09:39:49,769 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 09:39:49,770 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 09:39:49,770 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 09:39:49,774 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 09:39:49,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 09:39:49" (1/3) ... [2022-04-28 09:39:49,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73abb338 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:39:49, skipping insertion in model container [2022-04-28 09:39:49,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:49" (2/3) ... [2022-04-28 09:39:49,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73abb338 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:39:49, skipping insertion in model container [2022-04-28 09:39:49,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:39:49" (3/3) ... [2022-04-28 09:39:49,776 INFO L111 eAbstractionObserver]: Analyzing ICFG cggmp2005b.i [2022-04-28 09:39:49,788 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 09:39:49,789 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 09:39:49,825 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 09:39:49,831 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@398c29c6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@134e1530 [2022-04-28 09:39:49,831 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 09:39:49,838 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:39:49,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 09:39:49,850 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:39:49,851 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:39:49,852 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:39:49,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:39:49,879 INFO L85 PathProgramCache]: Analyzing trace with hash -990540922, now seen corresponding path program 1 times [2022-04-28 09:39:49,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:39:49,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [94397491] [2022-04-28 09:39:49,913 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:39:49,914 INFO L85 PathProgramCache]: Analyzing trace with hash -990540922, now seen corresponding path program 2 times [2022-04-28 09:39:49,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:39:49,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666302160] [2022-04-28 09:39:49,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:39:49,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:39:50,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:50,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:39:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:50,065 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(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(9, 2); {25#true} is VALID [2022-04-28 09:39:50,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-28 09:39:50,066 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #75#return; {25#true} is VALID [2022-04-28 09:39:50,074 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:39:50,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(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(9, 2); {25#true} is VALID [2022-04-28 09:39:50,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-28 09:39:50,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #75#return; {25#true} is VALID [2022-04-28 09:39:50,075 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret1 := main(); {25#true} is VALID [2022-04-28 09:39:50,075 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {25#true} is VALID [2022-04-28 09:39:50,076 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-28 09:39:50,076 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {26#false} is VALID [2022-04-28 09:39:50,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-28 09:39:50,077 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-28 09:39:50,077 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-28 09:39:50,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:39:50,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:39:50,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666302160] [2022-04-28 09:39:50,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666302160] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:39:50,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:39:50,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:39:50,082 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:39:50,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [94397491] [2022-04-28 09:39:50,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [94397491] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:39:50,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:39:50,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:39:50,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558937051] [2022-04-28 09:39:50,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:39:50,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 09:39:50,090 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:39:50,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:50,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:39:50,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 09:39:50,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:39:50,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 09:39:50,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 09:39:50,150 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:50,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:50,257 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2022-04-28 09:39:50,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 09:39:50,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 09:39:50,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:39:50,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:50,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-04-28 09:39:50,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:50,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-04-28 09:39:50,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 51 transitions. [2022-04-28 09:39:50,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:39:50,366 INFO L225 Difference]: With dead ends: 38 [2022-04-28 09:39:50,366 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 09:39:50,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 09:39:50,374 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:39:50,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 26 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:39:50,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 09:39:50,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 09:39:50,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:39:50,400 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:50,400 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:50,401 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:50,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:50,404 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-28 09:39:50,404 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-28 09:39:50,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:39:50,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:39:50,405 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 09:39:50,405 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 09:39:50,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:50,407 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-28 09:39:50,407 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-28 09:39:50,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:39:50,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:39:50,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:39:50,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:39:50,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:50,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-04-28 09:39:50,411 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2022-04-28 09:39:50,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:39:50,411 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-04-28 09:39:50,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:50,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 17 transitions. [2022-04-28 09:39:50,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:39:50,429 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-28 09:39:50,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 09:39:50,429 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:39:50,429 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:39:50,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 09:39:50,430 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:39:50,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:39:50,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1017323031, now seen corresponding path program 1 times [2022-04-28 09:39:50,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:39:50,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1867242871] [2022-04-28 09:39:50,432 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:39:50,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1017323031, now seen corresponding path program 2 times [2022-04-28 09:39:50,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:39:50,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926927879] [2022-04-28 09:39:50,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:39:50,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:39:50,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:50,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:39:50,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:50,479 INFO L290 TraceCheckUtils]: 0: Hoare triple {175#(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(9, 2); {169#true} is VALID [2022-04-28 09:39:50,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {169#true} assume true; {169#true} is VALID [2022-04-28 09:39:50,479 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {169#true} {169#true} #75#return; {169#true} is VALID [2022-04-28 09:39:50,480 INFO L272 TraceCheckUtils]: 0: Hoare triple {169#true} call ULTIMATE.init(); {175#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:39:50,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {175#(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(9, 2); {169#true} is VALID [2022-04-28 09:39:50,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {169#true} assume true; {169#true} is VALID [2022-04-28 09:39:50,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {169#true} {169#true} #75#return; {169#true} is VALID [2022-04-28 09:39:50,481 INFO L272 TraceCheckUtils]: 4: Hoare triple {169#true} call #t~ret1 := main(); {169#true} is VALID [2022-04-28 09:39:50,481 INFO L290 TraceCheckUtils]: 5: Hoare triple {169#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {174#(= main_~i~0 0)} is VALID [2022-04-28 09:39:50,482 INFO L290 TraceCheckUtils]: 6: Hoare triple {174#(= main_~i~0 0)} assume !(~i~0 <= 100); {170#false} is VALID [2022-04-28 09:39:50,482 INFO L272 TraceCheckUtils]: 7: Hoare triple {170#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {170#false} is VALID [2022-04-28 09:39:50,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {170#false} ~cond := #in~cond; {170#false} is VALID [2022-04-28 09:39:50,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {170#false} assume 0 == ~cond; {170#false} is VALID [2022-04-28 09:39:50,483 INFO L290 TraceCheckUtils]: 10: Hoare triple {170#false} assume !false; {170#false} is VALID [2022-04-28 09:39:50,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:39:50,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:39:50,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926927879] [2022-04-28 09:39:50,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926927879] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:39:50,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:39:50,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:39:50,484 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:39:50,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1867242871] [2022-04-28 09:39:50,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1867242871] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:39:50,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:39:50,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:39:50,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121526405] [2022-04-28 09:39:50,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:39:50,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 09:39:50,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:39:50,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:50,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:39:50,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 09:39:50,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:39:50,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 09:39:50,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 09:39:50,497 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:50,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:50,553 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-28 09:39:50,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 09:39:50,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 09:39:50,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:39:50,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:50,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2022-04-28 09:39:50,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:50,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2022-04-28 09:39:50,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 23 transitions. [2022-04-28 09:39:50,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:39:50,578 INFO L225 Difference]: With dead ends: 21 [2022-04-28 09:39:50,579 INFO L226 Difference]: Without dead ends: 16 [2022-04-28 09:39:50,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 09:39:50,580 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 11 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:39:50,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 23 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:39:50,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-28 09:39:50,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-28 09:39:50,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:39:50,585 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:50,585 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:50,586 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:50,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:50,587 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-28 09:39:50,587 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-28 09:39:50,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:39:50,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:39:50,588 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 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 16 states. [2022-04-28 09:39:50,588 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 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 16 states. [2022-04-28 09:39:50,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:50,589 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-28 09:39:50,589 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-28 09:39:50,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:39:50,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:39:50,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:39:50,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:39:50,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:50,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-28 09:39:50,591 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 11 [2022-04-28 09:39:50,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:39:50,592 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-28 09:39:50,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:50,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 18 transitions. [2022-04-28 09:39:50,613 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-28 09:39:50,614 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-28 09:39:50,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 09:39:50,615 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:39:50,615 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:39:50,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 09:39:50,619 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:39:50,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:39:50,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1873832261, now seen corresponding path program 1 times [2022-04-28 09:39:50,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:39:50,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1223717973] [2022-04-28 09:39:50,650 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:39:50,650 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:39:50,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1873832261, now seen corresponding path program 2 times [2022-04-28 09:39:50,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:39:50,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621196066] [2022-04-28 09:39:50,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:39:50,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:39:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:50,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:39:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:50,740 INFO L290 TraceCheckUtils]: 0: Hoare triple {292#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {286#true} is VALID [2022-04-28 09:39:50,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {286#true} assume true; {286#true} is VALID [2022-04-28 09:39:50,741 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {286#true} {286#true} #75#return; {286#true} is VALID [2022-04-28 09:39:50,742 INFO L272 TraceCheckUtils]: 0: Hoare triple {286#true} call ULTIMATE.init(); {292#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:39:50,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {292#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {286#true} is VALID [2022-04-28 09:39:50,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {286#true} assume true; {286#true} is VALID [2022-04-28 09:39:50,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {286#true} {286#true} #75#return; {286#true} is VALID [2022-04-28 09:39:50,743 INFO L272 TraceCheckUtils]: 4: Hoare triple {286#true} call #t~ret1 := main(); {286#true} is VALID [2022-04-28 09:39:50,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {286#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {291#(<= (+ main_~j~0 100) 0)} is VALID [2022-04-28 09:39:50,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {291#(<= (+ main_~j~0 100) 0)} assume !!(~i~0 <= 100);~i~0 := 1 + ~i~0; {291#(<= (+ main_~j~0 100) 0)} is VALID [2022-04-28 09:39:50,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {291#(<= (+ main_~j~0 100) 0)} assume !(~j~0 < 20); {287#false} is VALID [2022-04-28 09:39:50,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {287#false} ~k~0 := 4; {287#false} is VALID [2022-04-28 09:39:50,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {287#false} assume !(~k~0 <= 3); {287#false} is VALID [2022-04-28 09:39:50,745 INFO L290 TraceCheckUtils]: 10: Hoare triple {287#false} assume !(~i~0 <= 100); {287#false} is VALID [2022-04-28 09:39:50,745 INFO L272 TraceCheckUtils]: 11: Hoare triple {287#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {287#false} is VALID [2022-04-28 09:39:50,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {287#false} ~cond := #in~cond; {287#false} is VALID [2022-04-28 09:39:50,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {287#false} assume 0 == ~cond; {287#false} is VALID [2022-04-28 09:39:50,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {287#false} assume !false; {287#false} is VALID [2022-04-28 09:39:50,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:39:50,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:39:50,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621196066] [2022-04-28 09:39:50,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621196066] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:39:50,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:39:50,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:39:50,748 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:39:50,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1223717973] [2022-04-28 09:39:50,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1223717973] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:39:50,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:39:50,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:39:50,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417121307] [2022-04-28 09:39:50,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:39:50,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 09:39:50,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:39:50,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:50,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:39:50,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 09:39:50,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:39:50,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 09:39:50,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 09:39:50,767 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:50,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:50,840 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-28 09:39:50,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 09:39:50,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 09:39:50,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:39:50,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:50,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-04-28 09:39:50,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:50,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-04-28 09:39:50,849 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 31 transitions. [2022-04-28 09:39:50,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:39:50,879 INFO L225 Difference]: With dead ends: 26 [2022-04-28 09:39:50,879 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 09:39:50,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 09:39:50,883 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:39:50,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 23 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:39:50,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 09:39:50,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 09:39:50,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:39:50,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:50,899 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:50,900 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:50,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:50,903 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 09:39:50,903 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 09:39:50,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:39:50,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:39:50,905 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 09:39:50,905 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 09:39:50,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:50,907 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 09:39:50,907 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 09:39:50,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:39:50,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:39:50,908 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:39:50,908 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:39:50,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:50,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-28 09:39:50,910 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 15 [2022-04-28 09:39:50,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:39:50,912 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-28 09:39:50,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:50,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-28 09:39:50,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:39:50,930 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 09:39:50,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 09:39:50,931 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:39:50,931 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:39:50,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 09:39:50,935 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:39:50,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:39:50,936 INFO L85 PathProgramCache]: Analyzing trace with hash -479695372, now seen corresponding path program 1 times [2022-04-28 09:39:50,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:39:50,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1695995704] [2022-04-28 09:39:50,972 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:39:50,983 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:39:50,983 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:39:50,984 INFO L85 PathProgramCache]: Analyzing trace with hash -479695372, now seen corresponding path program 2 times [2022-04-28 09:39:50,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:39:50,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492142845] [2022-04-28 09:39:50,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:39:50,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:39:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:51,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:39:51,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:51,078 INFO L290 TraceCheckUtils]: 0: Hoare triple {424#(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(9, 2); {417#true} is VALID [2022-04-28 09:39:51,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {417#true} assume true; {417#true} is VALID [2022-04-28 09:39:51,078 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {417#true} {417#true} #75#return; {417#true} is VALID [2022-04-28 09:39:51,080 INFO L272 TraceCheckUtils]: 0: Hoare triple {417#true} call ULTIMATE.init(); {424#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:39:51,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {424#(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(9, 2); {417#true} is VALID [2022-04-28 09:39:51,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {417#true} assume true; {417#true} is VALID [2022-04-28 09:39:51,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {417#true} {417#true} #75#return; {417#true} is VALID [2022-04-28 09:39:51,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {417#true} call #t~ret1 := main(); {417#true} is VALID [2022-04-28 09:39:51,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {417#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {422#(= main_~i~0 0)} is VALID [2022-04-28 09:39:51,099 INFO L290 TraceCheckUtils]: 6: Hoare triple {422#(= main_~i~0 0)} assume !!(~i~0 <= 100);~i~0 := 1 + ~i~0; {423#(<= main_~i~0 1)} is VALID [2022-04-28 09:39:51,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {423#(<= main_~i~0 1)} assume !!(~j~0 < 20);~j~0 := ~i~0 + ~j~0; {423#(<= main_~i~0 1)} is VALID [2022-04-28 09:39:51,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {423#(<= main_~i~0 1)} assume !(~j~0 < 20); {423#(<= main_~i~0 1)} is VALID [2022-04-28 09:39:51,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {423#(<= main_~i~0 1)} ~k~0 := 4; {423#(<= main_~i~0 1)} is VALID [2022-04-28 09:39:51,102 INFO L290 TraceCheckUtils]: 10: Hoare triple {423#(<= main_~i~0 1)} assume !(~k~0 <= 3); {423#(<= main_~i~0 1)} is VALID [2022-04-28 09:39:51,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {423#(<= main_~i~0 1)} assume !(~i~0 <= 100); {418#false} is VALID [2022-04-28 09:39:51,102 INFO L272 TraceCheckUtils]: 12: Hoare triple {418#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {418#false} is VALID [2022-04-28 09:39:51,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {418#false} ~cond := #in~cond; {418#false} is VALID [2022-04-28 09:39:51,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {418#false} assume 0 == ~cond; {418#false} is VALID [2022-04-28 09:39:51,111 INFO L290 TraceCheckUtils]: 15: Hoare triple {418#false} assume !false; {418#false} is VALID [2022-04-28 09:39:51,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 09:39:51,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:39:51,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492142845] [2022-04-28 09:39:51,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492142845] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:39:51,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743424417] [2022-04-28 09:39:51,113 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:39:51,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:39:51,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:39:51,127 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:39:51,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 09:39:51,195 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:39:51,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:39:51,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 09:39:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:51,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:39:51,356 INFO L272 TraceCheckUtils]: 0: Hoare triple {417#true} call ULTIMATE.init(); {417#true} is VALID [2022-04-28 09:39:51,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {417#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {417#true} is VALID [2022-04-28 09:39:51,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {417#true} assume true; {417#true} is VALID [2022-04-28 09:39:51,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {417#true} {417#true} #75#return; {417#true} is VALID [2022-04-28 09:39:51,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {417#true} call #t~ret1 := main(); {417#true} is VALID [2022-04-28 09:39:51,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {417#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {417#true} is VALID [2022-04-28 09:39:51,358 INFO L290 TraceCheckUtils]: 6: Hoare triple {417#true} assume !!(~i~0 <= 100);~i~0 := 1 + ~i~0; {417#true} is VALID [2022-04-28 09:39:51,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {417#true} assume !!(~j~0 < 20);~j~0 := ~i~0 + ~j~0; {417#true} is VALID [2022-04-28 09:39:51,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {417#true} assume !(~j~0 < 20); {417#true} is VALID [2022-04-28 09:39:51,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {417#true} ~k~0 := 4; {455#(= main_~k~0 4)} is VALID [2022-04-28 09:39:51,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {455#(= main_~k~0 4)} assume !(~k~0 <= 3); {455#(= main_~k~0 4)} is VALID [2022-04-28 09:39:51,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {455#(= main_~k~0 4)} assume !(~i~0 <= 100); {455#(= main_~k~0 4)} is VALID [2022-04-28 09:39:51,361 INFO L272 TraceCheckUtils]: 12: Hoare triple {455#(= main_~k~0 4)} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {465#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:39:51,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {465#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {469#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:39:51,362 INFO L290 TraceCheckUtils]: 14: Hoare triple {469#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {418#false} is VALID [2022-04-28 09:39:51,362 INFO L290 TraceCheckUtils]: 15: Hoare triple {418#false} assume !false; {418#false} is VALID [2022-04-28 09:39:51,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 09:39:51,362 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 09:39:51,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743424417] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:39:51,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 09:39:51,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-04-28 09:39:51,363 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:39:51,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1695995704] [2022-04-28 09:39:51,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1695995704] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:39:51,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:39:51,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:39:51,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022994765] [2022-04-28 09:39:51,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:39:51,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 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 16 [2022-04-28 09:39:51,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:39:51,365 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:51,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:39:51,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 09:39:51,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:39:51,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 09:39:51,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-28 09:39:51,380 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:51,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:51,446 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-04-28 09:39:51,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:39:51,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 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 16 [2022-04-28 09:39:51,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:39:51,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:51,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-28 09:39:51,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:51,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-28 09:39:51,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2022-04-28 09:39:51,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:39:51,478 INFO L225 Difference]: With dead ends: 26 [2022-04-28 09:39:51,478 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 09:39:51,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-28 09:39:51,479 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:39:51,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 54 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:39:51,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 09:39:51,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 09:39:51,480 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:39:51,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:39:51,480 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:39:51,481 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:39:51,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:51,481 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:39:51,481 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:39:51,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:39:51,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:39:51,481 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 09:39:51,481 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 09:39:51,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:51,482 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:39:51,482 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:39:51,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:39:51,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:39:51,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:39:51,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:39:51,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:39:51,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 09:39:51,483 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2022-04-28 09:39:51,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:39:51,483 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 09:39:51,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:51,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 09:39:51,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:39:51,483 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:39:51,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:39:51,486 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 09:39:51,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 09:39:51,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:39:51,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 09:39:51,787 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-28 09:39:51,787 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-28 09:39:51,787 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-28 09:39:51,787 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-28 09:39:51,788 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-28 09:39:51,788 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-28 09:39:51,788 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-28 09:39:51,788 INFO L895 garLoopResultBuilder]: At program point L35-2(lines 35 37) the Hoare annotation is: (= main_~k~0 4) [2022-04-28 09:39:51,789 INFO L895 garLoopResultBuilder]: At program point L35-3(lines 29 38) the Hoare annotation is: (or (and (= main_~i~0 0) (<= (+ main_~j~0 100) 0)) (= main_~k~0 4)) [2022-04-28 09:39:51,789 INFO L902 garLoopResultBuilder]: At program point L31-2(lines 31 33) the Hoare annotation is: true [2022-04-28 09:39:51,790 INFO L902 garLoopResultBuilder]: At program point L31-3(lines 31 33) the Hoare annotation is: true [2022-04-28 09:39:51,790 INFO L895 garLoopResultBuilder]: At program point L29-2(lines 29 38) the Hoare annotation is: (= main_~k~0 4) [2022-04-28 09:39:51,790 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 24 41) the Hoare annotation is: true [2022-04-28 09:39:51,790 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 24 41) the Hoare annotation is: true [2022-04-28 09:39:51,790 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 41) the Hoare annotation is: true [2022-04-28 09:39:51,790 INFO L902 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: true [2022-04-28 09:39:51,790 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:39:51,790 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 09:39:51,791 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:39:51,791 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:39:51,791 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 09:39:51,791 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 09:39:51,791 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:39:51,791 INFO L902 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: true [2022-04-28 09:39:51,791 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-28 09:39:51,791 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: true [2022-04-28 09:39:51,792 INFO L895 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 09:39:51,792 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 09:39:51,792 INFO L895 garLoopResultBuilder]: At program point L18(lines 18 20) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 09:39:51,795 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2] [2022-04-28 09:39:51,797 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 09:39:51,801 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:39:51,801 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:39:51,802 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 09:39:51,803 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-28 09:39:51,803 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 09:39:51,803 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 09:39:51,807 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-28 09:39:51,812 INFO L163 areAnnotationChecker]: CFG has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 09:39:51,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:39:51 BoogieIcfgContainer [2022-04-28 09:39:51,821 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 09:39:51,822 INFO L158 Benchmark]: Toolchain (without parser) took 2711.79ms. Allocated memory was 181.4MB in the beginning and 234.9MB in the end (delta: 53.5MB). Free memory was 133.0MB in the beginning and 185.4MB in the end (delta: -52.4MB). Peak memory consumption was 2.2MB. Max. memory is 8.0GB. [2022-04-28 09:39:51,823 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 181.4MB. Free memory is still 148.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 09:39:51,823 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.23ms. Allocated memory is still 181.4MB. Free memory was 132.9MB in the beginning and 157.3MB in the end (delta: -24.4MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. [2022-04-28 09:39:51,823 INFO L158 Benchmark]: Boogie Preprocessor took 46.96ms. Allocated memory is still 181.4MB. Free memory was 157.3MB in the beginning and 155.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 09:39:51,824 INFO L158 Benchmark]: RCFGBuilder took 288.55ms. Allocated memory is still 181.4MB. Free memory was 155.8MB in the beginning and 144.8MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 09:39:51,824 INFO L158 Benchmark]: TraceAbstraction took 2050.84ms. Allocated memory was 181.4MB in the beginning and 234.9MB in the end (delta: 53.5MB). Free memory was 144.2MB in the beginning and 185.4MB in the end (delta: -41.2MB). Peak memory consumption was 13.3MB. Max. memory is 8.0GB. [2022-04-28 09:39:51,825 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.18ms. Allocated memory is still 181.4MB. Free memory is still 148.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 319.23ms. Allocated memory is still 181.4MB. Free memory was 132.9MB in the beginning and 157.3MB in the end (delta: -24.4MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.96ms. Allocated memory is still 181.4MB. Free memory was 157.3MB in the beginning and 155.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 288.55ms. Allocated memory is still 181.4MB. Free memory was 155.8MB in the beginning and 144.8MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 2050.84ms. Allocated memory was 181.4MB in the beginning and 234.9MB in the end (delta: 53.5MB). Free memory was 144.2MB in the beginning and 185.4MB in the end (delta: -41.2MB). Peak memory consumption was 13.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: 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 6 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 43 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 126 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 55 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37 IncrementalHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 71 mSDtfsCounter, 37 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 46 PreInvPairs, 68 NumberOfFragments, 57 HoareAnnotationTreeSize, 46 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 22 FomulaSimplificationsInter, 4 FormulaSimplificationTreeSizeReductionInter, 0.0s 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: 29]: Loop Invariant Derived loop invariant: (i == 0 && j + 100 <= 0) || k == 4 - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: k == 4 - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-28 09:39:51,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...