/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/nec20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 09:00:10,384 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 09:00:10,385 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 09:00:10,414 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 09:00:10,414 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 09:00:10,415 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 09:00:10,419 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 09:00:10,424 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 09:00:10,425 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 09:00:10,430 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 09:00:10,431 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 09:00:10,432 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 09:00:10,432 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 09:00:10,435 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 09:00:10,435 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 09:00:10,436 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 09:00:10,436 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 09:00:10,437 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 09:00:10,441 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 09:00:10,443 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 09:00:10,443 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 09:00:10,446 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 09:00:10,447 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 09:00:10,447 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 09:00:10,448 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 09:00:10,449 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 09:00:10,449 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 09:00:10,449 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 09:00:10,450 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 09:00:10,450 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 09:00:10,450 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 09:00:10,451 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 09:00:10,451 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 09:00:10,451 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 09:00:10,452 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 09:00:10,452 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 09:00:10,452 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 09:00:10,453 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 09:00:10,453 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 09:00:10,453 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 09:00:10,453 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 09:00:10,465 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 09:00:10,465 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 09:00:10,472 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 09:00:10,472 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 09:00:10,473 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 09:00:10,473 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 09:00:10,473 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 09:00:10,473 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 09:00:10,473 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 09:00:10,474 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 09:00:10,474 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 09:00:10,474 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 09:00:10,474 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 09:00:10,474 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 09:00:10,474 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 09:00:10,474 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 09:00:10,474 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 09:00:10,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:00:10,474 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 09:00:10,474 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 09:00:10,475 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 09:00:10,475 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 09:00:10,475 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 09:00:10,475 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 09:00:10,475 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 09:00:10,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 09:00:10,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 09:00:10,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 09:00:10,669 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 09:00:10,669 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 09:00:10,670 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/nec20.c [2022-04-08 09:00:10,702 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c857ce96/df5ca1f86f5448a594ee4e36cb1f1d17/FLAGe7cceed20 [2022-04-08 09:00:11,097 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 09:00:11,098 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/nec20.c [2022-04-08 09:00:11,102 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c857ce96/df5ca1f86f5448a594ee4e36cb1f1d17/FLAGe7cceed20 [2022-04-08 09:00:11,490 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c857ce96/df5ca1f86f5448a594ee4e36cb1f1d17 [2022-04-08 09:00:11,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 09:00:11,493 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 09:00:11,494 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 09:00:11,494 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 09:00:11,496 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 09:00:11,497 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:00:11" (1/1) ... [2022-04-08 09:00:11,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b09adaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:00:11, skipping insertion in model container [2022-04-08 09:00:11,498 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:00:11" (1/1) ... [2022-04-08 09:00:11,502 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 09:00:11,511 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 09:00:11,633 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/nec20.c[356,369] [2022-04-08 09:00:11,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:00:11,649 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 09:00:11,657 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/nec20.c[356,369] [2022-04-08 09:00:11,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:00:11,669 INFO L208 MainTranslator]: Completed translation [2022-04-08 09:00:11,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:00:11 WrapperNode [2022-04-08 09:00:11,670 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 09:00:11,670 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 09:00:11,670 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 09:00:11,670 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 09:00:11,677 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:00:11" (1/1) ... [2022-04-08 09:00:11,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:00:11" (1/1) ... [2022-04-08 09:00:11,681 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:00:11" (1/1) ... [2022-04-08 09:00:11,681 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:00:11" (1/1) ... [2022-04-08 09:00:11,685 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:00:11" (1/1) ... [2022-04-08 09:00:11,687 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:00:11" (1/1) ... [2022-04-08 09:00:11,688 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:00:11" (1/1) ... [2022-04-08 09:00:11,689 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 09:00:11,689 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 09:00:11,689 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 09:00:11,689 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 09:00:11,690 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:00:11" (1/1) ... [2022-04-08 09:00:11,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:00:11,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:00:11,724 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 09:00:11,750 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 09:00:11,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 09:00:11,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 09:00:11,772 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 09:00:11,772 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 09:00:11,773 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 09:00:11,773 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 09:00:11,773 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 09:00:11,773 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 09:00:11,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 09:00:11,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 09:00:11,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 09:00:11,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-08 09:00:11,774 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 09:00:11,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 09:00:11,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 09:00:11,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 09:00:11,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 09:00:11,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 09:00:11,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 09:00:11,832 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 09:00:11,833 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 09:00:11,965 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 09:00:11,970 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 09:00:11,970 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 09:00:11,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:00:11 BoogieIcfgContainer [2022-04-08 09:00:11,971 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 09:00:11,972 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 09:00:11,972 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 09:00:11,975 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 09:00:11,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 09:00:11" (1/3) ... [2022-04-08 09:00:11,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de4f72d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:00:11, skipping insertion in model container [2022-04-08 09:00:11,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:00:11" (2/3) ... [2022-04-08 09:00:11,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de4f72d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:00:11, skipping insertion in model container [2022-04-08 09:00:11,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:00:11" (3/3) ... [2022-04-08 09:00:11,977 INFO L111 eAbstractionObserver]: Analyzing ICFG nec20.c [2022-04-08 09:00:11,980 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 09:00:11,980 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 09:00:12,007 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 09:00:12,012 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 09:00:12,012 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 09:00:12,024 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:00:12,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 09:00:12,029 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:00:12,029 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:00:12,030 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:00:12,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:00:12,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1512797340, now seen corresponding path program 1 times [2022-04-08 09:00:12,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:12,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [107840068] [2022-04-08 09:00:12,047 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:00:12,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1512797340, now seen corresponding path program 2 times [2022-04-08 09:00:12,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:00:12,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283820317] [2022-04-08 09:00:12,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:00:12,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:00:12,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:12,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:00:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:12,222 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#(and (= ~b~0 |old(~b~0)|) (= |#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(8, 2);call #Ultimate.allocInit(12, 3);~b~0 := 0; {28#true} is VALID [2022-04-08 09:00:12,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-08 09:00:12,223 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #56#return; {28#true} is VALID [2022-04-08 09:00:12,224 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {35#(and (= ~b~0 |old(~b~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:00:12,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#(and (= ~b~0 |old(~b~0)|) (= |#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(8, 2);call #Ultimate.allocInit(12, 3);~b~0 := 0; {28#true} is VALID [2022-04-08 09:00:12,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-08 09:00:12,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #56#return; {28#true} is VALID [2022-04-08 09:00:12,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret7 := main(); {28#true} is VALID [2022-04-08 09:00:12,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} ~k~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~n~0;havoc ~j~0;havoc ~a~0; {28#true} is VALID [2022-04-08 09:00:12,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#true} assume 0 != ~k~0 % 256;~n~0 := 0; {33#(= main_~n~0 0)} is VALID [2022-04-08 09:00:12,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#(= main_~n~0 0)} ~i~0 := 0;~j~0 := #t~nondet5;havoc #t~nondet5; {34#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:12,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#(and (= main_~n~0 0) (= main_~i~0 0))} assume !(~j~0 % 4294967296 > 10000); {34#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:12,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#(and (= main_~n~0 0) (= main_~i~0 0))} assume !(~i~0 % 4294967296 <= ~n~0 % 4294967296); {29#false} is VALID [2022-04-08 09:00:12,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {29#false} ~a~0 := ~a~0[~i~0 % 4294967296 := 0]; {29#false} is VALID [2022-04-08 09:00:12,228 INFO L272 TraceCheckUtils]: 11: Hoare triple {29#false} call __VERIFIER_assert((if ~j~0 % 4294967296 < 1025 then 1 else 0)); {29#false} is VALID [2022-04-08 09:00:12,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-04-08 09:00:12,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2022-04-08 09:00:12,228 INFO L290 TraceCheckUtils]: 14: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-04-08 09:00:12,229 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 09:00:12,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:00:12,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283820317] [2022-04-08 09:00:12,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283820317] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:00:12,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:00:12,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:00:12,232 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:00:12,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [107840068] [2022-04-08 09:00:12,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [107840068] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:00:12,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:00:12,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:00:12,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410161313] [2022-04-08 09:00:12,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:00:12,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 09:00:12,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:00:12,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:12,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:12,255 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 09:00:12,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:12,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 09:00:12,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 09:00:12,278 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:12,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:12,529 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2022-04-08 09:00:12,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 09:00:12,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 09:00:12,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:00:12,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:12,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-08 09:00:12,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:12,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-08 09:00:12,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2022-04-08 09:00:12,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:12,615 INFO L225 Difference]: With dead ends: 53 [2022-04-08 09:00:12,615 INFO L226 Difference]: Without dead ends: 22 [2022-04-08 09:00:12,617 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-08 09:00:12,620 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 35 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:00:12,620 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 41 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:00:12,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-08 09:00:12,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2022-04-08 09:00:12,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:00:12,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:12,642 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:12,642 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:12,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:12,644 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-08 09:00:12,645 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-08 09:00:12,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:12,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:12,645 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-08 09:00:12,645 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-08 09:00:12,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:12,647 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-08 09:00:12,647 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-08 09:00:12,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:12,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:12,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:00:12,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:00:12,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:12,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-04-08 09:00:12,650 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 15 [2022-04-08 09:00:12,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:00:12,651 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-04-08 09:00:12,651 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:12,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 20 transitions. [2022-04-08 09:00:12,670 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:12,670 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-08 09:00:12,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 09:00:12,671 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:00:12,671 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:00:12,671 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 09:00:12,671 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:00:12,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:00:12,672 INFO L85 PathProgramCache]: Analyzing trace with hash -2102111586, now seen corresponding path program 1 times [2022-04-08 09:00:12,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:12,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1021910067] [2022-04-08 09:00:12,673 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:00:12,673 INFO L85 PathProgramCache]: Analyzing trace with hash -2102111586, now seen corresponding path program 2 times [2022-04-08 09:00:12,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:00:12,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726294590] [2022-04-08 09:00:12,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:00:12,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:00:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:12,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:00:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:12,780 INFO L290 TraceCheckUtils]: 0: Hoare triple {237#(and (= ~b~0 |old(~b~0)|) (= |#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(8, 2);call #Ultimate.allocInit(12, 3);~b~0 := 0; {230#true} is VALID [2022-04-08 09:00:12,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {230#true} assume true; {230#true} is VALID [2022-04-08 09:00:12,781 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {230#true} {230#true} #56#return; {230#true} is VALID [2022-04-08 09:00:12,782 INFO L272 TraceCheckUtils]: 0: Hoare triple {230#true} call ULTIMATE.init(); {237#(and (= ~b~0 |old(~b~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:00:12,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {237#(and (= ~b~0 |old(~b~0)|) (= |#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(8, 2);call #Ultimate.allocInit(12, 3);~b~0 := 0; {230#true} is VALID [2022-04-08 09:00:12,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {230#true} assume true; {230#true} is VALID [2022-04-08 09:00:12,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {230#true} {230#true} #56#return; {230#true} is VALID [2022-04-08 09:00:12,782 INFO L272 TraceCheckUtils]: 4: Hoare triple {230#true} call #t~ret7 := main(); {230#true} is VALID [2022-04-08 09:00:12,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {230#true} ~k~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~n~0;havoc ~j~0;havoc ~a~0; {230#true} is VALID [2022-04-08 09:00:12,783 INFO L290 TraceCheckUtils]: 6: Hoare triple {230#true} assume !(0 != ~k~0 % 256);~n~0 := 1023; {235#(and (<= main_~n~0 1023) (<= 1023 main_~n~0))} is VALID [2022-04-08 09:00:12,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {235#(and (<= main_~n~0 1023) (<= 1023 main_~n~0))} ~i~0 := 0;~j~0 := #t~nondet5;havoc #t~nondet5; {236#(and (not (<= (+ (div main_~i~0 4294967296) 1) (div main_~n~0 4294967296))) (<= 1023 main_~n~0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:12,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {236#(and (not (<= (+ (div main_~i~0 4294967296) 1) (div main_~n~0 4294967296))) (<= 1023 main_~n~0) (= main_~i~0 0))} assume !(~j~0 % 4294967296 > 10000); {236#(and (not (<= (+ (div main_~i~0 4294967296) 1) (div main_~n~0 4294967296))) (<= 1023 main_~n~0) (= main_~i~0 0))} is VALID [2022-04-08 09:00:12,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {236#(and (not (<= (+ (div main_~i~0 4294967296) 1) (div main_~n~0 4294967296))) (<= 1023 main_~n~0) (= main_~i~0 0))} assume !(~i~0 % 4294967296 <= ~n~0 % 4294967296); {231#false} is VALID [2022-04-08 09:00:12,785 INFO L290 TraceCheckUtils]: 10: Hoare triple {231#false} ~a~0 := ~a~0[~i~0 % 4294967296 := 0]; {231#false} is VALID [2022-04-08 09:00:12,786 INFO L272 TraceCheckUtils]: 11: Hoare triple {231#false} call __VERIFIER_assert((if ~j~0 % 4294967296 < 1025 then 1 else 0)); {231#false} is VALID [2022-04-08 09:00:12,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {231#false} ~cond := #in~cond; {231#false} is VALID [2022-04-08 09:00:12,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {231#false} assume 0 == ~cond; {231#false} is VALID [2022-04-08 09:00:12,786 INFO L290 TraceCheckUtils]: 14: Hoare triple {231#false} assume !false; {231#false} is VALID [2022-04-08 09:00:12,786 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 09:00:12,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:00:12,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726294590] [2022-04-08 09:00:12,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726294590] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:00:12,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:00:12,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:00:12,787 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:00:12,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1021910067] [2022-04-08 09:00:12,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1021910067] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:00:12,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:00:12,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:00:12,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946638229] [2022-04-08 09:00:12,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:00:12,789 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 09:00:12,789 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:00:12,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:12,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:12,801 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 09:00:12,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:12,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 09:00:12,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 09:00:12,802 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:12,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:12,919 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-04-08 09:00:12,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 09:00:12,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 09:00:12,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:00:12,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:12,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-08 09:00:12,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:12,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-08 09:00:12,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-04-08 09:00:12,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:12,948 INFO L225 Difference]: With dead ends: 29 [2022-04-08 09:00:12,949 INFO L226 Difference]: Without dead ends: 23 [2022-04-08 09:00:12,949 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-08 09:00:12,950 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 16 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:00:12,950 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 33 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:00:12,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-08 09:00:12,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. [2022-04-08 09:00:12,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:00:12,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:12,961 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:12,961 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:12,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:12,962 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-08 09:00:12,962 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-08 09:00:12,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:12,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:12,963 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-08 09:00:12,963 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-08 09:00:12,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:12,964 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-08 09:00:12,964 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-08 09:00:12,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:12,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:12,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:00:12,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:00:12,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:12,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-04-08 09:00:12,965 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2022-04-08 09:00:12,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:00:12,966 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-04-08 09:00:12,966 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:12,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 18 transitions. [2022-04-08 09:00:12,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:12,982 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-08 09:00:12,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 09:00:12,983 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:00:12,983 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:00:12,983 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 09:00:12,983 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:00:12,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:00:12,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1230699476, now seen corresponding path program 1 times [2022-04-08 09:00:12,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:12,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1915651986] [2022-04-08 09:00:12,996 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:00:12,997 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:00:12,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1230699476, now seen corresponding path program 2 times [2022-04-08 09:00:12,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:00:12,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882570766] [2022-04-08 09:00:12,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:00:12,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:00:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 09:00:13,015 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 09:00:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 09:00:13,041 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 09:00:13,041 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-08 09:00:13,041 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-08 09:00:13,043 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 09:00:13,044 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 09:00:13,046 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2] [2022-04-08 09:00:13,048 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 09:00:13,055 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:00:13,056 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-08 09:00:13,056 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 09:00:13,056 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 09:00:13,056 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-08 09:00:13,056 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-08 09:00:13,056 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 09:00:13,056 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 09:00:13,056 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 09:00:13,056 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 09:00:13,056 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-08 09:00:13,056 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-08 09:00:13,056 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-08 09:00:13,056 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-08 09:00:13,056 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-08 09:00:13,056 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-08 09:00:13,056 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2022-04-08 09:00:13,056 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-08 09:00:13,057 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-08 09:00:13,057 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-08 09:00:13,057 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-08 09:00:13,057 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-08 09:00:13,057 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 09:00:13,057 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 09:00:13,057 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2022-04-08 09:00:13,057 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2022-04-08 09:00:13,057 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2022-04-08 09:00:13,057 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-08 09:00:13,057 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-08 09:00:13,057 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2022-04-08 09:00:13,057 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-08 09:00:13,057 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-08 09:00:13,057 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-08 09:00:13,057 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-08 09:00:13,057 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2022-04-08 09:00:13,057 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 09:00:13,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 09:00:13 BoogieIcfgContainer [2022-04-08 09:00:13,058 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 09:00:13,059 INFO L158 Benchmark]: Toolchain (without parser) took 1566.33ms. Allocated memory was 202.4MB in the beginning and 243.3MB in the end (delta: 40.9MB). Free memory was 151.9MB in the beginning and 168.8MB in the end (delta: -16.9MB). Peak memory consumption was 25.6MB. Max. memory is 8.0GB. [2022-04-08 09:00:13,060 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 202.4MB. Free memory was 168.2MB in the beginning and 168.0MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 09:00:13,060 INFO L158 Benchmark]: CACSL2BoogieTranslator took 175.86ms. Allocated memory is still 202.4MB. Free memory was 151.7MB in the beginning and 178.0MB in the end (delta: -26.3MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. [2022-04-08 09:00:13,060 INFO L158 Benchmark]: Boogie Preprocessor took 18.57ms. Allocated memory is still 202.4MB. Free memory was 178.0MB in the beginning and 176.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 09:00:13,060 INFO L158 Benchmark]: RCFGBuilder took 282.00ms. Allocated memory is still 202.4MB. Free memory was 176.3MB in the beginning and 165.2MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 09:00:13,061 INFO L158 Benchmark]: TraceAbstraction took 1086.02ms. Allocated memory was 202.4MB in the beginning and 243.3MB in the end (delta: 40.9MB). Free memory was 164.4MB in the beginning and 168.8MB in the end (delta: -4.4MB). Peak memory consumption was 36.8MB. Max. memory is 8.0GB. [2022-04-08 09:00:13,062 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.12ms. Allocated memory is still 202.4MB. Free memory was 168.2MB in the beginning and 168.0MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 175.86ms. Allocated memory is still 202.4MB. Free memory was 151.7MB in the beginning and 178.0MB in the end (delta: -26.3MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.57ms. Allocated memory is still 202.4MB. Free memory was 178.0MB in the beginning and 176.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 282.00ms. Allocated memory is still 202.4MB. Free memory was 176.3MB in the beginning and 165.2MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1086.02ms. Allocated memory was 202.4MB in the beginning and 243.3MB in the end (delta: 40.9MB). Free memory was 164.4MB in the beginning and 168.8MB in the end (delta: -4.4MB). Peak memory consumption was 36.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 - CounterExampleResult [Line: 8]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L12] int b; [L15] _Bool k=__VERIFIER_nondet_bool(); [L16] unsigned int i,n,j; [L17] int a[1025]; [L19] COND TRUE \read(k) [L20] n=0 [L25] i=0 [L26] j=__VERIFIER_nondet_uint() [L27] COND FALSE !(j > 10000) [L30] COND TRUE i <= n [L31] i++ [L32] j= j +2 [L30] COND FALSE !(i <= n) [L35] a[i]=0 [L36] CALL __VERIFIER_assert(j<1025) [L7] COND TRUE !(cond) [L8] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 52 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 51 mSDsluCounter, 74 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 96 IncrementalHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 47 mSDtfsCounter, 96 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 10, 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, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, 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 RESULT: Ultimate proved your program to be incorrect! [2022-04-08 09:00:13,102 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...