/usr/bin/java -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/nested5-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7968f31 [2022-03-18 00:59:38,390 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-18 00:59:38,391 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-18 00:59:38,455 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-18 00:59:38,456 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-18 00:59:38,457 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-18 00:59:38,460 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-18 00:59:38,462 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-18 00:59:38,463 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-18 00:59:38,464 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-18 00:59:38,465 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-18 00:59:38,465 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-18 00:59:38,466 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-18 00:59:38,466 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-18 00:59:38,467 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-18 00:59:38,468 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-18 00:59:38,469 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-18 00:59:38,469 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-18 00:59:38,470 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-18 00:59:38,472 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-18 00:59:38,473 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-18 00:59:38,473 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-18 00:59:38,474 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-18 00:59:38,475 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-18 00:59:38,476 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-18 00:59:38,478 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-18 00:59:38,478 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-18 00:59:38,478 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-18 00:59:38,479 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-18 00:59:38,479 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-18 00:59:38,480 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-18 00:59:38,480 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-18 00:59:38,481 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-18 00:59:38,482 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-18 00:59:38,482 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-18 00:59:38,483 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-18 00:59:38,483 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-18 00:59:38,484 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-18 00:59:38,484 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-18 00:59:38,484 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-18 00:59:38,485 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-18 00:59:38,488 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-18 00:59:38,489 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-03-18 00:59:38,496 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-18 00:59:38,497 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-18 00:59:38,498 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-18 00:59:38,498 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-18 00:59:38,498 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-18 00:59:38,498 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-18 00:59:38,498 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-18 00:59:38,498 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-18 00:59:38,498 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-18 00:59:38,498 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-18 00:59:38,499 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-18 00:59:38,499 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-18 00:59:38,499 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-18 00:59:38,499 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-18 00:59:38,499 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-18 00:59:38,499 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-18 00:59:38,499 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-18 00:59:38,500 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-18 00:59:38,500 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-03-18 00:59:38,500 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-03-18 00:59:38,500 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-18 00:59:38,500 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-03-18 00:59:38,500 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-03-18 00:59:38,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-18 00:59:38,721 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-18 00:59:38,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-18 00:59:38,724 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-18 00:59:38,725 INFO L275 PluginConnector]: CDTParser initialized [2022-03-18 00:59:38,726 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/nested5-1.c [2022-03-18 00:59:38,782 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28fafaa2f/b20b5ba66f7f492d8c1ee7404f667a52/FLAG1b36a0d80 [2022-03-18 00:59:39,108 INFO L306 CDTParser]: Found 1 translation units. [2022-03-18 00:59:39,109 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested5-1.c [2022-03-18 00:59:39,112 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28fafaa2f/b20b5ba66f7f492d8c1ee7404f667a52/FLAG1b36a0d80 [2022-03-18 00:59:39,531 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28fafaa2f/b20b5ba66f7f492d8c1ee7404f667a52 [2022-03-18 00:59:39,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-18 00:59:39,534 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-18 00:59:39,535 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-18 00:59:39,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-18 00:59:39,539 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-18 00:59:39,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.03 12:59:39" (1/1) ... [2022-03-18 00:59:39,541 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@204d6081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 12:59:39, skipping insertion in model container [2022-03-18 00:59:39,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.03 12:59:39" (1/1) ... [2022-03-18 00:59:39,547 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-18 00:59:39,557 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-18 00:59:39,665 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/nested5-1.c[321,334] [2022-03-18 00:59:39,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-18 00:59:39,694 INFO L203 MainTranslator]: Completed pre-run [2022-03-18 00:59:39,704 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/nested5-1.c[321,334] [2022-03-18 00:59:39,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-18 00:59:39,716 INFO L208 MainTranslator]: Completed translation [2022-03-18 00:59:39,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 12:59:39 WrapperNode [2022-03-18 00:59:39,717 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-18 00:59:39,718 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-18 00:59:39,718 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-18 00:59:39,718 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-18 00:59:39,726 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 12:59:39" (1/1) ... [2022-03-18 00:59:39,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 12:59:39" (1/1) ... [2022-03-18 00:59:39,732 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 12:59:39" (1/1) ... [2022-03-18 00:59:39,732 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 12:59:39" (1/1) ... [2022-03-18 00:59:39,742 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 12:59:39" (1/1) ... [2022-03-18 00:59:39,746 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 12:59:39" (1/1) ... [2022-03-18 00:59:39,747 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 12:59:39" (1/1) ... [2022-03-18 00:59:39,756 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-18 00:59:39,757 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-18 00:59:39,757 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-18 00:59:39,758 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-18 00:59:39,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 12:59:39" (1/1) ... [2022-03-18 00:59:39,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-18 00:59:39,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 00:59:39,786 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-03-18 00:59:39,788 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-03-18 00:59:39,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-18 00:59:39,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-18 00:59:39,812 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-18 00:59:39,812 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-18 00:59:39,812 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-18 00:59:39,812 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-18 00:59:39,812 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-18 00:59:39,812 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-18 00:59:39,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-18 00:59:39,812 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-18 00:59:39,813 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-18 00:59:39,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-18 00:59:39,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-18 00:59:39,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-18 00:59:39,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-18 00:59:39,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-18 00:59:39,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-18 00:59:39,864 INFO L234 CfgBuilder]: Building ICFG [2022-03-18 00:59:39,865 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-18 00:59:39,975 INFO L275 CfgBuilder]: Performing block encoding [2022-03-18 00:59:39,980 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-18 00:59:39,981 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-03-18 00:59:39,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.03 12:59:39 BoogieIcfgContainer [2022-03-18 00:59:39,982 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-18 00:59:39,996 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-18 00:59:39,997 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-18 00:59:40,016 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-18 00:59:40,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.03 12:59:39" (1/3) ... [2022-03-18 00:59:40,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f00451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.03 12:59:40, skipping insertion in model container [2022-03-18 00:59:40,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 12:59:39" (2/3) ... [2022-03-18 00:59:40,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f00451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.03 12:59:40, skipping insertion in model container [2022-03-18 00:59:40,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.03 12:59:39" (3/3) ... [2022-03-18 00:59:40,019 INFO L111 eAbstractionObserver]: Analyzing ICFG nested5-1.c [2022-03-18 00:59:40,023 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-18 00:59:40,023 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-18 00:59:40,070 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-18 00:59:40,076 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-03-18 00:59:40,076 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-18 00:59:40,087 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 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-03-18 00:59:40,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-18 00:59:40,093 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 00:59:40,093 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 00:59:40,094 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 00:59:40,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 00:59:40,098 INFO L85 PathProgramCache]: Analyzing trace with hash -531959740, now seen corresponding path program 1 times [2022-03-18 00:59:40,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 00:59:40,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [249481877] [2022-03-18 00:59:40,114 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 00:59:40,115 INFO L85 PathProgramCache]: Analyzing trace with hash -531959740, now seen corresponding path program 2 times [2022-03-18 00:59:40,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 00:59:40,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468483431] [2022-03-18 00:59:40,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 00:59:40,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 00:59:40,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 00:59:40,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 00:59:40,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 00:59:40,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 00:59:40,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 00:59:40,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468483431] [2022-03-18 00:59:40,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468483431] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 00:59:40,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 00:59:40,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-18 00:59:40,291 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 00:59:40,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [249481877] [2022-03-18 00:59:40,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [249481877] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 00:59:40,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 00:59:40,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-18 00:59:40,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545728239] [2022-03-18 00:59:40,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 00:59:40,296 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-18 00:59:40,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 00:59:40,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-18 00:59:40,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-18 00:59:40,325 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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-03-18 00:59:40,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 00:59:40,385 INFO L93 Difference]: Finished difference Result 50 states and 71 transitions. [2022-03-18 00:59:40,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-18 00:59:40,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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-03-18 00:59:40,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 00:59:40,395 INFO L225 Difference]: With dead ends: 50 [2022-03-18 00:59:40,395 INFO L226 Difference]: Without dead ends: 23 [2022-03-18 00:59:40,398 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-18 00:59:40,402 INFO L912 BasicCegarLoop]: 31 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 00:59:40,404 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 00:59:40,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-03-18 00:59:40,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-03-18 00:59:40,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-18 00:59:40,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-03-18 00:59:40,445 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2022-03-18 00:59:40,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 00:59:40,446 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-03-18 00:59:40,446 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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-03-18 00:59:40,446 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-03-18 00:59:40,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-18 00:59:40,447 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 00:59:40,447 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 00:59:40,447 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-18 00:59:40,448 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 00:59:40,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 00:59:40,451 INFO L85 PathProgramCache]: Analyzing trace with hash -537500866, now seen corresponding path program 1 times [2022-03-18 00:59:40,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 00:59:40,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1095350922] [2022-03-18 00:59:40,454 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 00:59:40,454 INFO L85 PathProgramCache]: Analyzing trace with hash -537500866, now seen corresponding path program 2 times [2022-03-18 00:59:40,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 00:59:40,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229686397] [2022-03-18 00:59:40,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 00:59:40,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 00:59:40,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 00:59:40,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 00:59:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 00:59:40,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 00:59:40,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 00:59:40,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229686397] [2022-03-18 00:59:40,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229686397] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 00:59:40,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 00:59:40,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 00:59:40,601 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 00:59:40,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1095350922] [2022-03-18 00:59:40,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1095350922] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 00:59:40,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 00:59:40,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 00:59:40,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107339645] [2022-03-18 00:59:40,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 00:59:40,603 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 00:59:40,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 00:59:40,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 00:59:40,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 00:59:40,604 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 00:59:40,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 00:59:40,666 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2022-03-18 00:59:40,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 00:59:40,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-03-18 00:59:40,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 00:59:40,668 INFO L225 Difference]: With dead ends: 49 [2022-03-18 00:59:40,668 INFO L226 Difference]: Without dead ends: 32 [2022-03-18 00:59:40,669 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-18 00:59:40,671 INFO L912 BasicCegarLoop]: 24 mSDtfsCounter, 41 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 00:59:40,672 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 31 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 00:59:40,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-03-18 00:59:40,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2022-03-18 00:59:40,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-18 00:59:40,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-03-18 00:59:40,690 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 15 [2022-03-18 00:59:40,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 00:59:40,690 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-03-18 00:59:40,690 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 00:59:40,691 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-03-18 00:59:40,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-18 00:59:40,691 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 00:59:40,691 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 00:59:40,691 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-18 00:59:40,692 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 00:59:40,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 00:59:40,692 INFO L85 PathProgramCache]: Analyzing trace with hash -509289700, now seen corresponding path program 1 times [2022-03-18 00:59:40,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 00:59:40,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [487598292] [2022-03-18 00:59:40,796 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-03-18 00:59:40,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1836574324, now seen corresponding path program 1 times [2022-03-18 00:59:40,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 00:59:40,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069742345] [2022-03-18 00:59:40,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 00:59:40,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 00:59:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 00:59:41,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 00:59:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 00:59:41,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 00:59:41,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 00:59:41,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069742345] [2022-03-18 00:59:41,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069742345] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 00:59:41,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 00:59:41,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-18 00:59:41,231 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 00:59:41,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [487598292] [2022-03-18 00:59:41,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [487598292] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 00:59:41,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 00:59:41,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-18 00:59:41,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494094688] [2022-03-18 00:59:41,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 00:59:41,233 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-18 00:59:41,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 00:59:41,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-18 00:59:41,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-18 00:59:41,234 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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-03-18 00:59:41,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 00:59:41,570 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2022-03-18 00:59:41,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-18 00:59:41,570 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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 17 [2022-03-18 00:59:41,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 00:59:41,571 INFO L225 Difference]: With dead ends: 49 [2022-03-18 00:59:41,571 INFO L226 Difference]: Without dead ends: 47 [2022-03-18 00:59:41,572 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-03-18 00:59:41,573 INFO L912 BasicCegarLoop]: 31 mSDtfsCounter, 93 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-18 00:59:41,573 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 58 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-18 00:59:41,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-03-18 00:59:41,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31. [2022-03-18 00:59:41,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-18 00:59:41,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-03-18 00:59:41,586 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 17 [2022-03-18 00:59:41,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 00:59:41,586 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-03-18 00:59:41,587 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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-03-18 00:59:41,587 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-03-18 00:59:41,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-18 00:59:41,587 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 00:59:41,587 INFO L500 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 00:59:41,588 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-18 00:59:41,588 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 00:59:41,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 00:59:41,588 INFO L85 PathProgramCache]: Analyzing trace with hash 831837050, now seen corresponding path program 2 times [2022-03-18 00:59:41,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 00:59:41,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1274869644] [2022-03-18 00:59:41,658 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-03-18 00:59:41,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1895679668, now seen corresponding path program 1 times [2022-03-18 00:59:41,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 00:59:41,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896401699] [2022-03-18 00:59:41,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 00:59:41,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 00:59:41,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 00:59:41,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 00:59:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 00:59:41,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 00:59:41,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 00:59:41,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896401699] [2022-03-18 00:59:41,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896401699] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 00:59:41,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 00:59:41,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-18 00:59:42,036 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 00:59:42,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1274869644] [2022-03-18 00:59:42,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1274869644] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 00:59:42,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 00:59:42,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-18 00:59:42,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331781802] [2022-03-18 00:59:42,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 00:59:42,037 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-18 00:59:42,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 00:59:42,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-18 00:59:42,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-03-18 00:59:42,038 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 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-03-18 00:59:42,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 00:59:42,842 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-03-18 00:59:42,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-18 00:59:42,843 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 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 19 [2022-03-18 00:59:42,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 00:59:42,844 INFO L225 Difference]: With dead ends: 39 [2022-03-18 00:59:42,844 INFO L226 Difference]: Without dead ends: 0 [2022-03-18 00:59:42,844 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2022-03-18 00:59:42,845 INFO L912 BasicCegarLoop]: 29 mSDtfsCounter, 74 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-18 00:59:42,845 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 61 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-18 00:59:42,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-18 00:59:42,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-18 00:59:42,846 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-03-18 00:59:42,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-18 00:59:42,847 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2022-03-18 00:59:42,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 00:59:42,847 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-18 00:59:42,847 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 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-03-18 00:59:42,847 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-18 00:59:42,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-18 00:59:42,849 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-18 00:59:42,850 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-18 00:59:42,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-03-18 00:59:43,341 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-03-18 00:59:43,342 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-03-18 00:59:43,342 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-03-18 00:59:43,342 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-03-18 00:59:43,342 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-03-18 00:59:43,342 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-03-18 00:59:43,342 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-03-18 00:59:43,342 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-03-18 00:59:43,342 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-03-18 00:59:43,343 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-03-18 00:59:43,343 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 12 27) the Hoare annotation is: true [2022-03-18 00:59:43,343 INFO L878 garLoopResultBuilder]: At program point L23-2(line 23) the Hoare annotation is: (let ((.cse0 (< (mod main_~v~0 4294967296) 10))) (or (and .cse0 (or (= main_~v~0 0) (and (<= 0 main_~v~0) (= |main_#t~post8| 0) (< (mod (+ main_~v~0 4294967295) 4294967296) 10)))) (and .cse0 (or (= main_~v~0 1) (and (<= 1 main_~v~0) (< (mod (+ main_~v~0 4294967294) 4294967296) 10)))))) [2022-03-18 00:59:43,343 INFO L878 garLoopResultBuilder]: At program point L23-3(line 23) the Hoare annotation is: (or (= main_~v~0 0) (and (or (= main_~v~0 1) (and (<= 1 main_~v~0) (< (mod (+ main_~v~0 4294967294) 4294967296) 10))) (< (mod (+ main_~v~0 4294967295) 4294967296) 10))) [2022-03-18 00:59:43,345 INFO L878 garLoopResultBuilder]: At program point L23-4(line 23) the Hoare annotation is: (and (<= 2 main_~v~0) (<= (+ (* (div main_~v~0 4294967296) 4294967296) 10) main_~v~0) (< (mod (+ main_~v~0 4294967295) 4294967296) 10)) [2022-03-18 00:59:43,346 INFO L878 garLoopResultBuilder]: At program point L19-2(lines 19 25) the Hoare annotation is: (let ((.cse0 (< (mod (+ main_~v~0 4294967295) 4294967296) 10))) (or (= main_~v~0 0) (and (<= 0 main_~v~0) (= |main_#t~post8| 0) .cse0) (and (<= 2 main_~v~0) (<= (+ (* (div main_~v~0 4294967296) 4294967296) 10) main_~v~0) .cse0))) [2022-03-18 00:59:43,346 INFO L878 garLoopResultBuilder]: At program point L19-3(lines 19 25) the Hoare annotation is: (let ((.cse0 (< (mod (+ main_~v~0 4294967295) 4294967296) 10))) (or (= main_~v~0 0) (and (<= 0 main_~v~0) (= |main_#t~post8| 0) .cse0) (and (<= 2 main_~v~0) (<= (+ (* (div main_~v~0 4294967296) 4294967296) 10) main_~v~0) .cse0))) [2022-03-18 00:59:43,346 INFO L885 garLoopResultBuilder]: At program point L19-4(lines 19 25) the Hoare annotation is: true [2022-03-18 00:59:43,346 INFO L878 garLoopResultBuilder]: At program point L24(lines 22 25) the Hoare annotation is: (and (<= 2 main_~v~0) (<= (+ (* (div main_~v~0 4294967296) 4294967296) 10) main_~v~0) (< (mod (+ main_~v~0 4294967295) 4294967296) 10)) [2022-03-18 00:59:43,346 INFO L878 garLoopResultBuilder]: At program point L20-2(lines 20 25) the Hoare annotation is: (let ((.cse0 (< (mod (+ main_~v~0 4294967295) 4294967296) 10))) (or (= main_~v~0 0) (and (<= 0 main_~v~0) (= |main_#t~post8| 0) .cse0) (and (<= 2 main_~v~0) (<= (+ (* (div main_~v~0 4294967296) 4294967296) 10) main_~v~0) .cse0))) [2022-03-18 00:59:43,346 INFO L878 garLoopResultBuilder]: At program point L20-3(lines 20 25) the Hoare annotation is: (let ((.cse0 (< (mod (+ main_~v~0 4294967295) 4294967296) 10))) (or (= main_~v~0 0) (and (<= 0 main_~v~0) (= |main_#t~post8| 0) .cse0) (and (<= 2 main_~v~0) (<= (+ (* (div main_~v~0 4294967296) 4294967296) 10) main_~v~0) .cse0))) [2022-03-18 00:59:43,346 INFO L878 garLoopResultBuilder]: At program point L21-2(lines 21 25) the Hoare annotation is: (let ((.cse0 (< (mod (+ main_~v~0 4294967295) 4294967296) 10))) (or (= main_~v~0 0) (and (<= 0 main_~v~0) (= |main_#t~post8| 0) .cse0) (and (<= 2 main_~v~0) (<= (+ (* (div main_~v~0 4294967296) 4294967296) 10) main_~v~0) .cse0))) [2022-03-18 00:59:43,347 INFO L878 garLoopResultBuilder]: At program point L21-3(lines 21 25) the Hoare annotation is: (let ((.cse0 (< (mod (+ main_~v~0 4294967295) 4294967296) 10))) (or (= main_~v~0 0) (and (<= 0 main_~v~0) (= |main_#t~post8| 0) .cse0) (and (<= 2 main_~v~0) (<= (+ (* (div main_~v~0 4294967296) 4294967296) 10) main_~v~0) .cse0))) [2022-03-18 00:59:43,347 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 12 27) the Hoare annotation is: true [2022-03-18 00:59:43,347 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 12 27) the Hoare annotation is: true [2022-03-18 00:59:43,347 INFO L878 garLoopResultBuilder]: At program point L22-2(lines 22 25) the Hoare annotation is: (let ((.cse0 (< (mod (+ main_~v~0 4294967295) 4294967296) 10))) (or (= main_~v~0 0) (and (<= 0 main_~v~0) (= |main_#t~post8| 0) .cse0) (and (<= 2 main_~v~0) (<= (+ (* (div main_~v~0 4294967296) 4294967296) 10) main_~v~0) .cse0))) [2022-03-18 00:59:43,347 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-03-18 00:59:43,347 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 5 10) the Hoare annotation is: (or (<= 2 __VERIFIER_assert_~cond) (and (not (<= 2 |__VERIFIER_assert_#in~cond|)) (not (<= (+ 2 |__VERIFIER_assert_#in~cond|) 0))) (<= (+ 2 __VERIFIER_assert_~cond) 0)) [2022-03-18 00:59:43,347 INFO L878 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (and (not (<= 2 |__VERIFIER_assert_#in~cond|)) (not (<= (+ 2 |__VERIFIER_assert_#in~cond|) 0))) [2022-03-18 00:59:43,347 INFO L878 garLoopResultBuilder]: At program point L6(lines 6 8) the Hoare annotation is: (or (<= 2 __VERIFIER_assert_~cond) (and (not (<= 2 |__VERIFIER_assert_#in~cond|)) (not (<= (+ 2 |__VERIFIER_assert_#in~cond|) 0))) (<= (+ 2 __VERIFIER_assert_~cond) 0)) [2022-03-18 00:59:43,348 INFO L878 garLoopResultBuilder]: At program point L6-2(lines 5 10) the Hoare annotation is: (or (<= 2 __VERIFIER_assert_~cond) (and (not (<= 2 |__VERIFIER_assert_#in~cond|)) (not (<= (+ 2 |__VERIFIER_assert_#in~cond|) 0))) (<= (+ 2 __VERIFIER_assert_~cond) 0)) [2022-03-18 00:59:43,348 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) the Hoare annotation is: (and (not (<= 2 |__VERIFIER_assert_#in~cond|)) (not (<= (+ 2 |__VERIFIER_assert_#in~cond|) 0))) [2022-03-18 00:59:43,351 INFO L718 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1] [2022-03-18 00:59:43,352 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-18 00:59:43,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.03 12:59:43 BoogieIcfgContainer [2022-03-18 00:59:43,365 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-18 00:59:43,366 INFO L158 Benchmark]: Toolchain (without parser) took 3832.15ms. Allocated memory was 170.9MB in the beginning and 218.1MB in the end (delta: 47.2MB). Free memory was 122.0MB in the beginning and 116.4MB in the end (delta: 5.7MB). Peak memory consumption was 53.6MB. Max. memory is 8.0GB. [2022-03-18 00:59:43,366 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 170.9MB. Free memory is still 138.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-18 00:59:43,367 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.24ms. Allocated memory is still 170.9MB. Free memory was 121.9MB in the beginning and 148.1MB in the end (delta: -26.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-03-18 00:59:43,367 INFO L158 Benchmark]: Boogie Preprocessor took 38.87ms. Allocated memory is still 170.9MB. Free memory was 148.1MB in the beginning and 146.8MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-18 00:59:43,367 INFO L158 Benchmark]: RCFGBuilder took 224.75ms. Allocated memory is still 170.9MB. Free memory was 146.6MB in the beginning and 136.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-03-18 00:59:43,368 INFO L158 Benchmark]: TraceAbstraction took 3369.23ms. Allocated memory was 170.9MB in the beginning and 218.1MB in the end (delta: 47.2MB). Free memory was 135.5MB in the beginning and 116.4MB in the end (delta: 19.2MB). Peak memory consumption was 66.9MB. Max. memory is 8.0GB. [2022-03-18 00:59:43,369 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 170.9MB. Free memory is still 138.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 182.24ms. Allocated memory is still 170.9MB. Free memory was 121.9MB in the beginning and 148.1MB in the end (delta: -26.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.87ms. Allocated memory is still 170.9MB. Free memory was 148.1MB in the beginning and 146.8MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 224.75ms. Allocated memory is still 170.9MB. Free memory was 146.6MB in the beginning and 136.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3369.23ms. Allocated memory was 170.9MB in the beginning and 218.1MB in the end (delta: 47.2MB). Free memory was 135.5MB in the beginning and 116.4MB in the end (delta: 19.2MB). Peak memory consumption was 66.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 7]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 234 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 231 mSDsluCounter, 184 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 69 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 348 IncrementalHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 115 mSDtfsCounter, 348 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=3, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 24 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 46 PreInvPairs, 78 NumberOfFragments, 479 HoareAnnotationTreeSize, 46 FomulaSimplifications, 52 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 28 FomulaSimplificationsInter, 150 FormulaSimplificationTreeSizeReductionInter, 0.4s 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: 21]: Loop Invariant Derived loop invariant: (v == 0 || ((0 <= v && aux-v++-aux == 0) && (v + 4294967295) % 4294967296 < 10)) || ((2 <= v && v / 4294967296 * 4294967296 + 10 <= v) && (v + 4294967295) % 4294967296 < 10) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (v == 0 || ((0 <= v && aux-v++-aux == 0) && (v + 4294967295) % 4294967296 < 10)) || ((2 <= v && v / 4294967296 * 4294967296 + 10 <= v) && (v + 4294967295) % 4294967296 < 10) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (v == 0 || ((0 <= v && aux-v++-aux == 0) && (v + 4294967295) % 4294967296 < 10)) || ((2 <= v && v / 4294967296 * 4294967296 + 10 <= v) && (v + 4294967295) % 4294967296 < 10) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: v == 0 || ((v == 1 || (1 <= v && (v + 4294967294) % 4294967296 < 10)) && (v + 4294967295) % 4294967296 < 10) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (v == 0 || ((0 <= v && aux-v++-aux == 0) && (v + 4294967295) % 4294967296 < 10)) || ((2 <= v && v / 4294967296 * 4294967296 + 10 <= v) && (v + 4294967295) % 4294967296 < 10) - ProcedureContractResult [Line: 12]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 5]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: (2 <= cond || (!(2 <= \old(cond)) && !(2 + \old(cond) <= 0))) || 2 + cond <= 0 RESULT: Ultimate proved your program to be correct! [2022-03-18 00:59:43,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...