/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/watermelon.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-20 19:08:22,622 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-20 19:08:22,623 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-20 19:08:22,652 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-20 19:08:22,652 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-20 19:08:22,653 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-20 19:08:22,654 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-20 19:08:22,655 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-20 19:08:22,656 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-20 19:08:22,656 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-20 19:08:22,657 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-20 19:08:22,657 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-20 19:08:22,657 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-20 19:08:22,658 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-20 19:08:22,659 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-20 19:08:22,659 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-20 19:08:22,660 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-20 19:08:22,660 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-20 19:08:22,661 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-20 19:08:22,662 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-20 19:08:22,663 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-20 19:08:22,663 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-20 19:08:22,664 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-20 19:08:22,664 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-20 19:08:22,665 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-20 19:08:22,666 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-20 19:08:22,666 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-20 19:08:22,666 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-20 19:08:22,667 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-20 19:08:22,667 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-20 19:08:22,668 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-20 19:08:22,668 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-20 19:08:22,668 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-20 19:08:22,669 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-20 19:08:22,669 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-20 19:08:22,670 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-20 19:08:22,670 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-20 19:08:22,670 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-20 19:08:22,670 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-20 19:08:22,670 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-20 19:08:22,671 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-20 19:08:22,677 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-20 19:08:22,677 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-03-20 19:08:22,683 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-20 19:08:22,684 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-20 19:08:22,685 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-20 19:08:22,686 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-20 19:08:22,686 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-20 19:08:22,686 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-20 19:08:22,686 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-20 19:08:22,686 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-20 19:08:22,686 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-20 19:08:22,686 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-20 19:08:22,686 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-20 19:08:22,687 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-20 19:08:22,687 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-20 19:08:22,687 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-20 19:08:22,687 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-20 19:08:22,687 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 19:08:22,687 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-20 19:08:22,687 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-20 19:08:22,687 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-03-20 19:08:22,687 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-03-20 19:08:22,687 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-20 19:08:22,687 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-03-20 19:08:22,688 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-20 19:08:22,865 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-20 19:08:22,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-20 19:08:22,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-20 19:08:22,885 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-20 19:08:22,886 INFO L275 PluginConnector]: CDTParser initialized [2022-03-20 19:08:22,886 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/watermelon.c [2022-03-20 19:08:22,933 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38714543d/b46f4c2feba340c5a2474eb980c70847/FLAG85572ad08 [2022-03-20 19:08:23,230 INFO L306 CDTParser]: Found 1 translation units. [2022-03-20 19:08:23,231 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/watermelon.c [2022-03-20 19:08:23,235 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38714543d/b46f4c2feba340c5a2474eb980c70847/FLAG85572ad08 [2022-03-20 19:08:23,655 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38714543d/b46f4c2feba340c5a2474eb980c70847 [2022-03-20 19:08:23,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-20 19:08:23,657 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-20 19:08:23,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-20 19:08:23,659 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-20 19:08:23,661 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-20 19:08:23,661 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 07:08:23" (1/1) ... [2022-03-20 19:08:23,662 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@741b0190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:08:23, skipping insertion in model container [2022-03-20 19:08:23,662 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 07:08:23" (1/1) ... [2022-03-20 19:08:23,666 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-20 19:08:23,673 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-20 19:08:23,779 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/watermelon.c[373,386] [2022-03-20 19:08:23,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 19:08:23,799 INFO L203 MainTranslator]: Completed pre-run [2022-03-20 19:08:23,810 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/watermelon.c[373,386] [2022-03-20 19:08:23,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 19:08:23,834 INFO L208 MainTranslator]: Completed translation [2022-03-20 19:08:23,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:08:23 WrapperNode [2022-03-20 19:08:23,834 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-20 19:08:23,835 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-20 19:08:23,835 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-20 19:08:23,835 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-20 19:08:23,841 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:08:23" (1/1) ... [2022-03-20 19:08:23,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:08:23" (1/1) ... [2022-03-20 19:08:23,845 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:08:23" (1/1) ... [2022-03-20 19:08:23,845 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:08:23" (1/1) ... [2022-03-20 19:08:23,848 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:08:23" (1/1) ... [2022-03-20 19:08:23,854 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:08:23" (1/1) ... [2022-03-20 19:08:23,863 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:08:23" (1/1) ... [2022-03-20 19:08:23,865 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-20 19:08:23,866 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-20 19:08:23,866 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-20 19:08:23,866 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-20 19:08:23,867 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:08:23" (1/1) ... [2022-03-20 19:08:23,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 19:08:23,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 19:08:23,887 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-20 19:08:23,897 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-20 19:08:23,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-20 19:08:23,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-20 19:08:23,909 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-20 19:08:23,910 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-20 19:08:23,910 INFO L138 BoogieDeclarations]: Found implementation of procedure correct_version [2022-03-20 19:08:23,910 INFO L138 BoogieDeclarations]: Found implementation of procedure student_version [2022-03-20 19:08:23,910 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-20 19:08:23,910 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-20 19:08:23,910 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-20 19:08:23,910 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-20 19:08:23,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-20 19:08:23,911 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-03-20 19:08:23,911 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-20 19:08:23,912 INFO L130 BoogieDeclarations]: Found specification of procedure correct_version [2022-03-20 19:08:23,912 INFO L130 BoogieDeclarations]: Found specification of procedure student_version [2022-03-20 19:08:23,913 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-20 19:08:23,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-20 19:08:23,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-20 19:08:23,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-20 19:08:23,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-20 19:08:23,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-20 19:08:23,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-20 19:08:23,963 INFO L234 CfgBuilder]: Building ICFG [2022-03-20 19:08:23,964 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-20 19:08:24,094 INFO L275 CfgBuilder]: Performing block encoding [2022-03-20 19:08:24,098 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-20 19:08:24,099 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-20 19:08:24,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 07:08:24 BoogieIcfgContainer [2022-03-20 19:08:24,101 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-20 19:08:24,102 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-20 19:08:24,102 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-20 19:08:24,104 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-20 19:08:24,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 07:08:23" (1/3) ... [2022-03-20 19:08:24,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bdcd31f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 07:08:24, skipping insertion in model container [2022-03-20 19:08:24,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:08:23" (2/3) ... [2022-03-20 19:08:24,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bdcd31f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 07:08:24, skipping insertion in model container [2022-03-20 19:08:24,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 07:08:24" (3/3) ... [2022-03-20 19:08:24,106 INFO L111 eAbstractionObserver]: Analyzing ICFG watermelon.c [2022-03-20 19:08:24,109 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-20 19:08:24,109 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-20 19:08:24,134 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-20 19:08:24,138 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-20 19:08:24,138 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-20 19:08:24,147 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 29 states have internal predecessors, (38), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-03-20 19:08:24,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-20 19:08:24,152 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 19:08:24,152 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 19:08:24,152 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 19:08:24,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 19:08:24,156 INFO L85 PathProgramCache]: Analyzing trace with hash 345664661, now seen corresponding path program 1 times [2022-03-20 19:08:24,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 19:08:24,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1737562774] [2022-03-20 19:08:24,167 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 19:08:24,167 INFO L85 PathProgramCache]: Analyzing trace with hash 345664661, now seen corresponding path program 2 times [2022-03-20 19:08:24,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 19:08:24,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453258730] [2022-03-20 19:08:24,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 19:08:24,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 19:08:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:08:24,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 19:08:24,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:08:24,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-03-20 19:08:24,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:08:24,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-03-20 19:08:24,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:08:24,523 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-20 19:08:24,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 19:08:24,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453258730] [2022-03-20 19:08:24,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453258730] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 19:08:24,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 19:08:24,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-20 19:08:24,527 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 19:08:24,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1737562774] [2022-03-20 19:08:24,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1737562774] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 19:08:24,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 19:08:24,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-20 19:08:24,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054631965] [2022-03-20 19:08:24,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 19:08:24,534 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-20 19:08:24,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 19:08:24,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-20 19:08:24,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-03-20 19:08:24,556 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 29 states have internal predecessors, (38), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-20 19:08:24,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 19:08:24,975 INFO L93 Difference]: Finished difference Result 91 states and 114 transitions. [2022-03-20 19:08:24,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-20 19:08:24,977 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-03-20 19:08:24,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 19:08:24,986 INFO L225 Difference]: With dead ends: 91 [2022-03-20 19:08:24,986 INFO L226 Difference]: Without dead ends: 42 [2022-03-20 19:08:24,991 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2022-03-20 19:08:24,993 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 63 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 19:08:24,994 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 89 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 19:08:25,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-03-20 19:08:25,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2022-03-20 19:08:25,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-03-20 19:08:25,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2022-03-20 19:08:25,036 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 25 [2022-03-20 19:08:25,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 19:08:25,036 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2022-03-20 19:08:25,036 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-20 19:08:25,036 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2022-03-20 19:08:25,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-20 19:08:25,038 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 19:08:25,038 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 19:08:25,038 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-20 19:08:25,038 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 19:08:25,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 19:08:25,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1324779677, now seen corresponding path program 1 times [2022-03-20 19:08:25,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 19:08:25,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [335966829] [2022-03-20 19:08:25,039 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 19:08:25,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1324779677, now seen corresponding path program 2 times [2022-03-20 19:08:25,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 19:08:25,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379473362] [2022-03-20 19:08:25,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 19:08:25,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 19:08:25,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:08:25,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 19:08:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:08:25,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-03-20 19:08:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:08:25,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-03-20 19:08:25,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:08:25,088 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-20 19:08:25,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 19:08:25,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379473362] [2022-03-20 19:08:25,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379473362] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 19:08:25,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 19:08:25,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 19:08:25,089 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 19:08:25,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [335966829] [2022-03-20 19:08:25,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [335966829] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 19:08:25,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 19:08:25,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 19:08:25,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249141994] [2022-03-20 19:08:25,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 19:08:25,091 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 19:08:25,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 19:08:25,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 19:08:25,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 19:08:25,092 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 19:08:25,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 19:08:25,148 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-03-20 19:08:25,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 19:08:25,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2022-03-20 19:08:25,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 19:08:25,150 INFO L225 Difference]: With dead ends: 55 [2022-03-20 19:08:25,150 INFO L226 Difference]: Without dead ends: 42 [2022-03-20 19:08:25,151 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-20 19:08:25,152 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 29 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 19:08:25,153 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 33 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 19:08:25,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-03-20 19:08:25,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2022-03-20 19:08:25,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-03-20 19:08:25,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2022-03-20 19:08:25,171 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 27 [2022-03-20 19:08:25,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 19:08:25,171 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2022-03-20 19:08:25,171 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 19:08:25,171 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-03-20 19:08:25,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-20 19:08:25,172 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 19:08:25,172 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 19:08:25,173 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-20 19:08:25,173 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 19:08:25,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 19:08:25,173 INFO L85 PathProgramCache]: Analyzing trace with hash -855151641, now seen corresponding path program 1 times [2022-03-20 19:08:25,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 19:08:25,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1738787309] [2022-03-20 19:08:25,176 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 19:08:25,177 INFO L85 PathProgramCache]: Analyzing trace with hash -855151641, now seen corresponding path program 2 times [2022-03-20 19:08:25,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 19:08:25,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144850689] [2022-03-20 19:08:25,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 19:08:25,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 19:08:25,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:08:25,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 19:08:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:08:25,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-03-20 19:08:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:08:25,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-03-20 19:08:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:08:25,247 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-20 19:08:25,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 19:08:25,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144850689] [2022-03-20 19:08:25,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144850689] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 19:08:25,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 19:08:25,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 19:08:25,248 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 19:08:25,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1738787309] [2022-03-20 19:08:25,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1738787309] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 19:08:25,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 19:08:25,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 19:08:25,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830285124] [2022-03-20 19:08:25,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 19:08:25,249 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 19:08:25,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 19:08:25,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 19:08:25,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 19:08:25,250 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-20 19:08:25,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 19:08:25,303 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2022-03-20 19:08:25,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 19:08:25,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-03-20 19:08:25,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 19:08:25,304 INFO L225 Difference]: With dead ends: 72 [2022-03-20 19:08:25,304 INFO L226 Difference]: Without dead ends: 43 [2022-03-20 19:08:25,304 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-20 19:08:25,305 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 29 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 19:08:25,305 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 33 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 19:08:25,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-03-20 19:08:25,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2022-03-20 19:08:25,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-03-20 19:08:25,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2022-03-20 19:08:25,311 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 27 [2022-03-20 19:08:25,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 19:08:25,311 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2022-03-20 19:08:25,311 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-20 19:08:25,312 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-03-20 19:08:25,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-20 19:08:25,312 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 19:08:25,312 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 19:08:25,312 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-20 19:08:25,312 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 19:08:25,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 19:08:25,313 INFO L85 PathProgramCache]: Analyzing trace with hash 743790053, now seen corresponding path program 1 times [2022-03-20 19:08:25,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 19:08:25,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [622824823] [2022-03-20 19:08:25,369 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-03-20 19:08:25,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1203586262, now seen corresponding path program 1 times [2022-03-20 19:08:25,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 19:08:25,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38552366] [2022-03-20 19:08:25,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 19:08:25,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 19:08:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:08:25,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 19:08:25,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:08:25,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-03-20 19:08:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:08:25,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-03-20 19:08:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:08:25,472 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-20 19:08:25,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 19:08:25,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38552366] [2022-03-20 19:08:25,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38552366] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 19:08:25,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 19:08:25,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-20 19:08:25,507 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 19:08:25,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [622824823] [2022-03-20 19:08:25,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [622824823] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 19:08:25,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 19:08:25,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-20 19:08:25,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808437106] [2022-03-20 19:08:25,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 19:08:25,508 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 19:08:25,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 19:08:25,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 19:08:25,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-03-20 19:08:25,509 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-20 19:08:25,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 19:08:25,665 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2022-03-20 19:08:25,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 19:08:25,665 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-03-20 19:08:25,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 19:08:25,666 INFO L225 Difference]: With dead ends: 65 [2022-03-20 19:08:25,666 INFO L226 Difference]: Without dead ends: 52 [2022-03-20 19:08:25,666 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-03-20 19:08:25,667 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 47 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 19:08:25,667 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 49 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 19:08:25,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-03-20 19:08:25,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2022-03-20 19:08:25,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-03-20 19:08:25,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-03-20 19:08:25,674 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 29 [2022-03-20 19:08:25,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 19:08:25,674 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-03-20 19:08:25,674 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-20 19:08:25,674 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-03-20 19:08:25,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-20 19:08:25,675 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 19:08:25,675 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 19:08:25,675 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-20 19:08:25,675 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 19:08:25,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 19:08:25,675 INFO L85 PathProgramCache]: Analyzing trace with hash 198429957, now seen corresponding path program 1 times [2022-03-20 19:08:25,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 19:08:25,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [601696714] [2022-03-20 19:08:25,703 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-03-20 19:08:25,703 INFO L85 PathProgramCache]: Analyzing trace with hash -755394225, now seen corresponding path program 1 times [2022-03-20 19:08:25,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 19:08:25,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943489091] [2022-03-20 19:08:25,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 19:08:25,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 19:08:25,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:08:25,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 19:08:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:08:25,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-03-20 19:08:25,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:08:25,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-20 19:08:25,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:08:25,798 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-20 19:08:25,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 19:08:25,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943489091] [2022-03-20 19:08:25,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943489091] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 19:08:25,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 19:08:25,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-20 19:08:25,913 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 19:08:25,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [601696714] [2022-03-20 19:08:25,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [601696714] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 19:08:25,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 19:08:25,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-03-20 19:08:25,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923448456] [2022-03-20 19:08:25,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 19:08:25,914 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-20 19:08:25,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 19:08:25,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-20 19:08:25,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-03-20 19:08:25,915 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-20 19:08:26,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 19:08:26,092 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2022-03-20 19:08:26,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 19:08:26,092 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-03-20 19:08:26,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 19:08:26,093 INFO L225 Difference]: With dead ends: 60 [2022-03-20 19:08:26,093 INFO L226 Difference]: Without dead ends: 51 [2022-03-20 19:08:26,093 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2022-03-20 19:08:26,094 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 60 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 19:08:26,094 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 67 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 227 Invalid, 0 Unknown, 84 Unchecked, 0.1s Time] [2022-03-20 19:08:26,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-03-20 19:08:26,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 44. [2022-03-20 19:08:26,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.15625) internal successors, (37), 34 states have internal predecessors, (37), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-03-20 19:08:26,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2022-03-20 19:08:26,101 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 29 [2022-03-20 19:08:26,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 19:08:26,101 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2022-03-20 19:08:26,102 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-20 19:08:26,102 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-03-20 19:08:26,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-20 19:08:26,102 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 19:08:26,102 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 19:08:26,102 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-20 19:08:26,102 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 19:08:26,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 19:08:26,103 INFO L85 PathProgramCache]: Analyzing trace with hash 69442535, now seen corresponding path program 2 times [2022-03-20 19:08:26,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 19:08:26,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [295324412] [2022-03-20 19:08:26,132 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-03-20 19:08:26,132 INFO L85 PathProgramCache]: Analyzing trace with hash -587511126, now seen corresponding path program 1 times [2022-03-20 19:08:26,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 19:08:26,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001212172] [2022-03-20 19:08:26,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 19:08:26,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 19:08:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:08:26,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 19:08:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:08:26,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-03-20 19:08:26,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:08:26,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-03-20 19:08:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:08:26,236 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-20 19:08:26,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 19:08:26,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001212172] [2022-03-20 19:08:26,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001212172] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 19:08:26,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 19:08:26,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-20 19:08:26,435 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 19:08:26,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [295324412] [2022-03-20 19:08:26,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [295324412] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 19:08:26,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 19:08:26,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-03-20 19:08:26,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987253760] [2022-03-20 19:08:26,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 19:08:26,435 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-20 19:08:26,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 19:08:26,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-20 19:08:26,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-03-20 19:08:26,436 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 16 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-20 19:08:26,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 19:08:26,788 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2022-03-20 19:08:26,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-20 19:08:26,788 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-03-20 19:08:26,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 19:08:26,789 INFO L225 Difference]: With dead ends: 72 [2022-03-20 19:08:26,789 INFO L226 Difference]: Without dead ends: 58 [2022-03-20 19:08:26,789 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=722, Unknown=0, NotChecked=0, Total=870 [2022-03-20 19:08:26,790 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 64 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 19:08:26,790 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 54 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 19:08:26,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-03-20 19:08:26,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2022-03-20 19:08:26,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.15) internal successors, (46), 44 states have internal predecessors, (46), 7 states have call successors, (7), 5 states have call predecessors, (7), 7 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-03-20 19:08:26,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2022-03-20 19:08:26,799 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 31 [2022-03-20 19:08:26,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 19:08:26,799 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2022-03-20 19:08:26,799 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-20 19:08:26,799 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-03-20 19:08:26,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-20 19:08:26,800 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 19:08:26,800 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 19:08:26,800 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-20 19:08:26,800 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 19:08:26,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 19:08:26,800 INFO L85 PathProgramCache]: Analyzing trace with hash 561539433, now seen corresponding path program 3 times [2022-03-20 19:08:26,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 19:08:26,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [890428240] [2022-03-20 19:08:26,833 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-03-20 19:08:26,833 INFO L85 PathProgramCache]: Analyzing trace with hash -279473558, now seen corresponding path program 1 times [2022-03-20 19:08:26,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 19:08:26,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774137137] [2022-03-20 19:08:26,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 19:08:26,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 19:08:26,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:08:26,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 19:08:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:08:26,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-03-20 19:08:26,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:08:26,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-03-20 19:08:26,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:08:26,872 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-20 19:08:26,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 19:08:26,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774137137] [2022-03-20 19:08:26,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774137137] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 19:08:26,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 19:08:26,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 19:08:27,030 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 19:08:27,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [890428240] [2022-03-20 19:08:27,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [890428240] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 19:08:27,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 19:08:27,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-03-20 19:08:27,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436691638] [2022-03-20 19:08:27,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 19:08:27,031 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-20 19:08:27,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 19:08:27,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-20 19:08:27,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-03-20 19:08:27,031 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 16 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 19:08:27,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 19:08:27,308 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2022-03-20 19:08:27,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-20 19:08:27,309 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2022-03-20 19:08:27,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 19:08:27,309 INFO L225 Difference]: With dead ends: 61 [2022-03-20 19:08:27,309 INFO L226 Difference]: Without dead ends: 38 [2022-03-20 19:08:27,310 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=208, Invalid=662, Unknown=0, NotChecked=0, Total=870 [2022-03-20 19:08:27,310 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 56 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 19:08:27,310 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 53 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 19:08:27,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-03-20 19:08:27,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-03-20 19:08:27,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-20 19:08:27,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2022-03-20 19:08:27,315 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 33 [2022-03-20 19:08:27,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 19:08:27,315 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2022-03-20 19:08:27,315 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 19:08:27,315 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2022-03-20 19:08:27,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-20 19:08:27,316 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 19:08:27,316 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 19:08:27,316 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-20 19:08:27,316 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 19:08:27,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 19:08:27,316 INFO L85 PathProgramCache]: Analyzing trace with hash 783907799, now seen corresponding path program 1 times [2022-03-20 19:08:27,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 19:08:27,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1669787000] [2022-03-20 19:08:27,345 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-03-20 19:08:27,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1990910239, now seen corresponding path program 1 times [2022-03-20 19:08:27,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 19:08:27,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173770036] [2022-03-20 19:08:27,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 19:08:27,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 19:08:27,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:08:27,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 19:08:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:08:27,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-03-20 19:08:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:08:27,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-20 19:08:27,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:08:27,480 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 19:08:27,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 19:08:27,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173770036] [2022-03-20 19:08:27,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173770036] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 19:08:27,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888336872] [2022-03-20 19:08:27,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 19:08:27,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 19:08:27,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 19:08:27,482 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 19:08:27,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-20 19:08:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:08:27,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-20 19:08:27,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 19:08:27,778 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 19:08:27,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 19:08:28,139 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 19:08:28,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888336872] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-20 19:08:28,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-20 19:08:28,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12, 11] total 27 [2022-03-20 19:08:28,277 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 19:08:28,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1669787000] [2022-03-20 19:08:28,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1669787000] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 19:08:28,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 19:08:28,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-20 19:08:28,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40210715] [2022-03-20 19:08:28,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 19:08:28,278 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-20 19:08:28,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 19:08:28,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-20 19:08:28,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=894, Unknown=0, NotChecked=0, Total=1056 [2022-03-20 19:08:28,279 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand has 17 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-20 19:08:28,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 19:08:28,428 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2022-03-20 19:08:28,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 19:08:28,428 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2022-03-20 19:08:28,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 19:08:28,429 INFO L225 Difference]: With dead ends: 38 [2022-03-20 19:08:28,429 INFO L226 Difference]: Without dead ends: 0 [2022-03-20 19:08:28,429 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 61 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=230, Invalid=1252, Unknown=0, NotChecked=0, Total=1482 [2022-03-20 19:08:28,430 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 19:08:28,430 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 198 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 128 Invalid, 0 Unknown, 2 Unchecked, 0.1s Time] [2022-03-20 19:08:28,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-20 19:08:28,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-20 19:08:28,431 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-20 19:08:28,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-20 19:08:28,431 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2022-03-20 19:08:28,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 19:08:28,431 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-20 19:08:28,431 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-20 19:08:28,431 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-20 19:08:28,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-20 19:08:28,433 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-20 19:08:28,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-20 19:08:28,643 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 19:08:28,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-03-20 19:08:29,313 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-03-20 19:08:29,313 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-03-20 19:08:29,313 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-03-20 19:08:29,313 INFO L878 garLoopResultBuilder]: At program point L27-1(lines 19 29) the Hoare annotation is: (let ((.cse0 (= |correct_version_#in~w| correct_version_~w))) (or (and (= ~false~0 correct_version_~is_divisible~0) .cse0) (and (< correct_version_~i~0 (+ 2 correct_version_~w)) (<= 4 correct_version_~w) .cse0 (<= 0 (div (+ (* (- 1) |correct_version_#in~w|) 4) 4294967296))))) [2022-03-20 19:08:29,313 INFO L885 garLoopResultBuilder]: At program point correct_versionENTRY(lines 15 32) the Hoare annotation is: true [2022-03-20 19:08:29,313 INFO L878 garLoopResultBuilder]: At program point L24-2(lines 24 25) the Hoare annotation is: (and (< correct_version_~i~0 correct_version_~w) (<= 4 correct_version_~w) (= |correct_version_#in~w| correct_version_~w)) [2022-03-20 19:08:29,314 INFO L878 garLoopResultBuilder]: At program point L24-3(lines 24 25) the Hoare annotation is: (and (< correct_version_~i~0 (+ 2 correct_version_~w)) (<= 4 correct_version_~w) (= |correct_version_#in~w| correct_version_~w)) [2022-03-20 19:08:29,314 INFO L878 garLoopResultBuilder]: At program point L24-4(lines 22 29) the Hoare annotation is: (and (< correct_version_~i~0 (+ 2 correct_version_~w)) (<= 4 correct_version_~w) (= |correct_version_#in~w| correct_version_~w) (<= 0 (div (+ (* (- 1) |correct_version_#in~w|) 4) 4294967296))) [2022-03-20 19:08:29,314 INFO L878 garLoopResultBuilder]: At program point L19(lines 19 29) the Hoare annotation is: (= |correct_version_#in~w| correct_version_~w) [2022-03-20 19:08:29,314 INFO L878 garLoopResultBuilder]: At program point correct_versionFINAL(lines 15 32) the Hoare annotation is: (let ((.cse0 (= |correct_version_#in~w| correct_version_~w))) (or (and (= ~false~0 correct_version_~is_divisible~0) (= |correct_version_#res| ~false~0) .cse0) (and (< correct_version_~i~0 (+ 2 correct_version_~w)) (<= 4 correct_version_~w) .cse0 (<= 0 (div (+ (* (- 1) |correct_version_#in~w|) 4) 4294967296))))) [2022-03-20 19:08:29,314 INFO L878 garLoopResultBuilder]: At program point correct_versionEXIT(lines 15 32) the Hoare annotation is: (let ((.cse0 (= |correct_version_#in~w| correct_version_~w))) (or (and (= ~false~0 correct_version_~is_divisible~0) (= |correct_version_#res| ~false~0) .cse0) (and (< correct_version_~i~0 (+ 2 correct_version_~w)) (<= 4 correct_version_~w) .cse0 (<= 0 (div (+ (* (- 1) |correct_version_#in~w|) 4) 4294967296))))) [2022-03-20 19:08:29,314 INFO L878 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (or (and (= main_~is_divisible1~0 main_~is_divisible2~0) (= ~false~0 main_~is_divisible1~0)) (and (= student_version_~is_divisible~1 main_~is_divisible2~0) (<= student_version_~is_divisible~1 2147483647) (<= 4 student_version_~w) (<= 0 (+ student_version_~is_divisible~1 2147483648)) (= student_version_~i~1 student_version_~w))) [2022-03-20 19:08:29,314 INFO L878 garLoopResultBuilder]: At program point L62(line 62) the Hoare annotation is: (or (and (<= (mod main_~w~0 4294967296) 4) (<= (+ (* (div main_~w~0 4294967296) 4294967296) 4) main_~w~0)) (= ~false~0 main_~is_divisible1~0)) [2022-03-20 19:08:29,314 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 53 67) the Hoare annotation is: true [2022-03-20 19:08:29,314 INFO L878 garLoopResultBuilder]: At program point L61(line 61) the Hoare annotation is: (= main_~is_divisible1~0 main_~is_divisible2~0) [2022-03-20 19:08:29,314 INFO L878 garLoopResultBuilder]: At program point L62-1(line 62) the Hoare annotation is: (or (and (<= 4 student_version_~w) (= student_version_~i~1 student_version_~w) (= student_version_~is_divisible~1 |main_#t~ret6|)) (and (= |main_#t~ret6| main_~is_divisible1~0) (= ~false~0 main_~is_divisible1~0))) [2022-03-20 19:08:29,314 INFO L878 garLoopResultBuilder]: At program point L61-1(line 61) the Hoare annotation is: (let ((.cse0 (= main_~is_divisible1~0 main_~is_divisible2~0))) (or (and .cse0 (= ~false~0 |main_#t~ret5|)) (and (<= (mod main_~w~0 4294967296) 4) .cse0 (<= (+ (* (div main_~w~0 4294967296) 4294967296) 4) main_~w~0)))) [2022-03-20 19:08:29,314 INFO L878 garLoopResultBuilder]: At program point L59(lines 59 64) the Hoare annotation is: (= main_~is_divisible1~0 main_~is_divisible2~0) [2022-03-20 19:08:29,314 INFO L885 garLoopResultBuilder]: At program point L59-1(lines 59 64) the Hoare annotation is: true [2022-03-20 19:08:29,314 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 53 67) the Hoare annotation is: true [2022-03-20 19:08:29,314 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 53 67) the Hoare annotation is: true [2022-03-20 19:08:29,315 INFO L878 garLoopResultBuilder]: At program point student_versionFINAL(lines 34 51) the Hoare annotation is: (let ((.cse1 (= ~false~0 |student_version_#res|)) (.cse0 (= |student_version_#in~w| student_version_~w)) (.cse2 (= ~false~0 student_version_~is_divisible~1))) (or (and (<= 4 student_version_~w) .cse0 (= student_version_~i~1 student_version_~w) (= student_version_~is_divisible~1 |student_version_#res|)) (and .cse1 (not (< student_version_~i~1 student_version_~w)) (< student_version_~i~1 (+ 2 student_version_~w)) .cse0 (<= 5 |student_version_#in~w|) .cse2) (and .cse1 (<= |student_version_#in~w| 3) .cse0 .cse2))) [2022-03-20 19:08:29,315 INFO L878 garLoopResultBuilder]: At program point L46-1(lines 38 48) the Hoare annotation is: (let ((.cse1 (= |student_version_#in~w| student_version_~w))) (let ((.cse0 (and (<= 4 student_version_~w) .cse1 (= student_version_~i~1 student_version_~w)))) (and (or (<= |student_version_#in~w| 3) (and (not (< student_version_~i~1 student_version_~w)) (< student_version_~i~1 (+ 2 student_version_~w)) (<= 5 |student_version_#in~w|)) .cse0) (or .cse0 (and .cse1 (= ~false~0 student_version_~is_divisible~1)))))) [2022-03-20 19:08:29,315 INFO L878 garLoopResultBuilder]: At program point L43-2(lines 43 44) the Hoare annotation is: (let ((.cse0 (<= 4 student_version_~w)) (.cse2 (= |student_version_#in~w| student_version_~w))) (or (let ((.cse1 (+ student_version_~i~1 4))) (and .cse0 (<= student_version_~w .cse1) (<= .cse1 student_version_~w) .cse2)) (let ((.cse3 (+ 2 student_version_~i~1))) (and .cse0 .cse2 (<= .cse3 student_version_~w) (<= student_version_~w .cse3))) (and .cse2 (<= 5 |student_version_#in~w|) (< student_version_~i~1 student_version_~w)))) [2022-03-20 19:08:29,315 INFO L878 garLoopResultBuilder]: At program point L43-3(lines 43 44) the Hoare annotation is: (and (<= 4 student_version_~w) (< student_version_~i~1 (+ 2 student_version_~w)) (= |student_version_#in~w| student_version_~w) (or (let ((.cse0 (+ student_version_~i~1 4))) (and (<= student_version_~w .cse0) (<= .cse0 student_version_~w))) (and (not (< student_version_~i~1 student_version_~w)) (<= student_version_~i~1 student_version_~w)) (<= 5 |student_version_#in~w|) (let ((.cse1 (+ 2 student_version_~i~1))) (and (<= .cse1 student_version_~w) (<= student_version_~w .cse1))))) [2022-03-20 19:08:29,315 INFO L885 garLoopResultBuilder]: At program point student_versionENTRY(lines 34 51) the Hoare annotation is: true [2022-03-20 19:08:29,315 INFO L878 garLoopResultBuilder]: At program point L43-4(lines 41 48) the Hoare annotation is: (let ((.cse0 (= |student_version_#in~w| student_version_~w))) (or (and (<= 4 student_version_~w) .cse0 (= student_version_~i~1 student_version_~w)) (and (not (< student_version_~i~1 student_version_~w)) (< student_version_~i~1 (+ 2 student_version_~w)) .cse0 (<= 5 |student_version_#in~w|)))) [2022-03-20 19:08:29,315 INFO L878 garLoopResultBuilder]: At program point L38(lines 38 48) the Hoare annotation is: (= |student_version_#in~w| student_version_~w) [2022-03-20 19:08:29,315 INFO L878 garLoopResultBuilder]: At program point student_versionEXIT(lines 34 51) the Hoare annotation is: (let ((.cse1 (= ~false~0 |student_version_#res|)) (.cse0 (= |student_version_#in~w| student_version_~w)) (.cse2 (= ~false~0 student_version_~is_divisible~1))) (or (and (<= 4 student_version_~w) .cse0 (= student_version_~i~1 student_version_~w) (= student_version_~is_divisible~1 |student_version_#res|)) (and .cse1 (not (< student_version_~i~1 student_version_~w)) (< student_version_~i~1 (+ 2 student_version_~w)) .cse0 (<= 5 |student_version_#in~w|) .cse2) (and .cse1 (<= |student_version_#in~w| 3) .cse0 .cse2))) [2022-03-20 19:08:29,315 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-03-20 19:08:29,315 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~false~0 |old(~false~0)|) (= |old(~true~0)| ~true~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-03-20 19:08:29,315 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-03-20 19:08:29,315 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-03-20 19:08:29,315 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-03-20 19:08:29,315 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-03-20 19:08:29,315 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-03-20 19:08:29,316 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-03-20 19:08:29,316 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 5 10) the Hoare annotation is: (let ((.cse0 (not (= __VERIFIER_assert_~cond 0)))) (and (or (not (= student_version_~i~1 student_version_~w)) (not (<= student_version_~is_divisible~1 2147483647)) (not (<= 4 student_version_~w)) (not (<= 0 (+ student_version_~is_divisible~1 2147483648))) .cse0) (or (= |__VERIFIER_assert_#in~cond| 0) .cse0))) [2022-03-20 19:08:29,316 INFO L878 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (and (or (not (<= student_version_~is_divisible~1 2147483647)) (not (<= 4 student_version_~w)) (= __VERIFIER_assert_~cond 0) (not (<= 0 (+ student_version_~is_divisible~1 2147483648))) (not (<= student_version_~i~1 student_version_~w)) (< student_version_~i~1 student_version_~w)) (= |__VERIFIER_assert_#in~cond| 0)) [2022-03-20 19:08:29,316 INFO L878 garLoopResultBuilder]: At program point L6(lines 6 8) the Hoare annotation is: (let ((.cse0 (= |__VERIFIER_assert_#in~cond| 0))) (and (or (not (= student_version_~i~1 student_version_~w)) (and (not .cse0) (not (= |__VERIFIER_assert_#in~cond| 1))) (not (<= student_version_~is_divisible~1 2147483647)) (not (<= 4 student_version_~w)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 0 (+ student_version_~is_divisible~1 2147483648)))) (or .cse0 (not (= __VERIFIER_assert_~cond 0))))) [2022-03-20 19:08:29,316 INFO L878 garLoopResultBuilder]: At program point L6-2(lines 5 10) the Hoare annotation is: (let ((.cse0 (not (= __VERIFIER_assert_~cond 0)))) (and (or (not (= student_version_~i~1 student_version_~w)) (not (<= student_version_~is_divisible~1 2147483647)) (not (<= 4 student_version_~w)) (not (<= 0 (+ student_version_~is_divisible~1 2147483648))) .cse0) (or (= |__VERIFIER_assert_#in~cond| 0) .cse0))) [2022-03-20 19:08:29,316 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) the Hoare annotation is: (and (or (not (= student_version_~i~1 student_version_~w)) (not (<= student_version_~is_divisible~1 2147483647)) (not (<= 4 student_version_~w)) (not (<= 0 (+ student_version_~is_divisible~1 2147483648)))) (= |__VERIFIER_assert_#in~cond| 0)) [2022-03-20 19:08:29,318 INFO L719 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 19:08:29,319 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-20 19:08:29,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 07:08:29 BoogieIcfgContainer [2022-03-20 19:08:29,329 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-20 19:08:29,329 INFO L158 Benchmark]: Toolchain (without parser) took 5671.70ms. Allocated memory was 184.5MB in the beginning and 245.4MB in the end (delta: 60.8MB). Free memory was 134.2MB in the beginning and 178.8MB in the end (delta: -44.6MB). Peak memory consumption was 113.9MB. Max. memory is 8.0GB. [2022-03-20 19:08:29,329 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 184.5MB. Free memory was 150.2MB in the beginning and 150.1MB in the end (delta: 140.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-20 19:08:29,329 INFO L158 Benchmark]: CACSL2BoogieTranslator took 175.63ms. Allocated memory is still 184.5MB. Free memory was 134.0MB in the beginning and 160.6MB in the end (delta: -26.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-03-20 19:08:29,330 INFO L158 Benchmark]: Boogie Preprocessor took 30.67ms. Allocated memory is still 184.5MB. Free memory was 160.6MB in the beginning and 159.2MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-20 19:08:29,330 INFO L158 Benchmark]: RCFGBuilder took 235.38ms. Allocated memory is still 184.5MB. Free memory was 159.2MB in the beginning and 148.1MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-03-20 19:08:29,330 INFO L158 Benchmark]: TraceAbstraction took 5226.49ms. Allocated memory was 184.5MB in the beginning and 245.4MB in the end (delta: 60.8MB). Free memory was 147.5MB in the beginning and 178.8MB in the end (delta: -31.3MB). Peak memory consumption was 127.6MB. Max. memory is 8.0GB. [2022-03-20 19:08:29,331 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.12ms. Allocated memory is still 184.5MB. Free memory was 150.2MB in the beginning and 150.1MB in the end (delta: 140.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 175.63ms. Allocated memory is still 184.5MB. Free memory was 134.0MB in the beginning and 160.6MB in the end (delta: -26.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.67ms. Allocated memory is still 184.5MB. Free memory was 160.6MB in the beginning and 159.2MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 235.38ms. Allocated memory is still 184.5MB. Free memory was 159.2MB in the beginning and 148.1MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 5226.49ms. Allocated memory was 184.5MB in the beginning and 245.4MB in the end (delta: 60.8MB). Free memory was 147.5MB in the beginning and 178.8MB in the end (delta: -31.3MB). Peak memory consumption was 127.6MB. 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 7 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 394 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 375 mSDsluCounter, 576 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 86 IncrementalHoareTripleChecker+Unchecked, 387 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1539 IncrementalHoareTripleChecker+Invalid, 1728 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 189 mSDtfsCounter, 1539 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 130 SyntacticMatches, 9 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 953 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=6, InterpolantAutomatonStates: 84, 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, 8 MinimizatonAttempts, 22 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 133 PreInvPairs, 264 NumberOfFragments, 681 HoareAnnotationTreeSize, 133 FomulaSimplifications, 342 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 39 FomulaSimplificationsInter, 1957 FormulaSimplificationTreeSizeReductionInter, 0.6s 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: 43]: Loop Invariant Derived loop invariant: ((4 <= w && i < 2 + w) && \old(w) == w) && ((((w <= i + 4 && i + 4 <= w) || (!(i < w) && i <= w)) || 5 <= \old(w)) || (2 + i <= w && w <= 2 + i)) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: (i < 2 + w && 4 <= w) && \old(w) == w - ProcedureContractResult [Line: 15]: Procedure Contract for correct_version Derived contract for procedure correct_version: ((false == is_divisible && \result == false) && \old(w) == w) || (((i < 2 + w && 4 <= w) && \old(w) == w) && 0 <= (-1 * \old(w) + 4) / 4294967296) - ProcedureContractResult [Line: 34]: Procedure Contract for student_version Derived contract for procedure student_version: ((((4 <= w && \old(w) == w) && i == w) && is_divisible == \result) || (((((false == \result && !(i < w)) && i < 2 + w) && \old(w) == w) && 5 <= \old(w)) && false == is_divisible)) || (((false == \result && \old(w) <= 3) && \old(w) == w) && false == is_divisible) - ProcedureContractResult [Line: 53]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 5]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: ((((!(i == w) || !(is_divisible <= 2147483647)) || !(4 <= w)) || !(0 <= is_divisible + 2147483648)) || !(cond == 0)) && (\old(cond) == 0 || !(cond == 0)) RESULT: Ultimate proved your program to be correct! [2022-03-20 19:08:29,362 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...