/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-zilu/benchmark19_conjunctive.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 13:16:18,780 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 13:16:18,782 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 13:16:18,814 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 13:16:18,814 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 13:16:18,815 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 13:16:18,817 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 13:16:18,819 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 13:16:18,820 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 13:16:18,824 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 13:16:18,824 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 13:16:18,825 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 13:16:18,825 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 13:16:18,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 13:16:18,828 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 13:16:18,830 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 13:16:18,830 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 13:16:18,831 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 13:16:18,832 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 13:16:18,836 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 13:16:18,837 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 13:16:18,838 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 13:16:18,838 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 13:16:18,839 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 13:16:18,840 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 13:16:18,844 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 13:16:18,844 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 13:16:18,844 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 13:16:18,845 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 13:16:18,845 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 13:16:18,846 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 13:16:18,846 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 13:16:18,847 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 13:16:18,848 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 13:16:18,848 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 13:16:18,849 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 13:16:18,849 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 13:16:18,849 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 13:16:18,849 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 13:16:18,850 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 13:16:18,850 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 13:16:18,851 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 13:16:18,852 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 13:16:18,859 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 13:16:18,860 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 13:16:18,860 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 13:16:18,861 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 13:16:18,861 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 13:16:18,861 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 13:16:18,861 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 13:16:18,861 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 13:16:18,861 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 13:16:18,862 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 13:16:18,862 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 13:16:18,862 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 13:16:18,862 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 13:16:18,862 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 13:16:18,862 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 13:16:18,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:16:18,863 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 13:16:18,863 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 13:16:18,863 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 13:16:18,863 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 13:16:18,863 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 13:16:18,863 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 13:16:18,863 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 13:16:19,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 13:16:19,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 13:16:19,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 13:16:19,087 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 13:16:19,088 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 13:16:19,089 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark19_conjunctive.i [2022-04-15 13:16:19,137 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a0e1b438/c251d4751a884a0d8611ba4e0a1ce732/FLAG7e9dc4d4b [2022-04-15 13:16:19,454 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 13:16:19,454 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark19_conjunctive.i [2022-04-15 13:16:19,458 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a0e1b438/c251d4751a884a0d8611ba4e0a1ce732/FLAG7e9dc4d4b [2022-04-15 13:16:19,885 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a0e1b438/c251d4751a884a0d8611ba4e0a1ce732 [2022-04-15 13:16:19,887 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 13:16:19,888 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 13:16:19,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 13:16:19,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 13:16:19,905 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 13:16:19,905 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:16:19" (1/1) ... [2022-04-15 13:16:19,906 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4287fbc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:16:19, skipping insertion in model container [2022-04-15 13:16:19,906 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:16:19" (1/1) ... [2022-04-15 13:16:19,911 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 13:16:19,929 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 13:16:20,026 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-zilu/benchmark19_conjunctive.i[873,886] [2022-04-15 13:16:20,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:16:20,049 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 13:16:20,057 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-zilu/benchmark19_conjunctive.i[873,886] [2022-04-15 13:16:20,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:16:20,077 INFO L208 MainTranslator]: Completed translation [2022-04-15 13:16:20,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:16:20 WrapperNode [2022-04-15 13:16:20,078 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 13:16:20,078 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 13:16:20,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 13:16:20,079 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 13:16:20,088 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:16:20" (1/1) ... [2022-04-15 13:16:20,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:16:20" (1/1) ... [2022-04-15 13:16:20,096 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:16:20" (1/1) ... [2022-04-15 13:16:20,096 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:16:20" (1/1) ... [2022-04-15 13:16:20,109 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:16:20" (1/1) ... [2022-04-15 13:16:20,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:16:20" (1/1) ... [2022-04-15 13:16:20,112 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:16:20" (1/1) ... [2022-04-15 13:16:20,113 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 13:16:20,114 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 13:16:20,114 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 13:16:20,114 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 13:16:20,115 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:16:20" (1/1) ... [2022-04-15 13:16:20,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:16:20,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:16:20,148 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 13:16:20,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 13:16:20,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 13:16:20,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 13:16:20,193 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 13:16:20,193 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 13:16:20,194 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 13:16:20,194 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 13:16:20,194 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 13:16:20,194 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 13:16:20,194 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 13:16:20,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 13:16:20,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 13:16:20,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-15 13:16:20,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 13:16:20,195 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 13:16:20,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 13:16:20,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 13:16:20,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 13:16:20,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 13:16:20,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 13:16:20,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 13:16:20,255 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 13:16:20,257 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 13:16:20,369 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 13:16:20,373 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 13:16:20,374 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 13:16:20,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:16:20 BoogieIcfgContainer [2022-04-15 13:16:20,375 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 13:16:20,376 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 13:16:20,376 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 13:16:20,379 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 13:16:20,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:16:19" (1/3) ... [2022-04-15 13:16:20,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d7a3cb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:16:20, skipping insertion in model container [2022-04-15 13:16:20,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:16:20" (2/3) ... [2022-04-15 13:16:20,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d7a3cb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:16:20, skipping insertion in model container [2022-04-15 13:16:20,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:16:20" (3/3) ... [2022-04-15 13:16:20,381 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark19_conjunctive.i [2022-04-15 13:16:20,385 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 13:16:20,385 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 13:16:20,410 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 13:16:20,414 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 13:16:20,414 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 13:16:20,424 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:16:20,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 13:16:20,429 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:16:20,429 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:16:20,429 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:16:20,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:16:20,432 INFO L85 PathProgramCache]: Analyzing trace with hash -304977768, now seen corresponding path program 1 times [2022-04-15 13:16:20,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:16:20,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [45814124] [2022-04-15 13:16:20,444 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:16:20,444 INFO L85 PathProgramCache]: Analyzing trace with hash -304977768, now seen corresponding path program 2 times [2022-04-15 13:16:20,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:16:20,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157733047] [2022-04-15 13:16:20,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:16:20,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:16:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:16:20,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:16:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:16:20,616 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {23#true} is VALID [2022-04-15 13:16:20,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-15 13:16:20,616 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #45#return; {23#true} is VALID [2022-04-15 13:16:20,618 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:16:20,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {23#true} is VALID [2022-04-15 13:16:20,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-15 13:16:20,618 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #45#return; {23#true} is VALID [2022-04-15 13:16:20,618 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret6 := main(); {23#true} is VALID [2022-04-15 13:16:20,618 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~j~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~k~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {23#true} is VALID [2022-04-15 13:16:20,619 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !!((~j~0 == ~n~0 && ~k~0 == ~n~0) && ~n~0 > 0); {28#(and (not (<= main_~n~0 0)) (= (+ main_~n~0 (* (- 1) main_~j~0)) 0))} is VALID [2022-04-15 13:16:20,620 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#(and (not (<= main_~n~0 0)) (= (+ main_~n~0 (* (- 1) main_~j~0)) 0))} assume !(~j~0 > 0 && ~n~0 > 0); {24#false} is VALID [2022-04-15 13:16:20,620 INFO L272 TraceCheckUtils]: 8: Hoare triple {24#false} call __VERIFIER_assert((if 0 == ~k~0 then 1 else 0)); {24#false} is VALID [2022-04-15 13:16:20,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-15 13:16:20,620 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-15 13:16:20,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-15 13:16:20,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:16:20,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:16:20,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157733047] [2022-04-15 13:16:20,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157733047] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:16:20,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:16:20,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:16:20,624 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:16:20,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [45814124] [2022-04-15 13:16:20,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [45814124] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:16:20,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:16:20,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:16:20,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100226282] [2022-04-15 13:16:20,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:16:20,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 13:16:20,629 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:16:20,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:20,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:16:20,643 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 13:16:20,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:16:20,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 13:16:20,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 13:16:20,659 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:20,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:16:20,752 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-15 13:16:20,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 13:16:20,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 13:16:20,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:16:20,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:20,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-04-15 13:16:20,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:20,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-04-15 13:16:20,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 39 transitions. [2022-04-15 13:16:20,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:16:20,799 INFO L225 Difference]: With dead ends: 33 [2022-04-15 13:16:20,799 INFO L226 Difference]: Without dead ends: 14 [2022-04-15 13:16:20,802 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:16:20,807 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:16:20,809 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 28 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:16:20,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-15 13:16:20,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-15 13:16:20,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:16:20,837 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:20,838 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:20,838 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:20,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:16:20,842 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 13:16:20,842 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 13:16:20,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:16:20,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:16:20,843 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 13:16:20,843 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 13:16:20,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:16:20,844 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 13:16:20,844 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 13:16:20,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:16:20,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:16:20,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:16:20,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:16:20,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:20,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-15 13:16:20,847 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-15 13:16:20,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:16:20,848 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-15 13:16:20,848 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:20,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-15 13:16:20,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:16:20,860 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 13:16:20,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 13:16:20,861 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:16:20,861 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:16:20,861 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 13:16:20,861 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:16:20,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:16:20,862 INFO L85 PathProgramCache]: Analyzing trace with hash -828987386, now seen corresponding path program 1 times [2022-04-15 13:16:20,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:16:20,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1621618238] [2022-04-15 13:16:21,050 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:16:21,052 INFO L85 PathProgramCache]: Analyzing trace with hash 28963623, now seen corresponding path program 1 times [2022-04-15 13:16:21,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:16:21,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135212668] [2022-04-15 13:16:21,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:16:21,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:16:21,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:16:21,087 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:16:21,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:16:21,118 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:16:21,119 INFO L85 PathProgramCache]: Analyzing trace with hash -828987386, now seen corresponding path program 2 times [2022-04-15 13:16:21,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:16:21,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570129775] [2022-04-15 13:16:21,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:16:21,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:16:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:16:21,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:16:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:16:21,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {166#(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(26, 2); {156#true} is VALID [2022-04-15 13:16:21,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-15 13:16:21,301 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {156#true} {156#true} #45#return; {156#true} is VALID [2022-04-15 13:16:21,302 INFO L272 TraceCheckUtils]: 0: Hoare triple {156#true} call ULTIMATE.init(); {166#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:16:21,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {166#(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(26, 2); {156#true} is VALID [2022-04-15 13:16:21,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-15 13:16:21,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {156#true} {156#true} #45#return; {156#true} is VALID [2022-04-15 13:16:21,303 INFO L272 TraceCheckUtils]: 4: Hoare triple {156#true} call #t~ret6 := main(); {156#true} is VALID [2022-04-15 13:16:21,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {156#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~j~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~k~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {156#true} is VALID [2022-04-15 13:16:21,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {156#true} assume !!((~j~0 == ~n~0 && ~k~0 == ~n~0) && ~n~0 > 0); {161#(and (not (<= main_~n~0 0)) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0) (= (+ main_~n~0 (* (- 1) main_~j~0)) 0))} is VALID [2022-04-15 13:16:21,304 INFO L290 TraceCheckUtils]: 7: Hoare triple {161#(and (not (<= main_~n~0 0)) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0) (= (+ main_~n~0 (* (- 1) main_~j~0)) 0))} assume !!(~j~0 > 0 && ~n~0 > 0);#t~post4 := ~j~0;~j~0 := #t~post4 - 1;havoc #t~post4;#t~post5 := ~k~0;~k~0 := #t~post5 - 1;havoc #t~post5; {162#(and (or (<= main_~k~0 0) (<= main_~k~0 main_~j~0)) (< 0 (+ main_~k~0 1)) (not (<= main_~n~0 0)))} is VALID [2022-04-15 13:16:21,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {162#(and (or (<= main_~k~0 0) (<= main_~k~0 main_~j~0)) (< 0 (+ main_~k~0 1)) (not (<= main_~n~0 0)))} assume !(~j~0 > 0 && ~n~0 > 0); {163#(and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0))} is VALID [2022-04-15 13:16:21,305 INFO L272 TraceCheckUtils]: 9: Hoare triple {163#(and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0))} call __VERIFIER_assert((if 0 == ~k~0 then 1 else 0)); {164#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:16:21,306 INFO L290 TraceCheckUtils]: 10: Hoare triple {164#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {165#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:16:21,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {165#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {157#false} is VALID [2022-04-15 13:16:21,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {157#false} assume !false; {157#false} is VALID [2022-04-15 13:16:21,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:16:21,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:16:21,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570129775] [2022-04-15 13:16:21,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570129775] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:16:21,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753676453] [2022-04-15 13:16:21,307 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:16:21,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:16:21,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:16:21,309 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:16:21,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 13:16:21,347 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:16:21,347 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:16:21,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 13:16:21,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:16:21,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:16:21,632 INFO L272 TraceCheckUtils]: 0: Hoare triple {156#true} call ULTIMATE.init(); {156#true} is VALID [2022-04-15 13:16:21,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {156#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(26, 2); {156#true} is VALID [2022-04-15 13:16:21,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-15 13:16:21,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {156#true} {156#true} #45#return; {156#true} is VALID [2022-04-15 13:16:21,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {156#true} call #t~ret6 := main(); {156#true} is VALID [2022-04-15 13:16:21,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {156#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~j~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~k~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {156#true} is VALID [2022-04-15 13:16:21,634 INFO L290 TraceCheckUtils]: 6: Hoare triple {156#true} assume !!((~j~0 == ~n~0 && ~k~0 == ~n~0) && ~n~0 > 0); {188#(and (< 0 main_~n~0) (= main_~n~0 main_~k~0) (<= main_~n~0 main_~j~0))} is VALID [2022-04-15 13:16:21,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {188#(and (< 0 main_~n~0) (= main_~n~0 main_~k~0) (<= main_~n~0 main_~j~0))} assume !!(~j~0 > 0 && ~n~0 > 0);#t~post4 := ~j~0;~j~0 := #t~post4 - 1;havoc #t~post4;#t~post5 := ~k~0;~k~0 := #t~post5 - 1;havoc #t~post5; {192#(and (< 0 main_~n~0) (= (+ main_~k~0 1) main_~n~0) (<= main_~n~0 (+ main_~j~0 1)))} is VALID [2022-04-15 13:16:21,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {192#(and (< 0 main_~n~0) (= (+ main_~k~0 1) main_~n~0) (<= main_~n~0 (+ main_~j~0 1)))} assume !(~j~0 > 0 && ~n~0 > 0); {163#(and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0))} is VALID [2022-04-15 13:16:21,636 INFO L272 TraceCheckUtils]: 9: Hoare triple {163#(and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0))} call __VERIFIER_assert((if 0 == ~k~0 then 1 else 0)); {199#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:16:21,636 INFO L290 TraceCheckUtils]: 10: Hoare triple {199#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {203#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:16:21,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {203#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {157#false} is VALID [2022-04-15 13:16:21,637 INFO L290 TraceCheckUtils]: 12: Hoare triple {157#false} assume !false; {157#false} is VALID [2022-04-15 13:16:21,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:16:21,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:16:21,838 INFO L290 TraceCheckUtils]: 12: Hoare triple {157#false} assume !false; {157#false} is VALID [2022-04-15 13:16:21,839 INFO L290 TraceCheckUtils]: 11: Hoare triple {203#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {157#false} is VALID [2022-04-15 13:16:21,840 INFO L290 TraceCheckUtils]: 10: Hoare triple {199#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {203#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:16:21,840 INFO L272 TraceCheckUtils]: 9: Hoare triple {163#(and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0))} call __VERIFIER_assert((if 0 == ~k~0 then 1 else 0)); {199#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:16:21,841 INFO L290 TraceCheckUtils]: 8: Hoare triple {222#(or (and (< 0 main_~n~0) (< 0 main_~j~0)) (and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0)))} assume !(~j~0 > 0 && ~n~0 > 0); {163#(and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0))} is VALID [2022-04-15 13:16:21,843 INFO L290 TraceCheckUtils]: 7: Hoare triple {226#(or (and (< 0 main_~n~0) (< 1 main_~j~0)) (and (<= main_~k~0 1) (< 0 main_~k~0)))} assume !!(~j~0 > 0 && ~n~0 > 0);#t~post4 := ~j~0;~j~0 := #t~post4 - 1;havoc #t~post4;#t~post5 := ~k~0;~k~0 := #t~post5 - 1;havoc #t~post5; {222#(or (and (< 0 main_~n~0) (< 0 main_~j~0)) (and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0)))} is VALID [2022-04-15 13:16:21,844 INFO L290 TraceCheckUtils]: 6: Hoare triple {156#true} assume !!((~j~0 == ~n~0 && ~k~0 == ~n~0) && ~n~0 > 0); {226#(or (and (< 0 main_~n~0) (< 1 main_~j~0)) (and (<= main_~k~0 1) (< 0 main_~k~0)))} is VALID [2022-04-15 13:16:21,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {156#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~j~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~k~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {156#true} is VALID [2022-04-15 13:16:21,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {156#true} call #t~ret6 := main(); {156#true} is VALID [2022-04-15 13:16:21,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {156#true} {156#true} #45#return; {156#true} is VALID [2022-04-15 13:16:21,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-15 13:16:21,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {156#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(26, 2); {156#true} is VALID [2022-04-15 13:16:21,844 INFO L272 TraceCheckUtils]: 0: Hoare triple {156#true} call ULTIMATE.init(); {156#true} is VALID [2022-04-15 13:16:21,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:16:21,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753676453] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:16:21,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:16:21,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-15 13:16:21,846 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:16:21,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1621618238] [2022-04-15 13:16:21,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1621618238] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:16:21,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:16:21,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 13:16:21,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855235337] [2022-04-15 13:16:21,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:16:21,847 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 13:16:21,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:16:21,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:21,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:16:21,856 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 13:16:21,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:16:21,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 13:16:21,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-04-15 13:16:21,857 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:22,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:16:22,004 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-15 13:16:22,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 13:16:22,004 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 13:16:22,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:16:22,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:22,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2022-04-15 13:16:22,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:22,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2022-04-15 13:16:22,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 20 transitions. [2022-04-15 13:16:22,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:16:22,022 INFO L225 Difference]: With dead ends: 20 [2022-04-15 13:16:22,022 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 13:16:22,022 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2022-04-15 13:16:22,023 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 11 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:16:22,023 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 37 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:16:22,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 13:16:22,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-15 13:16:22,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:16:22,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:22,029 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:22,029 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:22,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:16:22,030 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 13:16:22,030 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 13:16:22,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:16:22,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:16:22,030 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 13:16:22,030 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 13:16:22,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:16:22,031 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 13:16:22,031 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 13:16:22,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:16:22,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:16:22,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:16:22,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:16:22,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:22,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-15 13:16:22,032 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-15 13:16:22,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:16:22,032 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-15 13:16:22,032 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:22,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-15 13:16:22,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:16:22,043 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 13:16:22,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 13:16:22,043 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:16:22,044 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:16:22,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 13:16:22,257 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:16:22,257 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:16:22,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:16:22,257 INFO L85 PathProgramCache]: Analyzing trace with hash 106583640, now seen corresponding path program 3 times [2022-04-15 13:16:22,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:16:22,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1783679584] [2022-04-15 13:16:22,382 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:16:22,383 INFO L85 PathProgramCache]: Analyzing trace with hash 88068967, now seen corresponding path program 1 times [2022-04-15 13:16:22,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:16:22,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846244859] [2022-04-15 13:16:22,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:16:22,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:16:22,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:16:22,392 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:16:22,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:16:22,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:16:22,399 INFO L85 PathProgramCache]: Analyzing trace with hash 106583640, now seen corresponding path program 4 times [2022-04-15 13:16:22,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:16:22,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266482244] [2022-04-15 13:16:22,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:16:22,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:16:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:16:22,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:16:22,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:16:22,506 INFO L290 TraceCheckUtils]: 0: Hoare triple {371#(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(26, 2); {360#true} is VALID [2022-04-15 13:16:22,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {360#true} assume true; {360#true} is VALID [2022-04-15 13:16:22,507 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {360#true} {360#true} #45#return; {360#true} is VALID [2022-04-15 13:16:22,507 INFO L272 TraceCheckUtils]: 0: Hoare triple {360#true} call ULTIMATE.init(); {371#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:16:22,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {371#(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(26, 2); {360#true} is VALID [2022-04-15 13:16:22,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {360#true} assume true; {360#true} is VALID [2022-04-15 13:16:22,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {360#true} {360#true} #45#return; {360#true} is VALID [2022-04-15 13:16:22,508 INFO L272 TraceCheckUtils]: 4: Hoare triple {360#true} call #t~ret6 := main(); {360#true} is VALID [2022-04-15 13:16:22,508 INFO L290 TraceCheckUtils]: 5: Hoare triple {360#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~j~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~k~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {360#true} is VALID [2022-04-15 13:16:22,521 INFO L290 TraceCheckUtils]: 6: Hoare triple {360#true} assume !!((~j~0 == ~n~0 && ~k~0 == ~n~0) && ~n~0 > 0); {365#(and (not (<= main_~n~0 0)) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0) (= (+ main_~n~0 (* (- 1) main_~j~0)) 0))} is VALID [2022-04-15 13:16:22,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {365#(and (not (<= main_~n~0 0)) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0) (= (+ main_~n~0 (* (- 1) main_~j~0)) 0))} assume !!(~j~0 > 0 && ~n~0 > 0);#t~post4 := ~j~0;~j~0 := #t~post4 - 1;havoc #t~post4;#t~post5 := ~k~0;~k~0 := #t~post5 - 1;havoc #t~post5; {366#(and (not (<= main_~n~0 0)) (<= main_~k~0 main_~j~0) (<= main_~j~0 main_~k~0))} is VALID [2022-04-15 13:16:22,524 INFO L290 TraceCheckUtils]: 8: Hoare triple {366#(and (not (<= main_~n~0 0)) (<= main_~k~0 main_~j~0) (<= main_~j~0 main_~k~0))} assume !!(~j~0 > 0 && ~n~0 > 0);#t~post4 := ~j~0;~j~0 := #t~post4 - 1;havoc #t~post4;#t~post5 := ~k~0;~k~0 := #t~post5 - 1;havoc #t~post5; {367#(and (or (<= main_~k~0 0) (<= main_~k~0 main_~j~0)) (< 0 (+ main_~k~0 1)) (not (<= main_~n~0 0)))} is VALID [2022-04-15 13:16:22,525 INFO L290 TraceCheckUtils]: 9: Hoare triple {367#(and (or (<= main_~k~0 0) (<= main_~k~0 main_~j~0)) (< 0 (+ main_~k~0 1)) (not (<= main_~n~0 0)))} assume !(~j~0 > 0 && ~n~0 > 0); {368#(and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0))} is VALID [2022-04-15 13:16:22,525 INFO L272 TraceCheckUtils]: 10: Hoare triple {368#(and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0))} call __VERIFIER_assert((if 0 == ~k~0 then 1 else 0)); {369#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:16:22,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {369#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {370#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:16:22,526 INFO L290 TraceCheckUtils]: 12: Hoare triple {370#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {361#false} is VALID [2022-04-15 13:16:22,526 INFO L290 TraceCheckUtils]: 13: Hoare triple {361#false} assume !false; {361#false} is VALID [2022-04-15 13:16:22,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:16:22,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:16:22,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266482244] [2022-04-15 13:16:22,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266482244] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:16:22,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102354537] [2022-04-15 13:16:22,527 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:16:22,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:16:22,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:16:22,528 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:16:22,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 13:16:22,553 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:16:22,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:16:22,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 13:16:22,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:16:22,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:16:22,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {360#true} call ULTIMATE.init(); {360#true} is VALID [2022-04-15 13:16:22,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {360#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(26, 2); {360#true} is VALID [2022-04-15 13:16:22,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {360#true} assume true; {360#true} is VALID [2022-04-15 13:16:22,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {360#true} {360#true} #45#return; {360#true} is VALID [2022-04-15 13:16:22,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {360#true} call #t~ret6 := main(); {360#true} is VALID [2022-04-15 13:16:22,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {360#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~j~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~k~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {360#true} is VALID [2022-04-15 13:16:22,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {360#true} assume !!((~j~0 == ~n~0 && ~k~0 == ~n~0) && ~n~0 > 0); {365#(and (not (<= main_~n~0 0)) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0) (= (+ main_~n~0 (* (- 1) main_~j~0)) 0))} is VALID [2022-04-15 13:16:22,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {365#(and (not (<= main_~n~0 0)) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0) (= (+ main_~n~0 (* (- 1) main_~j~0)) 0))} assume !!(~j~0 > 0 && ~n~0 > 0);#t~post4 := ~j~0;~j~0 := #t~post4 - 1;havoc #t~post4;#t~post5 := ~k~0;~k~0 := #t~post5 - 1;havoc #t~post5; {396#(and (not (<= main_~n~0 0)) (<= main_~n~0 (+ main_~k~0 1)) (<= (+ main_~k~0 1) main_~n~0) (= main_~n~0 (+ main_~j~0 1)))} is VALID [2022-04-15 13:16:22,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {396#(and (not (<= main_~n~0 0)) (<= main_~n~0 (+ main_~k~0 1)) (<= (+ main_~k~0 1) main_~n~0) (= main_~n~0 (+ main_~j~0 1)))} assume !!(~j~0 > 0 && ~n~0 > 0);#t~post4 := ~j~0;~j~0 := #t~post4 - 1;havoc #t~post4;#t~post5 := ~k~0;~k~0 := #t~post5 - 1;havoc #t~post5; {400#(and (<= main_~n~0 (+ main_~k~0 2)) (<= main_~n~0 (+ main_~j~0 2)) (< 1 main_~n~0) (<= (+ main_~k~0 2) main_~n~0))} is VALID [2022-04-15 13:16:22,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {400#(and (<= main_~n~0 (+ main_~k~0 2)) (<= main_~n~0 (+ main_~j~0 2)) (< 1 main_~n~0) (<= (+ main_~k~0 2) main_~n~0))} assume !(~j~0 > 0 && ~n~0 > 0); {368#(and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0))} is VALID [2022-04-15 13:16:22,761 INFO L272 TraceCheckUtils]: 10: Hoare triple {368#(and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0))} call __VERIFIER_assert((if 0 == ~k~0 then 1 else 0)); {407#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:16:22,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {407#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {411#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:16:22,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {411#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {361#false} is VALID [2022-04-15 13:16:22,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {361#false} assume !false; {361#false} is VALID [2022-04-15 13:16:22,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:16:22,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:16:22,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {361#false} assume !false; {361#false} is VALID [2022-04-15 13:16:22,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {411#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {361#false} is VALID [2022-04-15 13:16:22,971 INFO L290 TraceCheckUtils]: 11: Hoare triple {407#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {411#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:16:22,971 INFO L272 TraceCheckUtils]: 10: Hoare triple {368#(and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0))} call __VERIFIER_assert((if 0 == ~k~0 then 1 else 0)); {407#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:16:22,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {430#(or (and (< 0 main_~n~0) (< 0 main_~j~0)) (and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0)))} assume !(~j~0 > 0 && ~n~0 > 0); {368#(and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0))} is VALID [2022-04-15 13:16:22,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {434#(or (and (< 0 main_~n~0) (< 1 main_~j~0)) (and (<= main_~k~0 1) (< 0 main_~k~0)) (not (< 0 main_~j~0)))} assume !!(~j~0 > 0 && ~n~0 > 0);#t~post4 := ~j~0;~j~0 := #t~post4 - 1;havoc #t~post4;#t~post5 := ~k~0;~k~0 := #t~post5 - 1;havoc #t~post5; {430#(or (and (< 0 main_~n~0) (< 0 main_~j~0)) (and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0)))} is VALID [2022-04-15 13:16:22,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {438#(or (not (< 1 main_~j~0)) (and (< 0 main_~n~0) (< 2 main_~j~0)) (and (< 1 main_~k~0) (<= main_~k~0 2)))} assume !!(~j~0 > 0 && ~n~0 > 0);#t~post4 := ~j~0;~j~0 := #t~post4 - 1;havoc #t~post4;#t~post5 := ~k~0;~k~0 := #t~post5 - 1;havoc #t~post5; {434#(or (and (< 0 main_~n~0) (< 1 main_~j~0)) (and (<= main_~k~0 1) (< 0 main_~k~0)) (not (< 0 main_~j~0)))} is VALID [2022-04-15 13:16:22,974 INFO L290 TraceCheckUtils]: 6: Hoare triple {360#true} assume !!((~j~0 == ~n~0 && ~k~0 == ~n~0) && ~n~0 > 0); {438#(or (not (< 1 main_~j~0)) (and (< 0 main_~n~0) (< 2 main_~j~0)) (and (< 1 main_~k~0) (<= main_~k~0 2)))} is VALID [2022-04-15 13:16:22,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {360#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~j~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~k~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {360#true} is VALID [2022-04-15 13:16:22,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {360#true} call #t~ret6 := main(); {360#true} is VALID [2022-04-15 13:16:22,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {360#true} {360#true} #45#return; {360#true} is VALID [2022-04-15 13:16:22,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {360#true} assume true; {360#true} is VALID [2022-04-15 13:16:22,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {360#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(26, 2); {360#true} is VALID [2022-04-15 13:16:22,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {360#true} call ULTIMATE.init(); {360#true} is VALID [2022-04-15 13:16:22,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:16:22,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102354537] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:16:22,975 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:16:22,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-15 13:16:22,975 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:16:22,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1783679584] [2022-04-15 13:16:22,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1783679584] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:16:22,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:16:22,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 13:16:22,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767631046] [2022-04-15 13:16:22,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:16:22,976 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 13:16:22,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:16:22,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:22,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:16:22,985 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 13:16:22,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:16:22,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 13:16:22,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-04-15 13:16:22,986 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:23,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:16:23,148 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 13:16:23,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 13:16:23,148 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 13:16:23,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:16:23,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:23,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2022-04-15 13:16:23,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:23,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2022-04-15 13:16:23,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 14 transitions. [2022-04-15 13:16:23,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:16:23,160 INFO L225 Difference]: With dead ends: 15 [2022-04-15 13:16:23,160 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 13:16:23,161 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2022-04-15 13:16:23,161 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 7 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:16:23,161 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 40 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:16:23,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 13:16:23,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 13:16:23,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:16:23,162 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 13:16:23,162 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 13:16:23,162 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 13:16:23,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:16:23,162 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 13:16:23,162 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 13:16:23,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:16:23,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:16:23,163 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 13:16:23,163 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 13:16:23,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:16:23,163 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 13:16:23,163 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 13:16:23,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:16:23,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:16:23,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:16:23,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:16:23,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 13:16:23,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 13:16:23,163 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-04-15 13:16:23,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:16:23,163 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 13:16:23,164 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:23,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 13:16:23,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:16:23,164 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 13:16:23,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:16:23,166 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 13:16:23,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 13:16:23,381 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-15 13:16:23,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 13:16:23,446 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 11) no Hoare annotation was computed. [2022-04-15 13:16:23,446 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 11) no Hoare annotation was computed. [2022-04-15 13:16:23,446 INFO L882 garLoopResultBuilder]: For program point L11-1(line 11) no Hoare annotation was computed. [2022-04-15 13:16:23,446 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 19 29) the Hoare annotation is: true [2022-04-15 13:16:23,446 INFO L885 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true [2022-04-15 13:16:23,447 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 19 29) the Hoare annotation is: true [2022-04-15 13:16:23,447 INFO L885 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: true [2022-04-15 13:16:23,447 INFO L878 garLoopResultBuilder]: At program point L24-2(lines 24 26) the Hoare annotation is: (and (< 0 (+ main_~k~0 1)) (not (<= main_~n~0 0)) (<= main_~k~0 main_~j~0) (<= main_~j~0 main_~k~0)) [2022-04-15 13:16:23,447 INFO L878 garLoopResultBuilder]: At program point L24-3(lines 24 26) the Hoare annotation is: (and (< 0 (+ main_~k~0 1)) (not (<= main_~n~0 0)) (<= main_~k~0 0)) [2022-04-15 13:16:23,447 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 19 29) the Hoare annotation is: true [2022-04-15 13:16:23,447 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 13:16:23,447 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 13:16:23,447 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 13:16:23,447 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 13:16:23,447 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 13:16:23,447 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 13:16:23,447 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 13:16:23,447 INFO L878 garLoopResultBuilder]: At program point L16(line 16) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-15 13:16:23,447 INFO L878 garLoopResultBuilder]: At program point L15(lines 15 17) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-15 13:16:23,448 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 18) the Hoare annotation is: true [2022-04-15 13:16:23,448 INFO L885 garLoopResultBuilder]: At program point L15-2(lines 14 18) the Hoare annotation is: true [2022-04-15 13:16:23,448 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 18) the Hoare annotation is: true [2022-04-15 13:16:23,448 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-15 13:16:23,450 INFO L719 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1] [2022-04-15 13:16:23,450 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 13:16:23,453 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 13:16:23,453 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 13:16:23,453 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2022-04-15 13:16:23,458 INFO L163 areAnnotationChecker]: CFG has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 13:16:23,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 01:16:23 BoogieIcfgContainer [2022-04-15 13:16:23,464 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 13:16:23,465 INFO L158 Benchmark]: Toolchain (without parser) took 3576.94ms. Allocated memory was 217.1MB in the beginning and 261.1MB in the end (delta: 44.0MB). Free memory was 193.3MB in the beginning and 151.0MB in the end (delta: 42.3MB). Peak memory consumption was 86.4MB. Max. memory is 8.0GB. [2022-04-15 13:16:23,465 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 217.1MB. Free memory is still 180.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 13:16:23,465 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.53ms. Allocated memory is still 217.1MB. Free memory was 193.3MB in the beginning and 192.4MB in the end (delta: 823.5kB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. [2022-04-15 13:16:23,466 INFO L158 Benchmark]: Boogie Preprocessor took 35.01ms. Allocated memory is still 217.1MB. Free memory was 192.4MB in the beginning and 190.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 13:16:23,466 INFO L158 Benchmark]: RCFGBuilder took 260.87ms. Allocated memory is still 217.1MB. Free memory was 190.5MB in the beginning and 179.6MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 13:16:23,466 INFO L158 Benchmark]: TraceAbstraction took 3088.37ms. Allocated memory was 217.1MB in the beginning and 261.1MB in the end (delta: 44.0MB). Free memory was 179.3MB in the beginning and 151.0MB in the end (delta: 28.3MB). Peak memory consumption was 73.1MB. Max. memory is 8.0GB. [2022-04-15 13:16:23,467 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.15ms. Allocated memory is still 217.1MB. Free memory is still 180.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 189.53ms. Allocated memory is still 217.1MB. Free memory was 193.3MB in the beginning and 192.4MB in the end (delta: 823.5kB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.01ms. Allocated memory is still 217.1MB. Free memory was 192.4MB in the beginning and 190.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 260.87ms. Allocated memory is still 217.1MB. Free memory was 190.5MB in the beginning and 179.6MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3088.37ms. Allocated memory was 217.1MB in the beginning and 261.1MB in the end (delta: 44.0MB). Free memory was 179.3MB in the beginning and 151.0MB in the end (delta: 28.3MB). Peak memory consumption was 73.1MB. 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: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 105 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 68 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 89 IncrementalHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 37 mSDtfsCounter, 89 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 32 PreInvPairs, 45 NumberOfFragments, 64 HoareAnnotationTreeSize, 32 FomulaSimplifications, 33 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 40 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: 24]: Loop Invariant Derived loop invariant: ((0 < k + 1 && !(n <= 0)) && k <= j) && j <= k - ProcedureContractResult [Line: 19]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-15 13:16:23,492 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...