/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/loops-crafted-1/net_reset.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:25:27,945 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:25:27,947 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:25:28,007 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:25:28,008 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:25:28,009 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:25:28,010 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:25:28,012 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:25:28,013 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:25:28,014 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:25:28,015 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:25:28,016 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:25:28,016 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:25:28,017 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:25:28,017 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:25:28,018 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:25:28,019 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:25:28,019 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:25:28,021 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:25:28,022 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:25:28,023 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:25:28,024 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:25:28,025 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:25:28,026 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:25:28,026 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:25:28,028 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:25:28,029 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:25:28,029 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:25:28,030 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:25:28,030 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:25:28,031 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:25:28,031 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:25:28,032 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:25:28,032 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:25:28,033 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:25:28,034 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:25:28,034 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:25:28,035 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:25:28,035 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:25:28,035 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:25:28,036 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:25:28,036 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:25:28,037 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 10:25:28,048 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:25:28,049 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:25:28,050 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:25:28,050 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:25:28,050 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:25:28,050 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:25:28,050 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:25:28,050 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:25:28,050 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:25:28,051 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:25:28,051 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:25:28,051 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:25:28,052 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:25:28,052 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:25:28,052 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:25:28,052 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:25:28,052 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:25:28,052 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:25:28,052 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:25:28,052 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:25:28,053 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:25:28,053 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:25:28,053 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 10:25:28,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:25:28,309 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:25:28,311 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:25:28,312 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:25:28,312 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:25:28,313 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/net_reset.c [2022-04-28 10:25:28,369 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f46bdccf5/6f3ac2bfb400402f9b2db6b48bffa7a6/FLAG6aa99c566 [2022-04-28 10:25:28,732 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:25:28,732 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/net_reset.c [2022-04-28 10:25:28,740 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f46bdccf5/6f3ac2bfb400402f9b2db6b48bffa7a6/FLAG6aa99c566 [2022-04-28 10:25:29,120 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f46bdccf5/6f3ac2bfb400402f9b2db6b48bffa7a6 [2022-04-28 10:25:29,122 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:25:29,123 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:25:29,124 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:25:29,125 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:25:29,130 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:25:29,131 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:25:29" (1/1) ... [2022-04-28 10:25:29,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bda62b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:25:29, skipping insertion in model container [2022-04-28 10:25:29,132 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:25:29" (1/1) ... [2022-04-28 10:25:29,138 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:25:29,158 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:25:29,316 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/net_reset.c[4546,4559] [2022-04-28 10:25:29,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:25:30,259 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:25:30,292 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/net_reset.c[4546,4559] [2022-04-28 10:25:30,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:25:30,323 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:25:30,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:25:30 WrapperNode [2022-04-28 10:25:30,323 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:25:30,324 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:25:30,324 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:25:30,325 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:25:30,334 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:25:30" (1/1) ... [2022-04-28 10:25:30,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:25:30" (1/1) ... [2022-04-28 10:25:30,350 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:25:30" (1/1) ... [2022-04-28 10:25:30,350 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:25:30" (1/1) ... [2022-04-28 10:25:30,370 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:25:30" (1/1) ... [2022-04-28 10:25:30,373 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:25:30" (1/1) ... [2022-04-28 10:25:30,375 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:25:30" (1/1) ... [2022-04-28 10:25:30,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:25:30,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:25:30,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:25:30,383 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:25:30,384 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:25:30" (1/1) ... [2022-04-28 10:25:30,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:25:30,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:25:30,412 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 10:25:30,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 10:25:30,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:25:30,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:25:30,451 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:25:30,451 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 10:25:30,451 INFO L138 BoogieDeclarations]: Found implementation of procedure net_reset [2022-04-28 10:25:30,451 INFO L138 BoogieDeclarations]: Found implementation of procedure net_send_batch [2022-04-28 10:25:30,452 INFO L138 BoogieDeclarations]: Found implementation of procedure net_reopen [2022-04-28 10:25:30,452 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:25:30,452 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 10:25:30,452 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:25:30,452 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:25:30,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:25:30,452 INFO L130 BoogieDeclarations]: Found specification of procedure net_reset [2022-04-28 10:25:30,453 INFO L130 BoogieDeclarations]: Found specification of procedure net_reopen [2022-04-28 10:25:30,453 INFO L130 BoogieDeclarations]: Found specification of procedure net_send_batch [2022-04-28 10:25:30,483 INFO L130 BoogieDeclarations]: Found specification of procedure addrcmp [2022-04-28 10:25:30,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 10:25:30,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:25:30,483 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:25:30,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-28 10:25:30,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:25:30,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:25:30,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:25:30,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:25:30,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:25:30,612 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:25:30,614 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:25:30,763 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:25:30,769 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:25:30,770 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 10:25:30,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:25:30 BoogieIcfgContainer [2022-04-28 10:25:30,771 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:25:30,773 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:25:30,773 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:25:30,776 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:25:30,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:25:29" (1/3) ... [2022-04-28 10:25:30,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6babe085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:25:30, skipping insertion in model container [2022-04-28 10:25:30,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:25:30" (2/3) ... [2022-04-28 10:25:30,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6babe085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:25:30, skipping insertion in model container [2022-04-28 10:25:30,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:25:30" (3/3) ... [2022-04-28 10:25:30,778 INFO L111 eAbstractionObserver]: Analyzing ICFG net_reset.c [2022-04-28 10:25:30,790 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:25:30,791 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:25:30,836 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:25:30,844 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@76cc4193, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@14796f65 [2022-04-28 10:25:30,844 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:25:30,851 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 10:25:30,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 10:25:30,857 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:25:30,858 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:25:30,858 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:25:30,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:25:30,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1439756030, now seen corresponding path program 1 times [2022-04-28 10:25:30,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:25:30,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1329660496] [2022-04-28 10:25:30,886 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:25:30,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1439756030, now seen corresponding path program 2 times [2022-04-28 10:25:30,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:25:30,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757137035] [2022-04-28 10:25:30,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:25:30,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:25:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:25:31,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:25:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:25:31,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {53#(and (= |old(~batch_at~0)| ~batch_at~0) (= |~#unspec_addr~0.base| |old(~#unspec_addr~0.base)|) (= ~fstTTL~0 |old(~fstTTL~0)|) (= |~#host~0.offset| |old(~#host~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |~#host~0.base| |old(~#host~0.base)|) (= |old(~__tmpTR__int_1~0)| ~__tmpTR__int_1~0) (= |old(~#unspec_addr~0.offset)| |~#unspec_addr~0.offset|) (= |#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(12, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(19, 4);~__tmpTR__int_1~0 := 0;~batch_at~0 := 0;~#host~0.base, ~#host~0.offset := 5, 0;call #Ultimate.allocInit(259072, 5);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#host~0.base);~#unspec_addr~0.base, ~#unspec_addr~0.offset := 6, 0;call #Ultimate.allocInit(16, 6);call write~init~int(0, ~#unspec_addr~0.base, ~#unspec_addr~0.offset, 1);call write~init~int(0, ~#unspec_addr~0.base, 1 + ~#unspec_addr~0.offset, 1);call write~init~int(0, ~#unspec_addr~0.base, 2 + ~#unspec_addr~0.offset, 1);call write~init~int(0, ~#unspec_addr~0.base, 3 + ~#unspec_addr~0.offset, 1);call write~init~int(0, ~#unspec_addr~0.base, 4 + ~#unspec_addr~0.offset, 1);call write~init~int(0, ~#unspec_addr~0.base, 5 + ~#unspec_addr~0.offset, 1);call write~init~int(0, ~#unspec_addr~0.base, 6 + ~#unspec_addr~0.offset, 1);call write~init~int(0, ~#unspec_addr~0.base, 7 + ~#unspec_addr~0.offset, 1);call write~init~int(0, ~#unspec_addr~0.base, 8 + ~#unspec_addr~0.offset, 1);call write~init~int(0, ~#unspec_addr~0.base, 9 + ~#unspec_addr~0.offset, 1);call write~init~int(0, ~#unspec_addr~0.base, 10 + ~#unspec_addr~0.offset, 1);call write~init~int(0, ~#unspec_addr~0.base, 11 + ~#unspec_addr~0.offset, 1);call write~init~int(0, ~#unspec_addr~0.base, 12 + ~#unspec_addr~0.offset, 1);call write~init~int(0, ~#unspec_addr~0.base, 13 + ~#unspec_addr~0.offset, 1);call write~init~int(0, ~#unspec_addr~0.base, 14 + ~#unspec_addr~0.offset, 1);call write~init~int(0, ~#unspec_addr~0.base, 15 + ~#unspec_addr~0.offset, 1);~fstTTL~0 := 1; {43#true} is VALID [2022-04-28 10:25:31,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-28 10:25:31,304 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} #76#return; {43#true} is VALID [2022-04-28 10:25:31,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-28 10:25:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:25:31,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {54#(= |old(~batch_at~0)| ~batch_at~0)} ~batch_at~0 := ~fstTTL~0 - 1; {51#(<= (+ ~batch_at~0 1) ~fstTTL~0)} is VALID [2022-04-28 10:25:31,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#(<= (+ ~batch_at~0 1) ~fstTTL~0)} assume true; {51#(<= (+ ~batch_at~0 1) ~fstTTL~0)} is VALID [2022-04-28 10:25:31,357 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51#(<= (+ ~batch_at~0 1) ~fstTTL~0)} {43#true} #72#return; {51#(<= (+ ~batch_at~0 1) ~fstTTL~0)} is VALID [2022-04-28 10:25:31,359 INFO L272 TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {53#(and (= |old(~batch_at~0)| ~batch_at~0) (= |~#unspec_addr~0.base| |old(~#unspec_addr~0.base)|) (= ~fstTTL~0 |old(~fstTTL~0)|) (= |~#host~0.offset| |old(~#host~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |~#host~0.base| |old(~#host~0.base)|) (= |old(~__tmpTR__int_1~0)| ~__tmpTR__int_1~0) (= |old(~#unspec_addr~0.offset)| |~#unspec_addr~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:25:31,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {53#(and (= |old(~batch_at~0)| ~batch_at~0) (= |~#unspec_addr~0.base| |old(~#unspec_addr~0.base)|) (= ~fstTTL~0 |old(~fstTTL~0)|) (= |~#host~0.offset| |old(~#host~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |~#host~0.base| |old(~#host~0.base)|) (= |old(~__tmpTR__int_1~0)| ~__tmpTR__int_1~0) (= |old(~#unspec_addr~0.offset)| |~#unspec_addr~0.offset|) (= |#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(12, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(19, 4);~__tmpTR__int_1~0 := 0;~batch_at~0 := 0;~#host~0.base, ~#host~0.offset := 5, 0;call #Ultimate.allocInit(259072, 5);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#host~0.base);~#unspec_addr~0.base, ~#unspec_addr~0.offset := 6, 0;call #Ultimate.allocInit(16, 6);call write~init~int(0, ~#unspec_addr~0.base, ~#unspec_addr~0.offset, 1);call write~init~int(0, ~#unspec_addr~0.base, 1 + ~#unspec_addr~0.offset, 1);call write~init~int(0, ~#unspec_addr~0.base, 2 + ~#unspec_addr~0.offset, 1);call write~init~int(0, ~#unspec_addr~0.base, 3 + ~#unspec_addr~0.offset, 1);call write~init~int(0, ~#unspec_addr~0.base, 4 + ~#unspec_addr~0.offset, 1);call write~init~int(0, ~#unspec_addr~0.base, 5 + ~#unspec_addr~0.offset, 1);call write~init~int(0, ~#unspec_addr~0.base, 6 + ~#unspec_addr~0.offset, 1);call write~init~int(0, ~#unspec_addr~0.base, 7 + ~#unspec_addr~0.offset, 1);call write~init~int(0, ~#unspec_addr~0.base, 8 + ~#unspec_addr~0.offset, 1);call write~init~int(0, ~#unspec_addr~0.base, 9 + ~#unspec_addr~0.offset, 1);call write~init~int(0, ~#unspec_addr~0.base, 10 + ~#unspec_addr~0.offset, 1);call write~init~int(0, ~#unspec_addr~0.base, 11 + ~#unspec_addr~0.offset, 1);call write~init~int(0, ~#unspec_addr~0.base, 12 + ~#unspec_addr~0.offset, 1);call write~init~int(0, ~#unspec_addr~0.base, 13 + ~#unspec_addr~0.offset, 1);call write~init~int(0, ~#unspec_addr~0.base, 14 + ~#unspec_addr~0.offset, 1);call write~init~int(0, ~#unspec_addr~0.base, 15 + ~#unspec_addr~0.offset, 1);~fstTTL~0 := 1; {43#true} is VALID [2022-04-28 10:25:31,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-28 10:25:31,360 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #76#return; {43#true} is VALID [2022-04-28 10:25:31,361 INFO L272 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret9 := main(); {43#true} is VALID [2022-04-28 10:25:31,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {43#true} call ~#h~0.base, ~#h~0.offset := #Ultimate.allocOnStack(32); {43#true} is VALID [2022-04-28 10:25:31,361 INFO L272 TraceCheckUtils]: 6: Hoare triple {43#true} call net_reopen(~#h~0.base, ~#h~0.offset); {43#true} is VALID [2022-04-28 10:25:31,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {43#true} ~addr.base, ~addr.offset := #in~addr.base, #in~addr.offset;call #t~mem6 := read~int(~addr.base, 16 + ~addr.offset, 4);#t~switch7 := 2 == #t~mem6; {43#true} is VALID [2022-04-28 10:25:31,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {43#true} assume #t~switch7; {43#true} is VALID [2022-04-28 10:25:31,362 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#true} havoc #t~mem6;havoc #t~switch7; {43#true} is VALID [2022-04-28 10:25:31,362 INFO L272 TraceCheckUtils]: 10: Hoare triple {43#true} call net_reset(); {54#(= |old(~batch_at~0)| ~batch_at~0)} is VALID [2022-04-28 10:25:31,363 INFO L290 TraceCheckUtils]: 11: Hoare triple {54#(= |old(~batch_at~0)| ~batch_at~0)} ~batch_at~0 := ~fstTTL~0 - 1; {51#(<= (+ ~batch_at~0 1) ~fstTTL~0)} is VALID [2022-04-28 10:25:31,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {51#(<= (+ ~batch_at~0 1) ~fstTTL~0)} assume true; {51#(<= (+ ~batch_at~0 1) ~fstTTL~0)} is VALID [2022-04-28 10:25:31,366 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {51#(<= (+ ~batch_at~0 1) ~fstTTL~0)} {43#true} #72#return; {51#(<= (+ ~batch_at~0 1) ~fstTTL~0)} is VALID [2022-04-28 10:25:31,366 INFO L272 TraceCheckUtils]: 14: Hoare triple {51#(<= (+ ~batch_at~0 1) ~fstTTL~0)} call #t~ret8 := net_send_batch(); {51#(<= (+ ~batch_at~0 1) ~fstTTL~0)} is VALID [2022-04-28 10:25:31,367 INFO L290 TraceCheckUtils]: 15: Hoare triple {51#(<= (+ ~batch_at~0 1) ~fstTTL~0)} havoc ~i~0;~i~0 := ~fstTTL~0 - 1; {52#(<= ~batch_at~0 net_send_batch_~i~0)} is VALID [2022-04-28 10:25:31,368 INFO L290 TraceCheckUtils]: 16: Hoare triple {52#(<= ~batch_at~0 net_send_batch_~i~0)} assume !!(~i~0 < ~batch_at~0); {44#false} is VALID [2022-04-28 10:25:31,368 INFO L272 TraceCheckUtils]: 17: Hoare triple {44#false} call __VERIFIER_assert((if ~i~0 >= 0 && ~i~0 < 256 then 1 else 0)); {44#false} is VALID [2022-04-28 10:25:31,368 INFO L290 TraceCheckUtils]: 18: Hoare triple {44#false} ~cond := #in~cond; {44#false} is VALID [2022-04-28 10:25:31,369 INFO L290 TraceCheckUtils]: 19: Hoare triple {44#false} assume 0 == ~cond; {44#false} is VALID [2022-04-28 10:25:31,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {44#false} assume !false; {44#false} is VALID [2022-04-28 10:25:31,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:25:31,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:25:31,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757137035] [2022-04-28 10:25:31,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757137035] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:25:31,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:25:31,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:25:31,376 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:25:31,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1329660496] [2022-04-28 10:25:31,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1329660496] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:25:31,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:25:31,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:25:31,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479501169] [2022-04-28 10:25:31,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:25:31,382 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-28 10:25:31,384 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:25:31,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:25:31,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:25:31,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:25:31,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:25:31,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:25:31,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:25:31,447 INFO L87 Difference]: Start difference. First operand has 40 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:25:31,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:25:31,803 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-28 10:25:31,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:25:31,803 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-28 10:25:31,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:25:31,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:25:31,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2022-04-28 10:25:31,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:25:31,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2022-04-28 10:25:31,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 59 transitions. [2022-04-28 10:25:31,891 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:25:31,895 INFO L225 Difference]: With dead ends: 52 [2022-04-28 10:25:31,896 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 10:25:31,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-28 10:25:31,901 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 39 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:25:31,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 42 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:25:31,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 10:25:31,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 10:25:31,919 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:25:31,919 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:25:31,920 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:25:31,920 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:25:31,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:25:31,920 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 10:25:31,920 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:25:31,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:25:31,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:25:31,921 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 10:25:31,921 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 10:25:31,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:25:31,921 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 10:25:31,921 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:25:31,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:25:31,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:25:31,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:25:31,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:25:31,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:25:31,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 10:25:31,923 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2022-04-28 10:25:31,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:25:31,924 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 10:25:31,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:25:31,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 10:25:31,924 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:25:31,925 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:25:31,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:25:31,927 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 10:25:31,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 10:25:31,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 10:25:32,393 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-28 10:25:32,393 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-28 10:25:32,393 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-28 10:25:32,394 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 233 237) the Hoare annotation is: (or (not (<= (+ |old(~batch_at~0)| 1) ~fstTTL~0)) (and (= |old(~batch_at~0)| ~batch_at~0) (= |old(~__tmpTR__int_1~0)| ~__tmpTR__int_1~0))) [2022-04-28 10:25:32,395 INFO L895 garLoopResultBuilder]: At program point mainFINAL(lines 233 237) the Hoare annotation is: (or (not (<= (+ |old(~batch_at~0)| 1) ~fstTTL~0)) (<= (+ ~batch_at~0 1) ~fstTTL~0)) [2022-04-28 10:25:32,395 INFO L895 garLoopResultBuilder]: At program point L235(line 235) the Hoare annotation is: (or (not (<= (+ |old(~batch_at~0)| 1) ~fstTTL~0)) (and (= |old(~batch_at~0)| ~batch_at~0) (= |old(~__tmpTR__int_1~0)| ~__tmpTR__int_1~0))) [2022-04-28 10:25:32,395 INFO L895 garLoopResultBuilder]: At program point L235-1(line 235) the Hoare annotation is: (or (not (<= (+ |old(~batch_at~0)| 1) ~fstTTL~0)) (<= (+ ~batch_at~0 1) ~fstTTL~0)) [2022-04-28 10:25:32,396 INFO L895 garLoopResultBuilder]: At program point mainEXIT(lines 233 237) the Hoare annotation is: (or (not (<= (+ |old(~batch_at~0)| 1) ~fstTTL~0)) (<= (+ ~batch_at~0 1) ~fstTTL~0)) [2022-04-28 10:25:32,396 INFO L895 garLoopResultBuilder]: At program point net_reopenEXIT(lines 216 231) the Hoare annotation is: (or (not (<= (+ |old(~batch_at~0)| 1) ~fstTTL~0)) (<= (+ ~batch_at~0 1) ~fstTTL~0)) [2022-04-28 10:25:32,396 INFO L895 garLoopResultBuilder]: At program point L223(line 223) the Hoare annotation is: (or (not (<= (+ |old(~batch_at~0)| 1) ~fstTTL~0)) (and (= |old(~batch_at~0)| ~batch_at~0) (= |old(~__tmpTR__int_1~0)| ~__tmpTR__int_1~0))) [2022-04-28 10:25:32,396 INFO L895 garLoopResultBuilder]: At program point net_reopenENTRY(lines 216 231) the Hoare annotation is: (or (not (<= (+ |old(~batch_at~0)| 1) ~fstTTL~0)) (and (= |old(~batch_at~0)| ~batch_at~0) (= |old(~__tmpTR__int_1~0)| ~__tmpTR__int_1~0))) [2022-04-28 10:25:32,396 INFO L895 garLoopResultBuilder]: At program point L220(line 220) the Hoare annotation is: (or (not (<= (+ |old(~batch_at~0)| 1) ~fstTTL~0)) (and (= |old(~batch_at~0)| ~batch_at~0) (= |old(~__tmpTR__int_1~0)| ~__tmpTR__int_1~0))) [2022-04-28 10:25:32,396 INFO L895 garLoopResultBuilder]: At program point net_reopenFINAL(lines 216 231) the Hoare annotation is: (or (not (<= (+ |old(~batch_at~0)| 1) ~fstTTL~0)) (<= (+ ~batch_at~0 1) ~fstTTL~0)) [2022-04-28 10:25:32,396 INFO L895 garLoopResultBuilder]: At program point L218(lines 218 228) the Hoare annotation is: (or (not (<= (+ |old(~batch_at~0)| 1) ~fstTTL~0)) (and (= |old(~batch_at~0)| ~batch_at~0) (= |old(~__tmpTR__int_1~0)| ~__tmpTR__int_1~0))) [2022-04-28 10:25:32,396 INFO L895 garLoopResultBuilder]: At program point L230(line 230) the Hoare annotation is: (or (not (<= (+ |old(~batch_at~0)| 1) ~fstTTL~0)) (<= (+ ~batch_at~0 1) ~fstTTL~0)) [2022-04-28 10:25:32,397 INFO L895 garLoopResultBuilder]: At program point L229(line 229) the Hoare annotation is: (or (not (<= (+ |old(~batch_at~0)| 1) ~fstTTL~0)) (and (= |old(~batch_at~0)| ~batch_at~0) (= |old(~__tmpTR__int_1~0)| ~__tmpTR__int_1~0))) [2022-04-28 10:25:32,397 INFO L895 garLoopResultBuilder]: At program point L229-1(line 229) the Hoare annotation is: (or (not (<= (+ |old(~batch_at~0)| 1) ~fstTTL~0)) (<= (+ ~batch_at~0 1) ~fstTTL~0)) [2022-04-28 10:25:32,397 INFO L895 garLoopResultBuilder]: At program point L226(line 226) the Hoare annotation is: (or (not (<= (+ |old(~batch_at~0)| 1) ~fstTTL~0)) (and (= |old(~batch_at~0)| ~batch_at~0) (= |old(~__tmpTR__int_1~0)| ~__tmpTR__int_1~0))) [2022-04-28 10:25:32,398 INFO L895 garLoopResultBuilder]: At program point net_resetENTRY(lines 200 204) the Hoare annotation is: (or (= |old(~batch_at~0)| ~batch_at~0) (not (<= (+ |old(~batch_at~0)| 1) ~fstTTL~0))) [2022-04-28 10:25:32,398 INFO L895 garLoopResultBuilder]: At program point net_resetEXIT(lines 200 204) the Hoare annotation is: (or (not (<= (+ |old(~batch_at~0)| 1) ~fstTTL~0)) (<= (+ ~batch_at~0 1) ~fstTTL~0)) [2022-04-28 10:25:32,398 INFO L895 garLoopResultBuilder]: At program point net_resetFINAL(lines 200 204) the Hoare annotation is: (or (not (<= (+ |old(~batch_at~0)| 1) ~fstTTL~0)) (<= (+ ~batch_at~0 1) ~fstTTL~0)) [2022-04-28 10:25:32,398 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (<= (+ ~batch_at~0 1) ~fstTTL~0) [2022-04-28 10:25:32,398 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~batch_at~0)| ~batch_at~0) (= |~#unspec_addr~0.base| |old(~#unspec_addr~0.base)|) (= ~fstTTL~0 |old(~fstTTL~0)|) (= |~#host~0.offset| |old(~#host~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |~#host~0.base| |old(~#host~0.base)|) (= |old(~__tmpTR__int_1~0)| ~__tmpTR__int_1~0) (= |old(~#unspec_addr~0.offset)| |~#unspec_addr~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 10:25:32,398 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (<= (+ ~batch_at~0 1) ~fstTTL~0) [2022-04-28 10:25:32,398 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: (<= (+ ~batch_at~0 1) ~fstTTL~0) [2022-04-28 10:25:32,398 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (<= (+ ~batch_at~0 1) ~fstTTL~0) [2022-04-28 10:25:32,399 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 10:25:32,399 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: (<= (+ ~batch_at~0 1) ~fstTTL~0) [2022-04-28 10:25:32,399 INFO L902 garLoopResultBuilder]: At program point L194-2(lines 193 198) the Hoare annotation is: true [2022-04-28 10:25:32,399 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 193 198) the Hoare annotation is: true [2022-04-28 10:25:32,399 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 193 198) the Hoare annotation is: true [2022-04-28 10:25:32,399 INFO L902 garLoopResultBuilder]: At program point L195(line 195) the Hoare annotation is: true [2022-04-28 10:25:32,399 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 195) the Hoare annotation is: true [2022-04-28 10:25:32,400 INFO L902 garLoopResultBuilder]: At program point L194(lines 194 196) the Hoare annotation is: true [2022-04-28 10:25:32,400 INFO L895 garLoopResultBuilder]: At program point net_send_batchENTRY(lines 205 215) the Hoare annotation is: (or (= |old(~__tmpTR__int_1~0)| ~__tmpTR__int_1~0) (not (<= (+ ~batch_at~0 1) ~fstTTL~0))) [2022-04-28 10:25:32,400 INFO L895 garLoopResultBuilder]: At program point net_send_batchEXIT(lines 205 215) the Hoare annotation is: (or (and (<= ~batch_at~0 net_send_batch_~i~0) (= |old(~__tmpTR__int_1~0)| ~__tmpTR__int_1~0)) (not (<= (+ ~batch_at~0 1) ~fstTTL~0))) [2022-04-28 10:25:32,400 INFO L895 garLoopResultBuilder]: At program point net_send_batchFINAL(lines 205 215) the Hoare annotation is: (or (and (<= ~batch_at~0 net_send_batch_~i~0) (= |old(~__tmpTR__int_1~0)| ~__tmpTR__int_1~0)) (not (<= (+ ~batch_at~0 1) ~fstTTL~0))) [2022-04-28 10:25:32,400 INFO L895 garLoopResultBuilder]: At program point L210(line 210) the Hoare annotation is: (not (<= (+ ~batch_at~0 1) ~fstTTL~0)) [2022-04-28 10:25:32,400 INFO L895 garLoopResultBuilder]: At program point L210-1(line 210) the Hoare annotation is: (not (<= (+ ~batch_at~0 1) ~fstTTL~0)) [2022-04-28 10:25:32,400 INFO L895 garLoopResultBuilder]: At program point L210-2(lines 210 211) the Hoare annotation is: (not (<= (+ ~batch_at~0 1) ~fstTTL~0)) [2022-04-28 10:25:32,400 INFO L895 garLoopResultBuilder]: At program point L208-2(lines 208 213) the Hoare annotation is: (not (<= (+ ~batch_at~0 1) ~fstTTL~0)) [2022-04-28 10:25:32,401 INFO L895 garLoopResultBuilder]: At program point L208-3(lines 208 213) the Hoare annotation is: (or (and (<= ~batch_at~0 net_send_batch_~i~0) (= |old(~__tmpTR__int_1~0)| ~__tmpTR__int_1~0)) (not (<= (+ ~batch_at~0 1) ~fstTTL~0))) [2022-04-28 10:25:32,401 INFO L895 garLoopResultBuilder]: At program point L208-4(lines 208 213) the Hoare annotation is: (or (and (<= ~batch_at~0 net_send_batch_~i~0) (= |old(~__tmpTR__int_1~0)| ~__tmpTR__int_1~0)) (not (<= (+ ~batch_at~0 1) ~fstTTL~0))) [2022-04-28 10:25:32,403 INFO L356 BasicCegarLoop]: Path program histogram: [2] [2022-04-28 10:25:32,405 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 10:25:32,413 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 10:25:32,420 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 10:25:32,448 INFO L163 areAnnotationChecker]: CFG has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 10:25:32,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 10:25:32 BoogieIcfgContainer [2022-04-28 10:25:32,473 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 10:25:32,474 INFO L158 Benchmark]: Toolchain (without parser) took 3350.62ms. Allocated memory was 169.9MB in the beginning and 400.6MB in the end (delta: 230.7MB). Free memory was 120.6MB in the beginning and 283.4MB in the end (delta: -162.8MB). Peak memory consumption was 153.6MB. Max. memory is 8.0GB. [2022-04-28 10:25:32,474 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 169.9MB. Free memory is still 137.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 10:25:32,475 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1199.36ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 120.3MB in the beginning and 78.4MB in the end (delta: 41.9MB). Peak memory consumption was 139.4MB. Max. memory is 8.0GB. [2022-04-28 10:25:32,475 INFO L158 Benchmark]: Boogie Preprocessor took 57.87ms. Allocated memory is still 205.5MB. Free memory was 78.4MB in the beginning and 76.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 10:25:32,476 INFO L158 Benchmark]: RCFGBuilder took 388.41ms. Allocated memory was 205.5MB in the beginning and 400.6MB in the end (delta: 195.0MB). Free memory was 76.3MB in the beginning and 289.7MB in the end (delta: -213.4MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-04-28 10:25:32,476 INFO L158 Benchmark]: TraceAbstraction took 1699.92ms. Allocated memory is still 400.6MB. Free memory was 289.2MB in the beginning and 283.4MB in the end (delta: 5.8MB). Peak memory consumption was 91.8MB. Max. memory is 8.0GB. [2022-04-28 10:25:32,478 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.14ms. Allocated memory is still 169.9MB. Free memory is still 137.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1199.36ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 120.3MB in the beginning and 78.4MB in the end (delta: 41.9MB). Peak memory consumption was 139.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 57.87ms. Allocated memory is still 205.5MB. Free memory was 78.4MB in the beginning and 76.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 388.41ms. Allocated memory was 205.5MB in the beginning and 400.6MB in the end (delta: 195.0MB). Free memory was 76.3MB in the beginning and 289.7MB in the end (delta: -213.4MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 1699.92ms. Allocated memory is still 400.6MB. Free memory was 289.2MB in the beginning and 283.4MB in the end (delta: 5.8MB). Peak memory consumption was 91.8MB. 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: 195]: 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 8 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 42 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 47 IncrementalHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 24 mSDtfsCounter, 47 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, InterpolantAutomatonStates: 6, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 40 LocationsWithAnnotation, 40 PreInvPairs, 52 NumberOfFragments, 383 HoareAnnotationTreeSize, 40 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 40 FomulaSimplificationsInter, 72 FormulaSimplificationTreeSizeReductionInter, 0.3s 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: 208]: Loop Invariant Derived loop invariant: (batch_at <= i && \old(__tmpTR__int_1) == __tmpTR__int_1) || !(batch_at + 1 <= fstTTL) - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: !(\old(batch_at) + 1 <= fstTTL) || (\old(batch_at) == batch_at && \old(__tmpTR__int_1) == __tmpTR__int_1) - ProcedureContractResult [Line: 233]: Procedure Contract for main Derived contract for procedure main: !(\old(batch_at) + 1 <= fstTTL) || batch_at + 1 <= fstTTL - ProcedureContractResult [Line: 193]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 - ProcedureContractResult [Line: 205]: Procedure Contract for net_send_batch Derived contract for procedure net_send_batch: (batch_at <= i && \old(__tmpTR__int_1) == __tmpTR__int_1) || !(batch_at + 1 <= fstTTL) - ProcedureContractResult [Line: 216]: Procedure Contract for net_reopen Derived contract for procedure net_reopen: !(\old(batch_at) + 1 <= fstTTL) || batch_at + 1 <= fstTTL - ProcedureContractResult [Line: 200]: Procedure Contract for net_reset Derived contract for procedure net_reset: !(\old(batch_at) + 1 <= fstTTL) || batch_at + 1 <= fstTTL RESULT: Ultimate proved your program to be correct! [2022-04-28 10:25:32,527 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...