/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/id_build.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 03:53:38,089 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 03:53:38,090 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 03:53:38,124 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 03:53:38,124 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 03:53:38,125 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 03:53:38,127 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 03:53:38,129 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 03:53:38,130 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 03:53:38,133 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 03:53:38,134 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 03:53:38,135 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 03:53:38,135 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 03:53:38,136 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 03:53:38,137 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 03:53:38,139 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 03:53:38,139 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 03:53:38,140 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 03:53:38,141 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 03:53:38,143 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 03:53:38,156 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 03:53:38,157 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 03:53:38,158 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 03:53:38,158 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 03:53:38,159 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 03:53:38,164 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 03:53:38,165 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 03:53:38,165 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 03:53:38,165 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 03:53:38,165 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 03:53:38,166 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 03:53:38,166 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 03:53:38,168 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 03:53:38,168 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 03:53:38,168 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 03:53:38,169 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 03:53:38,169 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 03:53:38,169 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 03:53:38,169 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 03:53:38,169 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 03:53:38,170 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 03:53:38,171 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 03:53:38,171 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 03:53:38,178 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 03:53:38,178 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 03:53:38,179 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 03:53:38,179 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 03:53:38,179 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 03:53:38,179 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 03:53:38,179 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 03:53:38,179 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 03:53:38,179 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 03:53:38,180 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 03:53:38,180 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 03:53:38,180 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 03:53:38,180 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 03:53:38,180 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 03:53:38,180 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 03:53:38,180 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 03:53:38,181 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 03:53:38,181 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 03:53:38,181 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:53:38,181 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 03:53:38,181 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 03:53:38,181 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 03:53:38,181 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 03:53:38,181 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 03:53:38,181 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 03:53:38,181 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-08 03:53:38,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 03:53:38,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 03:53:38,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 03:53:38,359 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 03:53:38,361 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 03:53:38,362 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/id_build.i [2022-04-08 03:53:38,409 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03bd0897b/94c3fb12055b49aca32f177e406b47fd/FLAG803a0ff8c [2022-04-08 03:53:38,744 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 03:53:38,745 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/id_build.i [2022-04-08 03:53:38,748 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03bd0897b/94c3fb12055b49aca32f177e406b47fd/FLAG803a0ff8c [2022-04-08 03:53:39,179 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03bd0897b/94c3fb12055b49aca32f177e406b47fd [2022-04-08 03:53:39,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 03:53:39,182 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 03:53:39,184 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 03:53:39,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 03:53:39,186 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 03:53:39,187 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:53:39" (1/1) ... [2022-04-08 03:53:39,188 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a54a947 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:39, skipping insertion in model container [2022-04-08 03:53:39,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:53:39" (1/1) ... [2022-04-08 03:53:39,192 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 03:53:39,202 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 03:53:39,323 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-invgen/id_build.i[893,906] [2022-04-08 03:53:39,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:53:39,350 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 03:53:39,361 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-invgen/id_build.i[893,906] [2022-04-08 03:53:39,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:53:39,371 INFO L208 MainTranslator]: Completed translation [2022-04-08 03:53:39,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:39 WrapperNode [2022-04-08 03:53:39,372 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 03:53:39,372 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 03:53:39,372 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 03:53:39,372 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 03:53:39,381 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:39" (1/1) ... [2022-04-08 03:53:39,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:39" (1/1) ... [2022-04-08 03:53:39,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:39" (1/1) ... [2022-04-08 03:53:39,386 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:39" (1/1) ... [2022-04-08 03:53:39,394 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:39" (1/1) ... [2022-04-08 03:53:39,398 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:39" (1/1) ... [2022-04-08 03:53:39,399 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:39" (1/1) ... [2022-04-08 03:53:39,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 03:53:39,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 03:53:39,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 03:53:39,404 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 03:53:39,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:39" (1/1) ... [2022-04-08 03:53:39,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:53:39,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:53:39,426 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-08 03:53:39,427 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-08 03:53:39,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 03:53:39,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 03:53:39,449 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 03:53:39,449 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 03:53:39,449 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 03:53:39,449 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 03:53:39,449 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 03:53:39,449 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 03:53:39,449 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 03:53:39,449 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 03:53:39,449 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 03:53:39,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 03:53:39,450 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 03:53:39,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 03:53:39,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 03:53:39,450 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 03:53:39,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 03:53:39,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 03:53:39,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 03:53:39,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 03:53:39,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 03:53:39,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 03:53:39,491 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 03:53:39,492 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 03:53:39,597 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 03:53:39,603 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 03:53:39,604 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 03:53:39,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:53:39 BoogieIcfgContainer [2022-04-08 03:53:39,605 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 03:53:39,611 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 03:53:39,611 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 03:53:39,621 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 03:53:39,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 03:53:39" (1/3) ... [2022-04-08 03:53:39,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2667a3ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:53:39, skipping insertion in model container [2022-04-08 03:53:39,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:39" (2/3) ... [2022-04-08 03:53:39,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2667a3ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:53:39, skipping insertion in model container [2022-04-08 03:53:39,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:53:39" (3/3) ... [2022-04-08 03:53:39,624 INFO L111 eAbstractionObserver]: Analyzing ICFG id_build.i [2022-04-08 03:53:39,629 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 03:53:39,629 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 03:53:39,670 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 03:53:39,682 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-08 03:53:39,682 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 03:53:39,700 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 03:53:39,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 03:53:39,706 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:53:39,706 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:53:39,707 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:53:39,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:53:39,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1608162196, now seen corresponding path program 1 times [2022-04-08 03:53:39,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:39,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1124906562] [2022-04-08 03:53:39,728 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:53:39,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1608162196, now seen corresponding path program 2 times [2022-04-08 03:53:39,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:53:39,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429166435] [2022-04-08 03:53:39,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:53:39,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:53:39,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:39,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:53:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:39,945 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {26#true} is VALID [2022-04-08 03:53:39,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-08 03:53:39,946 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #66#return; {26#true} is VALID [2022-04-08 03:53:39,948 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {34#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:53:39,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {26#true} is VALID [2022-04-08 03:53:39,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-08 03:53:39,948 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #66#return; {26#true} is VALID [2022-04-08 03:53:39,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret4 := main(); {26#true} is VALID [2022-04-08 03:53:39,949 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} havoc ~offset~0;havoc ~length~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~nlen~0 := #t~nondet1;havoc #t~nondet1;havoc ~i~0;havoc ~j~0;~i~0 := 0; {26#true} is VALID [2022-04-08 03:53:39,950 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !!(~i~0 < ~nlen~0);~j~0 := 0; {31#(< main_~i~0 main_~nlen~0)} is VALID [2022-04-08 03:53:39,950 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#(< main_~i~0 main_~nlen~0)} assume !!(~j~0 < 8); {31#(< main_~i~0 main_~nlen~0)} is VALID [2022-04-08 03:53:39,951 INFO L272 TraceCheckUtils]: 8: Hoare triple {31#(< main_~i~0 main_~nlen~0)} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {32#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:53:39,952 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {33#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:53:39,953 INFO L290 TraceCheckUtils]: 10: Hoare triple {33#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {27#false} is VALID [2022-04-08 03:53:39,953 INFO L290 TraceCheckUtils]: 11: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-08 03:53:39,953 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-08 03:53:39,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:53:39,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429166435] [2022-04-08 03:53:39,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429166435] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:39,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:39,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:53:39,957 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:53:39,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1124906562] [2022-04-08 03:53:39,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1124906562] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:39,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:39,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:53:39,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823532005] [2022-04-08 03:53:39,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:53:39,963 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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-08 03:53:39,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:53:39,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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-08 03:53:39,988 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-08 03:53:39,989 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 03:53:39,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:40,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 03:53:40,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 03:53:40,005 INFO L87 Difference]: Start difference. First operand has 23 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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-08 03:53:40,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:40,252 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2022-04-08 03:53:40,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 03:53:40,252 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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-08 03:53:40,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:53:40,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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-08 03:53:40,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2022-04-08 03:53:40,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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-08 03:53:40,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2022-04-08 03:53:40,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 56 transitions. [2022-04-08 03:53:40,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:40,308 INFO L225 Difference]: With dead ends: 44 [2022-04-08 03:53:40,309 INFO L226 Difference]: Without dead ends: 22 [2022-04-08 03:53:40,310 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-08 03:53:40,313 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 24 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:53:40,313 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 41 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:53:40,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-08 03:53:40,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-08 03:53:40,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:53:40,337 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:53:40,337 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:53:40,338 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:53:40,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:40,340 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-08 03:53:40,340 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-08 03:53:40,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:40,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:40,341 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-04-08 03:53:40,341 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-04-08 03:53:40,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:40,343 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-08 03:53:40,343 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-08 03:53:40,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:40,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:40,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:53:40,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:53:40,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:53:40,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-04-08 03:53:40,346 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 12 [2022-04-08 03:53:40,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:53:40,346 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-04-08 03:53:40,347 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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-08 03:53:40,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 23 transitions. [2022-04-08 03:53:40,367 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:40,368 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-08 03:53:40,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 03:53:40,368 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:53:40,368 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:53:40,369 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 03:53:40,369 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:53:40,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:53:40,370 INFO L85 PathProgramCache]: Analyzing trace with hash 544405863, now seen corresponding path program 1 times [2022-04-08 03:53:40,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:40,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1213433166] [2022-04-08 03:53:40,371 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:53:40,371 INFO L85 PathProgramCache]: Analyzing trace with hash 544405863, now seen corresponding path program 2 times [2022-04-08 03:53:40,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:53:40,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116552291] [2022-04-08 03:53:40,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:53:40,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:53:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:40,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:53:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:40,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {233#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {221#true} is VALID [2022-04-08 03:53:40,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {221#true} assume true; {221#true} is VALID [2022-04-08 03:53:40,452 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {221#true} {221#true} #66#return; {221#true} is VALID [2022-04-08 03:53:40,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-08 03:53:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:40,475 INFO L290 TraceCheckUtils]: 0: Hoare triple {221#true} ~cond := #in~cond; {221#true} is VALID [2022-04-08 03:53:40,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {221#true} assume !(0 == ~cond); {221#true} is VALID [2022-04-08 03:53:40,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {221#true} assume true; {221#true} is VALID [2022-04-08 03:53:40,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {221#true} {226#(< 0 (+ main_~i~0 1))} #62#return; {226#(< 0 (+ main_~i~0 1))} is VALID [2022-04-08 03:53:40,476 INFO L272 TraceCheckUtils]: 0: Hoare triple {221#true} call ULTIMATE.init(); {233#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:53:40,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {233#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {221#true} is VALID [2022-04-08 03:53:40,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {221#true} assume true; {221#true} is VALID [2022-04-08 03:53:40,477 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {221#true} {221#true} #66#return; {221#true} is VALID [2022-04-08 03:53:40,477 INFO L272 TraceCheckUtils]: 4: Hoare triple {221#true} call #t~ret4 := main(); {221#true} is VALID [2022-04-08 03:53:40,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {221#true} havoc ~offset~0;havoc ~length~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~nlen~0 := #t~nondet1;havoc #t~nondet1;havoc ~i~0;havoc ~j~0;~i~0 := 0; {226#(< 0 (+ main_~i~0 1))} is VALID [2022-04-08 03:53:40,484 INFO L290 TraceCheckUtils]: 6: Hoare triple {226#(< 0 (+ main_~i~0 1))} assume !!(~i~0 < ~nlen~0);~j~0 := 0; {226#(< 0 (+ main_~i~0 1))} is VALID [2022-04-08 03:53:40,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {226#(< 0 (+ main_~i~0 1))} assume !!(~j~0 < 8); {226#(< 0 (+ main_~i~0 1))} is VALID [2022-04-08 03:53:40,484 INFO L272 TraceCheckUtils]: 8: Hoare triple {226#(< 0 (+ main_~i~0 1))} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {221#true} is VALID [2022-04-08 03:53:40,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {221#true} ~cond := #in~cond; {221#true} is VALID [2022-04-08 03:53:40,485 INFO L290 TraceCheckUtils]: 10: Hoare triple {221#true} assume !(0 == ~cond); {221#true} is VALID [2022-04-08 03:53:40,485 INFO L290 TraceCheckUtils]: 11: Hoare triple {221#true} assume true; {221#true} is VALID [2022-04-08 03:53:40,485 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {221#true} {226#(< 0 (+ main_~i~0 1))} #62#return; {226#(< 0 (+ main_~i~0 1))} is VALID [2022-04-08 03:53:40,486 INFO L272 TraceCheckUtils]: 13: Hoare triple {226#(< 0 (+ main_~i~0 1))} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {231#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:53:40,487 INFO L290 TraceCheckUtils]: 14: Hoare triple {231#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {232#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:53:40,487 INFO L290 TraceCheckUtils]: 15: Hoare triple {232#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {222#false} is VALID [2022-04-08 03:53:40,487 INFO L290 TraceCheckUtils]: 16: Hoare triple {222#false} assume !false; {222#false} is VALID [2022-04-08 03:53:40,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:53:40,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:53:40,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116552291] [2022-04-08 03:53:40,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116552291] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:40,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:40,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:53:40,488 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:53:40,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1213433166] [2022-04-08 03:53:40,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1213433166] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:40,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:40,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:53:40,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074947113] [2022-04-08 03:53:40,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:53:40,490 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-08 03:53:40,490 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:53:40,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:53:40,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:40,502 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 03:53:40,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:40,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 03:53:40,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 03:53:40,504 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:53:40,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:40,677 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-08 03:53:40,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 03:53:40,678 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-08 03:53:40,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:53:40,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:53:40,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2022-04-08 03:53:40,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:53:40,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2022-04-08 03:53:40,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 23 transitions. [2022-04-08 03:53:40,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:40,714 INFO L225 Difference]: With dead ends: 22 [2022-04-08 03:53:40,714 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 03:53:40,715 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-08 03:53:40,722 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 14 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:53:40,723 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 32 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:53:40,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 03:53:40,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 03:53:40,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:53:40,726 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-08 03:53:40,726 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-08 03:53:40,726 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-08 03:53:40,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:40,726 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 03:53:40,727 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 03:53:40,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:40,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:40,727 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-08 03:53:40,727 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-08 03:53:40,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:40,727 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 03:53:40,727 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 03:53:40,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:40,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:40,728 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:53:40,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:53:40,728 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-08 03:53:40,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 03:53:40,729 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2022-04-08 03:53:40,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:53:40,729 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 03:53:40,729 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:53:40,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 03:53:40,729 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-08 03:53:40,729 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 03:53:40,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:40,733 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 03:53:40,733 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 03:53:40,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 03:53:40,841 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-08 03:53:40,841 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-08 03:53:40,842 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-08 03:53:40,842 INFO L882 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-08 03:53:40,842 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-08 03:53:40,842 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-08 03:53:40,842 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-08 03:53:40,842 INFO L878 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: (and (< 0 (+ main_~i~0 1)) (< main_~i~0 main_~nlen~0)) [2022-04-08 03:53:40,843 INFO L878 garLoopResultBuilder]: At program point L29-1(line 29) the Hoare annotation is: (and (< 0 (+ main_~i~0 1)) (< main_~i~0 main_~nlen~0)) [2022-04-08 03:53:40,843 INFO L878 garLoopResultBuilder]: At program point L27-2(lines 27 32) the Hoare annotation is: (and (< 0 (+ main_~i~0 1)) (< main_~i~0 main_~nlen~0)) [2022-04-08 03:53:40,843 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 24 34) the Hoare annotation is: true [2022-04-08 03:53:40,843 INFO L878 garLoopResultBuilder]: At program point L27-3(lines 27 32) the Hoare annotation is: (< 0 (+ main_~i~0 1)) [2022-04-08 03:53:40,843 INFO L885 garLoopResultBuilder]: At program point L27-4(lines 27 32) the Hoare annotation is: true [2022-04-08 03:53:40,843 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 24 34) the Hoare annotation is: true [2022-04-08 03:53:40,843 INFO L878 garLoopResultBuilder]: At program point L30(lines 28 31) the Hoare annotation is: (and (< 0 (+ main_~i~0 1)) (< main_~i~0 main_~nlen~0)) [2022-04-08 03:53:40,844 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 24 34) the Hoare annotation is: true [2022-04-08 03:53:40,844 INFO L878 garLoopResultBuilder]: At program point L28-2(lines 28 31) the Hoare annotation is: (and (< 0 (+ main_~i~0 1)) (< main_~i~0 main_~nlen~0)) [2022-04-08 03:53:40,844 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 03:53:40,844 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-08 03:53:40,844 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 03:53:40,844 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 03:53:40,844 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 03:53:40,844 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 03:53:40,845 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 03:53:40,845 INFO L878 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-08 03:53:40,845 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-08 03:53:40,845 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-08 03:53:40,845 INFO L878 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 03:53:40,845 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 03:53:40,845 INFO L878 garLoopResultBuilder]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-08 03:53:40,848 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2] [2022-04-08 03:53:40,850 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 03:53:40,853 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 03:53:40,853 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 03:53:40,854 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 03:53:40,855 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-08 03:53:40,855 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 03:53:40,855 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 03:53:40,857 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-08 03:53:40,866 INFO L163 areAnnotationChecker]: CFG has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 03:53:40,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 03:53:40 BoogieIcfgContainer [2022-04-08 03:53:40,874 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 03:53:40,875 INFO L158 Benchmark]: Toolchain (without parser) took 1692.97ms. Allocated memory was 167.8MB in the beginning and 231.7MB in the end (delta: 64.0MB). Free memory was 111.5MB in the beginning and 179.8MB in the end (delta: -68.3MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 03:53:40,875 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 167.8MB. Free memory was 127.7MB in the beginning and 127.6MB in the end (delta: 143.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 03:53:40,876 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.75ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 143.9MB in the end (delta: -32.5MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2022-04-08 03:53:40,876 INFO L158 Benchmark]: Boogie Preprocessor took 31.00ms. Allocated memory is still 167.8MB. Free memory was 143.9MB in the beginning and 142.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 03:53:40,876 INFO L158 Benchmark]: RCFGBuilder took 201.51ms. Allocated memory is still 167.8MB. Free memory was 141.8MB in the beginning and 131.2MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 03:53:40,877 INFO L158 Benchmark]: TraceAbstraction took 1262.58ms. Allocated memory was 167.8MB in the beginning and 231.7MB in the end (delta: 64.0MB). Free memory was 130.8MB in the beginning and 179.8MB in the end (delta: -49.0MB). Peak memory consumption was 15.9MB. Max. memory is 8.0GB. [2022-04-08 03:53:40,878 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 167.8MB. Free memory was 127.7MB in the beginning and 127.6MB in the end (delta: 143.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 187.75ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 143.9MB in the end (delta: -32.5MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.00ms. Allocated memory is still 167.8MB. Free memory was 143.9MB in the beginning and 142.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 201.51ms. Allocated memory is still 167.8MB. Free memory was 141.8MB in the beginning and 131.2MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1262.58ms. Allocated memory was 167.8MB in the beginning and 231.7MB in the end (delta: 64.0MB). Free memory was 130.8MB in the beginning and 179.8MB in the end (delta: -49.0MB). Peak memory consumption was 15.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 38 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38 mSDsluCounter, 73 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 93 IncrementalHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 35 mSDtfsCounter, 93 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, InterpolantAutomatonStates: 14, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 41 PreInvPairs, 56 NumberOfFragments, 98 HoareAnnotationTreeSize, 41 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 23 FomulaSimplificationsInter, 15 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: 0 < i + 1 && i < nlen - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 0 < i + 1 - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! [2022-04-08 03:53:40,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...