/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/locks/test_locks_6.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7968f31 [2022-03-18 05:40:32,792 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-18 05:40:32,793 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-18 05:40:32,835 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-18 05:40:32,835 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-18 05:40:32,836 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-18 05:40:32,837 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-18 05:40:32,838 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-18 05:40:32,839 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-18 05:40:32,839 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-18 05:40:32,840 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-18 05:40:32,840 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-18 05:40:32,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-18 05:40:32,841 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-18 05:40:32,842 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-18 05:40:32,843 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-18 05:40:32,845 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-18 05:40:32,848 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-18 05:40:32,853 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-18 05:40:32,857 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-18 05:40:32,859 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-18 05:40:32,860 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-18 05:40:32,861 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-18 05:40:32,864 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-18 05:40:32,864 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-18 05:40:32,868 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-18 05:40:32,868 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-18 05:40:32,868 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-18 05:40:32,869 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-18 05:40:32,869 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-18 05:40:32,869 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-18 05:40:32,870 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-18 05:40:32,870 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-18 05:40:32,870 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-18 05:40:32,871 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-18 05:40:32,871 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-18 05:40:32,872 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-18 05:40:32,872 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-18 05:40:32,872 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-18 05:40:32,872 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-18 05:40:32,873 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-18 05:40:32,875 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-18 05:40:32,877 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-03-18 05:40:32,885 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-18 05:40:32,885 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-18 05:40:32,887 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-18 05:40:32,887 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-18 05:40:32,887 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-18 05:40:32,887 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-18 05:40:32,887 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-18 05:40:32,887 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-18 05:40:32,887 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-18 05:40:32,888 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-18 05:40:32,888 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-18 05:40:32,888 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-18 05:40:32,888 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-18 05:40:32,888 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-18 05:40:32,888 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-18 05:40:32,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-18 05:40:32,888 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-18 05:40:32,888 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-18 05:40:32,888 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-03-18 05:40:32,888 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-03-18 05:40:32,889 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-18 05:40:32,889 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-03-18 05:40:32,889 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-03-18 05:40:33,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-18 05:40:33,105 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-18 05:40:33,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-18 05:40:33,108 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-18 05:40:33,108 INFO L275 PluginConnector]: CDTParser initialized [2022-03-18 05:40:33,110 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_6.c [2022-03-18 05:40:33,153 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/122fdb4f5/cd0273ada7d54bd3a45db39210622a5f/FLAG4401f8ce9 [2022-03-18 05:40:33,519 INFO L306 CDTParser]: Found 1 translation units. [2022-03-18 05:40:33,519 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2022-03-18 05:40:33,531 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/122fdb4f5/cd0273ada7d54bd3a45db39210622a5f/FLAG4401f8ce9 [2022-03-18 05:40:33,559 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/122fdb4f5/cd0273ada7d54bd3a45db39210622a5f [2022-03-18 05:40:33,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-18 05:40:33,562 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-18 05:40:33,564 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-18 05:40:33,565 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-18 05:40:33,567 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-18 05:40:33,568 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.03 05:40:33" (1/1) ... [2022-03-18 05:40:33,569 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dd8a5de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:40:33, skipping insertion in model container [2022-03-18 05:40:33,569 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.03 05:40:33" (1/1) ... [2022-03-18 05:40:33,573 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-18 05:40:33,591 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-18 05:40:33,734 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c[2544,2557] [2022-03-18 05:40:33,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-18 05:40:33,743 INFO L203 MainTranslator]: Completed pre-run [2022-03-18 05:40:33,768 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c[2544,2557] [2022-03-18 05:40:33,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-18 05:40:33,781 INFO L208 MainTranslator]: Completed translation [2022-03-18 05:40:33,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:40:33 WrapperNode [2022-03-18 05:40:33,782 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-18 05:40:33,783 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-18 05:40:33,783 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-18 05:40:33,784 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-18 05:40:33,791 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:40:33" (1/1) ... [2022-03-18 05:40:33,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:40:33" (1/1) ... [2022-03-18 05:40:33,800 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:40:33" (1/1) ... [2022-03-18 05:40:33,800 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:40:33" (1/1) ... [2022-03-18 05:40:33,811 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:40:33" (1/1) ... [2022-03-18 05:40:33,817 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:40:33" (1/1) ... [2022-03-18 05:40:33,821 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:40:33" (1/1) ... [2022-03-18 05:40:33,824 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-18 05:40:33,825 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-18 05:40:33,825 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-18 05:40:33,825 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-18 05:40:33,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:40:33" (1/1) ... [2022-03-18 05:40:33,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-18 05:40:33,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 05:40:33,877 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-18 05:40:33,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-18 05:40:33,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-18 05:40:33,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-18 05:40:33,939 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-18 05:40:33,939 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-18 05:40:33,939 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-18 05:40:33,940 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-18 05:40:33,940 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-18 05:40:33,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-18 05:40:33,940 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-18 05:40:33,940 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-18 05:40:33,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-18 05:40:33,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-18 05:40:33,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-18 05:40:33,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-18 05:40:33,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-18 05:40:33,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-18 05:40:33,991 INFO L234 CfgBuilder]: Building ICFG [2022-03-18 05:40:33,992 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-18 05:40:34,157 INFO L275 CfgBuilder]: Performing block encoding [2022-03-18 05:40:34,161 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-18 05:40:34,161 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-18 05:40:34,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.03 05:40:34 BoogieIcfgContainer [2022-03-18 05:40:34,163 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-18 05:40:34,164 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-18 05:40:34,164 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-18 05:40:34,171 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-18 05:40:34,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.03 05:40:33" (1/3) ... [2022-03-18 05:40:34,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fcd3039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.03 05:40:34, skipping insertion in model container [2022-03-18 05:40:34,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:40:33" (2/3) ... [2022-03-18 05:40:34,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fcd3039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.03 05:40:34, skipping insertion in model container [2022-03-18 05:40:34,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.03 05:40:34" (3/3) ... [2022-03-18 05:40:34,174 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2022-03-18 05:40:34,177 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-18 05:40:34,177 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-18 05:40:34,209 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-18 05:40:34,217 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-03-18 05:40:34,217 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-18 05:40:34,229 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 28 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-18 05:40:34,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-18 05:40:34,240 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:34,240 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 05:40:34,240 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:34,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:34,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1747552289, now seen corresponding path program 1 times [2022-03-18 05:40:34,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:34,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1724185331] [2022-03-18 05:40:34,256 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:34,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1747552289, now seen corresponding path program 2 times [2022-03-18 05:40:34,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:34,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656214539] [2022-03-18 05:40:34,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:34,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:34,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:34,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:34,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 05:40:34,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:34,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656214539] [2022-03-18 05:40:34,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656214539] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:34,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:34,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:34,454 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:34,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1724185331] [2022-03-18 05:40:34,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1724185331] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:34,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:34,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:34,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485441490] [2022-03-18 05:40:34,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:34,459 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:34,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:34,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:34,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:34,481 INFO L87 Difference]: Start difference. First operand has 33 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 28 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:34,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:34,622 INFO L93 Difference]: Finished difference Result 64 states and 103 transitions. [2022-03-18 05:40:34,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:34,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-03-18 05:40:34,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:34,629 INFO L225 Difference]: With dead ends: 64 [2022-03-18 05:40:34,629 INFO L226 Difference]: Without dead ends: 49 [2022-03-18 05:40:34,631 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-18 05:40:34,633 INFO L912 BasicCegarLoop]: 56 mSDtfsCounter, 106 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:34,634 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 65 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-18 05:40:34,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-03-18 05:40:34,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35. [2022-03-18 05:40:34,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:34,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 58 transitions. [2022-03-18 05:40:34,671 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 58 transitions. Word has length 17 [2022-03-18 05:40:34,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:34,672 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 58 transitions. [2022-03-18 05:40:34,672 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:34,673 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 58 transitions. [2022-03-18 05:40:34,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-18 05:40:34,673 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:34,674 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 05:40:34,674 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-18 05:40:34,674 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:34,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:34,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1867356637, now seen corresponding path program 1 times [2022-03-18 05:40:34,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:34,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1779053167] [2022-03-18 05:40:34,675 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:34,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1867356637, now seen corresponding path program 2 times [2022-03-18 05:40:34,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:34,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613590727] [2022-03-18 05:40:34,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:34,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:34,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:34,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:34,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:34,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 05:40:34,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:34,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613590727] [2022-03-18 05:40:34,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613590727] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:34,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:34,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:34,748 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:34,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1779053167] [2022-03-18 05:40:34,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1779053167] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:34,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:34,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:34,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295444851] [2022-03-18 05:40:34,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:34,749 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:34,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:34,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:34,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:34,750 INFO L87 Difference]: Start difference. First operand 35 states and 58 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:34,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:34,810 INFO L93 Difference]: Finished difference Result 78 states and 133 transitions. [2022-03-18 05:40:34,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:34,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-03-18 05:40:34,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:34,811 INFO L225 Difference]: With dead ends: 78 [2022-03-18 05:40:34,811 INFO L226 Difference]: Without dead ends: 49 [2022-03-18 05:40:34,812 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-18 05:40:34,813 INFO L912 BasicCegarLoop]: 56 mSDtfsCounter, 88 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:34,813 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 63 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 05:40:34,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-03-18 05:40:34,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2022-03-18 05:40:34,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:34,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 78 transitions. [2022-03-18 05:40:34,821 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 78 transitions. Word has length 17 [2022-03-18 05:40:34,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:34,821 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 78 transitions. [2022-03-18 05:40:34,821 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:34,822 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 78 transitions. [2022-03-18 05:40:34,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-18 05:40:34,822 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:34,822 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 05:40:34,822 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-18 05:40:34,822 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:34,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:34,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1660239210, now seen corresponding path program 1 times [2022-03-18 05:40:34,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:34,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [542642625] [2022-03-18 05:40:34,825 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:34,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1660239210, now seen corresponding path program 2 times [2022-03-18 05:40:34,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:34,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206725006] [2022-03-18 05:40:34,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:34,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:34,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:34,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:34,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 05:40:34,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:34,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206725006] [2022-03-18 05:40:34,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206725006] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:34,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:34,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:34,858 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:34,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [542642625] [2022-03-18 05:40:34,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [542642625] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:34,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:34,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:34,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052047512] [2022-03-18 05:40:34,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:34,858 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:34,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:34,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:34,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:34,859 INFO L87 Difference]: Start difference. First operand 47 states and 78 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:34,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:34,920 INFO L93 Difference]: Finished difference Result 73 states and 118 transitions. [2022-03-18 05:40:34,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:34,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-03-18 05:40:34,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:34,921 INFO L225 Difference]: With dead ends: 73 [2022-03-18 05:40:34,921 INFO L226 Difference]: Without dead ends: 52 [2022-03-18 05:40:34,921 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-18 05:40:34,922 INFO L912 BasicCegarLoop]: 66 mSDtfsCounter, 79 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:34,923 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 73 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 05:40:34,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-03-18 05:40:34,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2022-03-18 05:40:34,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:34,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 80 transitions. [2022-03-18 05:40:34,930 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 80 transitions. Word has length 18 [2022-03-18 05:40:34,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:34,931 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 80 transitions. [2022-03-18 05:40:34,931 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:34,931 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 80 transitions. [2022-03-18 05:40:34,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-18 05:40:34,931 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:34,931 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 05:40:34,931 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-18 05:40:34,932 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:34,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:34,932 INFO L85 PathProgramCache]: Analyzing trace with hash -2053266220, now seen corresponding path program 1 times [2022-03-18 05:40:34,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:34,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1336529236] [2022-03-18 05:40:34,933 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:34,933 INFO L85 PathProgramCache]: Analyzing trace with hash -2053266220, now seen corresponding path program 2 times [2022-03-18 05:40:34,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:34,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066887529] [2022-03-18 05:40:34,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:34,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:34,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:34,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 05:40:34,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:34,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066887529] [2022-03-18 05:40:34,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066887529] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:34,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:34,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:34,970 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:34,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1336529236] [2022-03-18 05:40:34,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1336529236] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:34,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:34,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:34,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287495807] [2022-03-18 05:40:34,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:34,971 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:34,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:34,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:34,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:34,972 INFO L87 Difference]: Start difference. First operand 50 states and 80 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:35,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:35,039 INFO L93 Difference]: Finished difference Result 130 states and 216 transitions. [2022-03-18 05:40:35,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:35,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-03-18 05:40:35,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:35,043 INFO L225 Difference]: With dead ends: 130 [2022-03-18 05:40:35,044 INFO L226 Difference]: Without dead ends: 89 [2022-03-18 05:40:35,045 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-18 05:40:35,049 INFO L912 BasicCegarLoop]: 48 mSDtfsCounter, 95 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:35,050 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 55 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 05:40:35,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-03-18 05:40:35,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2022-03-18 05:40:35,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 83 states have (on average 1.6626506024096386) internal successors, (138), 83 states have internal predecessors, (138), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:35,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 141 transitions. [2022-03-18 05:40:35,066 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 141 transitions. Word has length 18 [2022-03-18 05:40:35,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:35,066 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 141 transitions. [2022-03-18 05:40:35,066 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:35,066 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 141 transitions. [2022-03-18 05:40:35,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-18 05:40:35,067 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:35,067 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 05:40:35,067 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-18 05:40:35,067 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:35,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:35,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1561642706, now seen corresponding path program 1 times [2022-03-18 05:40:35,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:35,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1771422966] [2022-03-18 05:40:35,068 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:35,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1561642706, now seen corresponding path program 2 times [2022-03-18 05:40:35,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:35,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176964761] [2022-03-18 05:40:35,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:35,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:35,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:35,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 05:40:35,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:35,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176964761] [2022-03-18 05:40:35,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176964761] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:35,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:35,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:35,124 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:35,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1771422966] [2022-03-18 05:40:35,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1771422966] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:35,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:35,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:35,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783968289] [2022-03-18 05:40:35,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:35,125 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:35,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:35,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:35,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:35,125 INFO L87 Difference]: Start difference. First operand 87 states and 141 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:35,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:35,183 INFO L93 Difference]: Finished difference Result 111 states and 179 transitions. [2022-03-18 05:40:35,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:35,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-03-18 05:40:35,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:35,185 INFO L225 Difference]: With dead ends: 111 [2022-03-18 05:40:35,185 INFO L226 Difference]: Without dead ends: 109 [2022-03-18 05:40:35,185 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-18 05:40:35,189 INFO L912 BasicCegarLoop]: 73 mSDtfsCounter, 62 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:35,190 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 80 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 05:40:35,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-03-18 05:40:35,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 87. [2022-03-18 05:40:35,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:35,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 139 transitions. [2022-03-18 05:40:35,209 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 139 transitions. Word has length 18 [2022-03-18 05:40:35,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:35,209 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 139 transitions. [2022-03-18 05:40:35,209 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:35,209 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 139 transitions. [2022-03-18 05:40:35,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-18 05:40:35,210 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:35,210 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 05:40:35,210 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-18 05:40:35,210 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:35,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:35,211 INFO L85 PathProgramCache]: Analyzing trace with hash 773471640, now seen corresponding path program 1 times [2022-03-18 05:40:35,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:35,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1895073806] [2022-03-18 05:40:35,211 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:35,211 INFO L85 PathProgramCache]: Analyzing trace with hash 773471640, now seen corresponding path program 2 times [2022-03-18 05:40:35,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:35,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062765681] [2022-03-18 05:40:35,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:35,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:35,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:35,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:35,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:35,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 05:40:35,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:35,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062765681] [2022-03-18 05:40:35,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062765681] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:35,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:35,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:35,261 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:35,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1895073806] [2022-03-18 05:40:35,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1895073806] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:35,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:35,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:35,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809897494] [2022-03-18 05:40:35,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:35,261 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:35,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:35,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:35,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:35,262 INFO L87 Difference]: Start difference. First operand 87 states and 139 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:35,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:35,318 INFO L93 Difference]: Finished difference Result 155 states and 251 transitions. [2022-03-18 05:40:35,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:35,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-18 05:40:35,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:35,319 INFO L225 Difference]: With dead ends: 155 [2022-03-18 05:40:35,319 INFO L226 Difference]: Without dead ends: 153 [2022-03-18 05:40:35,319 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-18 05:40:35,321 INFO L912 BasicCegarLoop]: 45 mSDtfsCounter, 86 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:35,321 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 52 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 05:40:35,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-03-18 05:40:35,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 119. [2022-03-18 05:40:35,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 115 states have (on average 1.617391304347826) internal successors, (186), 115 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:35,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 189 transitions. [2022-03-18 05:40:35,346 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 189 transitions. Word has length 19 [2022-03-18 05:40:35,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:35,346 INFO L478 AbstractCegarLoop]: Abstraction has 119 states and 189 transitions. [2022-03-18 05:40:35,346 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:35,346 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 189 transitions. [2022-03-18 05:40:35,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-18 05:40:35,350 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:35,350 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 05:40:35,350 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-18 05:40:35,351 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:35,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:35,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1453530010, now seen corresponding path program 1 times [2022-03-18 05:40:35,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:35,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1912758297] [2022-03-18 05:40:35,352 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:35,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1453530010, now seen corresponding path program 2 times [2022-03-18 05:40:35,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:35,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411868710] [2022-03-18 05:40:35,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:35,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:35,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:35,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:35,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 05:40:35,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:35,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411868710] [2022-03-18 05:40:35,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411868710] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:35,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:35,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:35,419 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:35,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1912758297] [2022-03-18 05:40:35,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1912758297] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:35,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:35,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:35,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229975584] [2022-03-18 05:40:35,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:35,420 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:35,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:35,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:35,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:35,421 INFO L87 Difference]: Start difference. First operand 119 states and 189 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:35,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:35,473 INFO L93 Difference]: Finished difference Result 271 states and 435 transitions. [2022-03-18 05:40:35,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:35,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-18 05:40:35,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:35,475 INFO L225 Difference]: With dead ends: 271 [2022-03-18 05:40:35,475 INFO L226 Difference]: Without dead ends: 161 [2022-03-18 05:40:35,476 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-18 05:40:35,477 INFO L912 BasicCegarLoop]: 60 mSDtfsCounter, 76 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:35,477 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 67 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 05:40:35,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-03-18 05:40:35,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2022-03-18 05:40:35,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 155 states have (on average 1.5741935483870968) internal successors, (244), 155 states have internal predecessors, (244), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:35,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 247 transitions. [2022-03-18 05:40:35,492 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 247 transitions. Word has length 19 [2022-03-18 05:40:35,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:35,492 INFO L478 AbstractCegarLoop]: Abstraction has 159 states and 247 transitions. [2022-03-18 05:40:35,492 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:35,492 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 247 transitions. [2022-03-18 05:40:35,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-18 05:40:35,493 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:35,494 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 05:40:35,494 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-18 05:40:35,494 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:35,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:35,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1791967575, now seen corresponding path program 1 times [2022-03-18 05:40:35,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:35,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [603883394] [2022-03-18 05:40:35,496 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:35,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1791967575, now seen corresponding path program 2 times [2022-03-18 05:40:35,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:35,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742548212] [2022-03-18 05:40:35,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:35,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:35,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:35,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:35,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:35,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 05:40:35,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:35,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742548212] [2022-03-18 05:40:35,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742548212] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:35,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:35,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:35,541 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:35,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [603883394] [2022-03-18 05:40:35,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [603883394] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:35,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:35,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:35,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191961171] [2022-03-18 05:40:35,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:35,542 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:35,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:35,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:35,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:35,543 INFO L87 Difference]: Start difference. First operand 159 states and 247 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:35,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:35,589 INFO L93 Difference]: Finished difference Result 241 states and 373 transitions. [2022-03-18 05:40:35,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:35,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-03-18 05:40:35,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:35,591 INFO L225 Difference]: With dead ends: 241 [2022-03-18 05:40:35,591 INFO L226 Difference]: Without dead ends: 167 [2022-03-18 05:40:35,593 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-18 05:40:35,593 INFO L912 BasicCegarLoop]: 60 mSDtfsCounter, 77 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:35,594 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 67 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 05:40:35,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-03-18 05:40:35,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2022-03-18 05:40:35,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:35,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 251 transitions. [2022-03-18 05:40:35,604 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 251 transitions. Word has length 20 [2022-03-18 05:40:35,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:35,605 INFO L478 AbstractCegarLoop]: Abstraction has 165 states and 251 transitions. [2022-03-18 05:40:35,605 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:35,605 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 251 transitions. [2022-03-18 05:40:35,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-18 05:40:35,605 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:35,605 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 05:40:35,605 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-18 05:40:35,605 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:35,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:35,606 INFO L85 PathProgramCache]: Analyzing trace with hash 2109972711, now seen corresponding path program 1 times [2022-03-18 05:40:35,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:35,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [543302081] [2022-03-18 05:40:35,606 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:35,606 INFO L85 PathProgramCache]: Analyzing trace with hash 2109972711, now seen corresponding path program 2 times [2022-03-18 05:40:35,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:35,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540672523] [2022-03-18 05:40:35,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:35,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:35,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:35,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:35,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:35,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 05:40:35,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:35,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540672523] [2022-03-18 05:40:35,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540672523] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:35,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:35,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:35,638 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:35,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [543302081] [2022-03-18 05:40:35,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [543302081] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:35,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:35,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:35,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897200662] [2022-03-18 05:40:35,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:35,638 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:35,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:35,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:35,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:35,639 INFO L87 Difference]: Start difference. First operand 165 states and 251 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:35,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:35,690 INFO L93 Difference]: Finished difference Result 285 states and 437 transitions. [2022-03-18 05:40:35,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:35,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-03-18 05:40:35,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:35,692 INFO L225 Difference]: With dead ends: 285 [2022-03-18 05:40:35,692 INFO L226 Difference]: Without dead ends: 283 [2022-03-18 05:40:35,692 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-18 05:40:35,693 INFO L912 BasicCegarLoop]: 44 mSDtfsCounter, 79 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:35,694 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 51 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 05:40:35,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-03-18 05:40:35,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 233. [2022-03-18 05:40:35,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 229 states have (on average 1.502183406113537) internal successors, (344), 229 states have internal predecessors, (344), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:35,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 347 transitions. [2022-03-18 05:40:35,714 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 347 transitions. Word has length 20 [2022-03-18 05:40:35,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:35,714 INFO L478 AbstractCegarLoop]: Abstraction has 233 states and 347 transitions. [2022-03-18 05:40:35,714 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:35,714 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 347 transitions. [2022-03-18 05:40:35,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-18 05:40:35,715 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:35,715 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 05:40:35,715 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-18 05:40:35,715 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:35,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:35,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1504936215, now seen corresponding path program 1 times [2022-03-18 05:40:35,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:35,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2123067493] [2022-03-18 05:40:35,716 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:35,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1504936215, now seen corresponding path program 2 times [2022-03-18 05:40:35,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:35,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879561093] [2022-03-18 05:40:35,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:35,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:35,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:35,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:35,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:35,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 05:40:35,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:35,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879561093] [2022-03-18 05:40:35,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879561093] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:35,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:35,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:35,760 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:35,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2123067493] [2022-03-18 05:40:35,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2123067493] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:35,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:35,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:35,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504526663] [2022-03-18 05:40:35,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:35,760 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:35,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:35,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:35,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:35,761 INFO L87 Difference]: Start difference. First operand 233 states and 347 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:35,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:35,849 INFO L93 Difference]: Finished difference Result 525 states and 781 transitions. [2022-03-18 05:40:35,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:35,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-03-18 05:40:35,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:35,850 INFO L225 Difference]: With dead ends: 525 [2022-03-18 05:40:35,850 INFO L226 Difference]: Without dead ends: 307 [2022-03-18 05:40:35,851 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-18 05:40:35,851 INFO L912 BasicCegarLoop]: 62 mSDtfsCounter, 70 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:35,851 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 69 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-18 05:40:35,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-03-18 05:40:35,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2022-03-18 05:40:35,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 301 states have (on average 1.4485049833887043) internal successors, (436), 301 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:35,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 439 transitions. [2022-03-18 05:40:35,869 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 439 transitions. Word has length 20 [2022-03-18 05:40:35,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:35,869 INFO L478 AbstractCegarLoop]: Abstraction has 305 states and 439 transitions. [2022-03-18 05:40:35,869 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:35,869 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 439 transitions. [2022-03-18 05:40:35,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-18 05:40:35,870 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:35,870 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 05:40:35,870 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-18 05:40:35,870 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:35,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:35,870 INFO L85 PathProgramCache]: Analyzing trace with hash 984860303, now seen corresponding path program 1 times [2022-03-18 05:40:35,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:35,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [772974798] [2022-03-18 05:40:35,871 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:35,871 INFO L85 PathProgramCache]: Analyzing trace with hash 984860303, now seen corresponding path program 2 times [2022-03-18 05:40:35,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:35,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716498520] [2022-03-18 05:40:35,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:35,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:35,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:35,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:35,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 05:40:35,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:35,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716498520] [2022-03-18 05:40:35,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716498520] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:35,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:35,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:35,894 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:35,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [772974798] [2022-03-18 05:40:35,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [772974798] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:35,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:35,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:35,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985769087] [2022-03-18 05:40:35,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:35,894 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:35,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:35,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:35,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:35,895 INFO L87 Difference]: Start difference. First operand 305 states and 439 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:35,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:35,976 INFO L93 Difference]: Finished difference Result 457 states and 653 transitions. [2022-03-18 05:40:35,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:35,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-03-18 05:40:35,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:35,977 INFO L225 Difference]: With dead ends: 457 [2022-03-18 05:40:35,977 INFO L226 Difference]: Without dead ends: 315 [2022-03-18 05:40:35,978 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-18 05:40:35,978 INFO L912 BasicCegarLoop]: 57 mSDtfsCounter, 76 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:35,979 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 64 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 05:40:35,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-03-18 05:40:35,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 313. [2022-03-18 05:40:35,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 309 states have (on average 1.4110032362459546) internal successors, (436), 309 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:36,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 439 transitions. [2022-03-18 05:40:36,000 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 439 transitions. Word has length 21 [2022-03-18 05:40:36,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:36,001 INFO L478 AbstractCegarLoop]: Abstraction has 313 states and 439 transitions. [2022-03-18 05:40:36,001 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:36,001 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 439 transitions. [2022-03-18 05:40:36,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-18 05:40:36,001 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:36,002 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 05:40:36,002 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-18 05:40:36,002 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:36,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:36,002 INFO L85 PathProgramCache]: Analyzing trace with hash 591833293, now seen corresponding path program 1 times [2022-03-18 05:40:36,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:36,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1085638789] [2022-03-18 05:40:36,003 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:36,003 INFO L85 PathProgramCache]: Analyzing trace with hash 591833293, now seen corresponding path program 2 times [2022-03-18 05:40:36,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:36,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757769836] [2022-03-18 05:40:36,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:36,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:36,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:36,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:36,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 05:40:36,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:36,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757769836] [2022-03-18 05:40:36,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757769836] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:36,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:36,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:36,023 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:36,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1085638789] [2022-03-18 05:40:36,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1085638789] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:36,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:36,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:36,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988965809] [2022-03-18 05:40:36,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:36,024 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:36,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:36,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:36,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:36,024 INFO L87 Difference]: Start difference. First operand 313 states and 439 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:36,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:36,094 INFO L93 Difference]: Finished difference Result 525 states and 737 transitions. [2022-03-18 05:40:36,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:36,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-03-18 05:40:36,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:36,096 INFO L225 Difference]: With dead ends: 525 [2022-03-18 05:40:36,096 INFO L226 Difference]: Without dead ends: 523 [2022-03-18 05:40:36,097 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-18 05:40:36,098 INFO L912 BasicCegarLoop]: 43 mSDtfsCounter, 72 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:36,098 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 50 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 05:40:36,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-03-18 05:40:36,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 457. [2022-03-18 05:40:36,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 453 states have (on average 1.3686534216335542) internal successors, (620), 453 states have internal predecessors, (620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:36,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 623 transitions. [2022-03-18 05:40:36,123 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 623 transitions. Word has length 21 [2022-03-18 05:40:36,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:36,124 INFO L478 AbstractCegarLoop]: Abstraction has 457 states and 623 transitions. [2022-03-18 05:40:36,124 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:36,125 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 623 transitions. [2022-03-18 05:40:36,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-18 05:40:36,125 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:36,125 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 05:40:36,125 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-18 05:40:36,125 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:36,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:36,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1271891663, now seen corresponding path program 1 times [2022-03-18 05:40:36,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:36,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [142814805] [2022-03-18 05:40:36,126 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:36,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1271891663, now seen corresponding path program 2 times [2022-03-18 05:40:36,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:36,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3475510] [2022-03-18 05:40:36,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:36,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:36,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:36,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:36,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:36,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 05:40:36,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:36,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3475510] [2022-03-18 05:40:36,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3475510] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:36,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:36,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:36,157 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:36,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [142814805] [2022-03-18 05:40:36,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [142814805] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:36,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:36,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:36,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393931074] [2022-03-18 05:40:36,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:36,158 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:36,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:36,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:36,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:36,158 INFO L87 Difference]: Start difference. First operand 457 states and 623 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:36,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:36,224 INFO L93 Difference]: Finished difference Result 1021 states and 1377 transitions. [2022-03-18 05:40:36,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:36,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-03-18 05:40:36,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:36,227 INFO L225 Difference]: With dead ends: 1021 [2022-03-18 05:40:36,228 INFO L226 Difference]: Without dead ends: 587 [2022-03-18 05:40:36,228 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-18 05:40:36,229 INFO L912 BasicCegarLoop]: 64 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:36,229 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 71 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 05:40:36,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2022-03-18 05:40:36,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 585. [2022-03-18 05:40:36,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 581 states have (on average 1.3012048192771084) internal successors, (756), 581 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:36,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 759 transitions. [2022-03-18 05:40:36,285 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 759 transitions. Word has length 21 [2022-03-18 05:40:36,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:36,286 INFO L478 AbstractCegarLoop]: Abstraction has 585 states and 759 transitions. [2022-03-18 05:40:36,286 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:36,286 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 759 transitions. [2022-03-18 05:40:36,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-18 05:40:36,288 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:36,288 INFO L500 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] [2022-03-18 05:40:36,288 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-18 05:40:36,288 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:36,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:36,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1167178942, now seen corresponding path program 1 times [2022-03-18 05:40:36,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:36,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [861648866] [2022-03-18 05:40:36,289 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:36,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1167178942, now seen corresponding path program 2 times [2022-03-18 05:40:36,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:36,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449123071] [2022-03-18 05:40:36,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:36,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:36,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:36,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:36,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 05:40:36,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:36,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449123071] [2022-03-18 05:40:36,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449123071] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:36,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:36,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:36,310 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:36,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [861648866] [2022-03-18 05:40:36,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [861648866] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:36,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:36,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:36,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265196706] [2022-03-18 05:40:36,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:36,311 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:36,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:36,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:36,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:36,311 INFO L87 Difference]: Start difference. First operand 585 states and 759 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:36,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:36,375 INFO L93 Difference]: Finished difference Result 877 states and 1129 transitions. [2022-03-18 05:40:36,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:36,376 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-03-18 05:40:36,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:36,377 INFO L225 Difference]: With dead ends: 877 [2022-03-18 05:40:36,377 INFO L226 Difference]: Without dead ends: 603 [2022-03-18 05:40:36,378 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-18 05:40:36,378 INFO L912 BasicCegarLoop]: 54 mSDtfsCounter, 75 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:36,378 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 61 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 05:40:36,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-03-18 05:40:36,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 601. [2022-03-18 05:40:36,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 597 states have (on average 1.2663316582914572) internal successors, (756), 597 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:36,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 759 transitions. [2022-03-18 05:40:36,410 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 759 transitions. Word has length 22 [2022-03-18 05:40:36,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:36,410 INFO L478 AbstractCegarLoop]: Abstraction has 601 states and 759 transitions. [2022-03-18 05:40:36,410 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:36,410 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 759 transitions. [2022-03-18 05:40:36,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-18 05:40:36,411 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:36,411 INFO L500 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] [2022-03-18 05:40:36,411 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-18 05:40:36,411 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:36,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:36,411 INFO L85 PathProgramCache]: Analyzing trace with hash 774151932, now seen corresponding path program 1 times [2022-03-18 05:40:36,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:36,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1941392930] [2022-03-18 05:40:36,412 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:36,412 INFO L85 PathProgramCache]: Analyzing trace with hash 774151932, now seen corresponding path program 2 times [2022-03-18 05:40:36,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:36,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050806671] [2022-03-18 05:40:36,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:36,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:36,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:36,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:36,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:36,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 05:40:36,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:36,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050806671] [2022-03-18 05:40:36,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050806671] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:36,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:36,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:36,429 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:36,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1941392930] [2022-03-18 05:40:36,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1941392930] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:36,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:36,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:36,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360077808] [2022-03-18 05:40:36,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:36,429 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:36,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:36,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:36,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:36,430 INFO L87 Difference]: Start difference. First operand 601 states and 759 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:36,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:36,507 INFO L93 Difference]: Finished difference Result 971 states and 1208 transitions. [2022-03-18 05:40:36,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:36,507 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-03-18 05:40:36,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:36,510 INFO L225 Difference]: With dead ends: 971 [2022-03-18 05:40:36,510 INFO L226 Difference]: Without dead ends: 969 [2022-03-18 05:40:36,510 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-18 05:40:36,511 INFO L912 BasicCegarLoop]: 41 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:36,511 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 48 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 05:40:36,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2022-03-18 05:40:36,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 905. [2022-03-18 05:40:36,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 901 states have (on average 1.2297447280799112) internal successors, (1108), 901 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:36,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1111 transitions. [2022-03-18 05:40:36,577 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1111 transitions. Word has length 22 [2022-03-18 05:40:36,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:36,577 INFO L478 AbstractCegarLoop]: Abstraction has 905 states and 1111 transitions. [2022-03-18 05:40:36,577 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:36,577 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1111 transitions. [2022-03-18 05:40:36,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-18 05:40:36,578 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:36,578 INFO L500 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] [2022-03-18 05:40:36,579 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-18 05:40:36,579 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:36,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:36,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1454210302, now seen corresponding path program 1 times [2022-03-18 05:40:36,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:36,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [501717964] [2022-03-18 05:40:36,579 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:36,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1454210302, now seen corresponding path program 2 times [2022-03-18 05:40:36,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:36,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898806484] [2022-03-18 05:40:36,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:36,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:36,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:36,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:36,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 05:40:36,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:36,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898806484] [2022-03-18 05:40:36,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898806484] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:36,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:36,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:36,602 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:36,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [501717964] [2022-03-18 05:40:36,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [501717964] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:36,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:36,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:36,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304438113] [2022-03-18 05:40:36,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:36,602 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:36,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:36,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:36,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:36,603 INFO L87 Difference]: Start difference. First operand 905 states and 1111 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:36,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:36,696 INFO L93 Difference]: Finished difference Result 1993 states and 2391 transitions. [2022-03-18 05:40:36,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:36,697 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-03-18 05:40:36,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:36,697 INFO L225 Difference]: With dead ends: 1993 [2022-03-18 05:40:36,697 INFO L226 Difference]: Without dead ends: 0 [2022-03-18 05:40:36,699 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-18 05:40:36,700 INFO L912 BasicCegarLoop]: 65 mSDtfsCounter, 55 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:36,700 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 72 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 05:40:36,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-18 05:40:36,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-18 05:40:36,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-18 05:40:36,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-18 05:40:36,701 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-03-18 05:40:36,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:36,701 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-18 05:40:36,701 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:36,701 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-18 05:40:36,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-18 05:40:36,703 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-18 05:40:36,703 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-18 05:40:36,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-03-18 05:40:44,713 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-03-18 05:40:44,713 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-03-18 05:40:44,713 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-03-18 05:40:44,713 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-03-18 05:40:44,713 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-03-18 05:40:44,713 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-03-18 05:40:44,714 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-03-18 05:40:44,714 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-03-18 05:40:44,714 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-03-18 05:40:44,714 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-03-18 05:40:44,714 INFO L878 garLoopResultBuilder]: At program point L60-1(lines 29 104) the Hoare annotation is: (let ((.cse5 (= main_~lk1~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse3 (= main_~p2~0 0)) (.cse4 (= main_~p4~0 0)) (.cse2 (= main_~p1~0 0)) (.cse6 (= main_~p3~0 0)) (.cse7 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse3) (and .cse5 .cse0 .cse6 .cse7) (and .cse4 .cse2 .cse3 .cse6) (and .cse4 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse5 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse6 .cse7) (and .cse5 .cse0 .cse1 .cse7) (and .cse4 .cse1 .cse2 .cse7) (and .cse0 .cse1 .cse2 .cse7) (and .cse4 .cse5 .cse3 .cse6) (and .cse0 .cse2 .cse6 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse0 .cse1 .cse3) (and .cse4 .cse2 .cse6 .cse7))) [2022-03-18 05:40:44,714 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 6 109) the Hoare annotation is: true [2022-03-18 05:40:44,714 INFO L878 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: (let ((.cse1 (= main_~p4~0 0)) (.cse2 (= main_~lk5~0 1)) (.cse5 (= main_~lk6~0 1)) (.cse0 (not (= main_~p3~0 0))) (.cse7 (= main_~lk4~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse6 (= main_~p5~0 0)) (.cse4 (= main_~p6~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse5) (and .cse0 .cse1 .cse3 .cse6 .cse5) (and .cse0 .cse2 .cse7 .cse3 .cse5) (and .cse0 .cse1 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse7 .cse3 .cse4) (and .cse0 .cse7 .cse3 .cse6 .cse5) (and .cse0 .cse7 .cse3 .cse6 .cse4))) [2022-03-18 05:40:44,714 INFO L878 garLoopResultBuilder]: At program point L52-1(lines 29 104) the Hoare annotation is: (let ((.cse0 (= main_~lk1~0 1)) (.cse3 (= main_~p2~0 0)) (.cse2 (= main_~p1~0 0)) (.cse1 (= main_~lk2~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse3) (and .cse2 .cse1))) [2022-03-18 05:40:44,714 INFO L878 garLoopResultBuilder]: At program point L94-1(lines 29 104) the Hoare annotation is: (or (= main_~p6~0 0) (= main_~lk6~0 1)) [2022-03-18 05:40:44,714 INFO L878 garLoopResultBuilder]: At program point L95(line 95) the Hoare annotation is: (let ((.cse0 (not (= main_~p5~0 0))) (.cse1 (= main_~lk5~0 1))) (or (and .cse0 .cse1 (= main_~p6~0 0)) (and .cse0 .cse1 (= main_~lk6~0 1)))) [2022-03-18 05:40:44,714 INFO L878 garLoopResultBuilder]: At program point L79-1(lines 29 104) the Hoare annotation is: (let ((.cse1 (= main_~p5~0 0)) (.cse2 (= main_~lk6~0 1)) (.cse0 (= main_~p4~0 0)) (.cse6 (= main_~lk3~0 1)) (.cse4 (= main_~lk5~0 1)) (.cse5 (= main_~lk4~0 1)) (.cse7 (= main_~p6~0 0)) (.cse3 (= main_~p3~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse6 .cse1 .cse7) (and .cse5 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse7 .cse3) (and .cse0 .cse4 .cse2 .cse3) (and .cse0 .cse6 .cse1 .cse2) (and .cse5 .cse6 .cse1 .cse2) (and .cse4 .cse5 .cse2 .cse3) (and .cse5 .cse6 .cse1 .cse7) (and .cse0 .cse4 .cse6 .cse2) (and .cse5 .cse1 .cse7 .cse3) (and .cse0 .cse4 .cse7 .cse3) (and .cse4 .cse5 .cse6 .cse2) (and .cse0 .cse4 .cse6 .cse7) (and .cse4 .cse5 .cse7 .cse3))) [2022-03-18 05:40:44,715 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 6 109) the Hoare annotation is: true [2022-03-18 05:40:44,715 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 107) the Hoare annotation is: false [2022-03-18 05:40:44,715 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 6 109) the Hoare annotation is: true [2022-03-18 05:40:44,715 INFO L878 garLoopResultBuilder]: At program point L80(line 80) the Hoare annotation is: (let ((.cse0 (= main_~p4~0 0)) (.cse1 (= main_~p5~0 0)) (.cse2 (= main_~lk6~0 1)) (.cse3 (= main_~p3~0 0)) (.cse6 (= main_~lk5~0 1)) (.cse7 (= main_~lk4~0 1)) (.cse8 (= main_~lk3~0 1)) (.cse5 (= main_~p6~0 0)) (.cse4 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse3 .cse4) (and .cse0 .cse6 .cse5 .cse3 .cse4) (and .cse6 .cse7 .cse8 .cse2 .cse4) (and .cse6 .cse7 .cse5 .cse3 .cse4) (and .cse7 .cse8 .cse1 .cse2 .cse4) (and .cse0 .cse8 .cse1 .cse2 .cse4) (and .cse7 .cse1 .cse5 .cse3 .cse4) (and .cse6 .cse7 .cse2 .cse3 .cse4) (and .cse0 .cse6 .cse8 .cse2 .cse4) (and .cse7 .cse8 .cse1 .cse5 .cse4) (and .cse0 .cse6 .cse2 .cse3 .cse4) (and .cse0 .cse6 .cse8 .cse5 .cse4) (and .cse0 .cse8 .cse1 .cse5 .cse4) (and .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse7 .cse8 .cse5 .cse4))) [2022-03-18 05:40:44,715 INFO L885 garLoopResultBuilder]: At program point L105(lines 7 109) the Hoare annotation is: true [2022-03-18 05:40:44,715 INFO L885 garLoopResultBuilder]: At program point L31(lines 31 33) the Hoare annotation is: true [2022-03-18 05:40:44,715 INFO L878 garLoopResultBuilder]: At program point L64-1(lines 29 104) the Hoare annotation is: (let ((.cse9 (= main_~lk2~0 1)) (.cse4 (= main_~p3~0 0)) (.cse5 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse8 (= main_~p1~0 0)) (.cse7 (= main_~p5~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse3) (and .cse1 .cse2 .cse7 .cse3 .cse4) (and .cse2 .cse8 .cse7 .cse4 .cse9) (and .cse0 .cse2 .cse8 .cse3 .cse4) (and .cse5 .cse0 .cse8 .cse4 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse9) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse5 .cse6 .cse8 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse6 .cse3) (and .cse5 .cse0 .cse6 .cse8 .cse3) (and .cse0 .cse1 .cse2 .cse4 .cse9) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse1 .cse2 .cse6 .cse7 .cse9) (and .cse1 .cse2 .cse7 .cse4 .cse9) (and .cse5 .cse0 .cse6 .cse8 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse3) (and .cse5 .cse0 .cse8 .cse3 .cse4) (and .cse5 .cse1 .cse7 .cse4 .cse9) (and .cse5 .cse8 .cse7 .cse3 .cse4) (and .cse2 .cse6 .cse8 .cse7 .cse9) (and .cse5 .cse0 .cse1 .cse4 .cse9) (and .cse2 .cse8 .cse7 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse9) (and .cse1 .cse2 .cse6 .cse7 .cse3) (and .cse0 .cse2 .cse8 .cse4 .cse9) (and .cse5 .cse8 .cse7 .cse4 .cse9) (and .cse5 .cse6 .cse8 .cse7 .cse3) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse3) (and .cse2 .cse6 .cse8 .cse7 .cse3))) [2022-03-18 05:40:44,715 INFO L878 garLoopResultBuilder]: At program point L89-1(lines 29 104) the Hoare annotation is: (let ((.cse0 (= main_~lk5~0 1)) (.cse3 (= main_~lk6~0 1)) (.cse2 (= main_~p5~0 0)) (.cse1 (= main_~p6~0 0))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse3) (and .cse2 .cse1))) [2022-03-18 05:40:44,715 INFO L878 garLoopResultBuilder]: At program point L56-1(lines 29 104) the Hoare annotation is: (let ((.cse4 (= main_~p1~0 0)) (.cse2 (= main_~p3~0 0)) (.cse5 (= main_~lk2~0 1)) (.cse0 (= main_~lk1~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse1 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse4 .cse1 .cse2) (and .cse0 .cse3 .cse5) (and .cse3 .cse4 .cse1) (and .cse0 .cse2 .cse5) (and .cse4 .cse2 .cse5) (and .cse0 .cse3 .cse1))) [2022-03-18 05:40:44,715 INFO L885 garLoopResultBuilder]: At program point L48(lines 48 50) the Hoare annotation is: true [2022-03-18 05:40:44,715 INFO L878 garLoopResultBuilder]: At program point L48-2(lines 29 104) the Hoare annotation is: (or (= main_~lk1~0 1) (= main_~p1~0 0)) [2022-03-18 05:40:44,716 INFO L878 garLoopResultBuilder]: At program point L90(line 90) the Hoare annotation is: (let ((.cse3 (= main_~p6~0 0)) (.cse4 (= main_~p5~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse1 (not (= main_~p4~0 0))) (.cse2 (= main_~lk4~0 1)) (.cse5 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse4 .cse3) (and .cse1 .cse2 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse5))) [2022-03-18 05:40:44,716 INFO L878 garLoopResultBuilder]: At program point L74-1(lines 29 104) the Hoare annotation is: (let ((.cse8 (= main_~p4~0 0)) (.cse2 (= main_~p2~0 0)) (.cse6 (= main_~p5~0 0)) (.cse3 (= main_~lk6~0 1)) (.cse4 (= main_~p3~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse1 (= main_~lk4~0 1)) (.cse5 (= main_~lk3~0 1)) (.cse7 (= main_~p6~0 0)) (.cse9 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse5 .cse6 .cse2 .cse7) (and .cse0 .cse1 .cse5 .cse2 .cse7) (and .cse8 .cse5 .cse6 .cse2 .cse7) (and .cse8 .cse6 .cse3 .cse4 .cse9) (and .cse8 .cse5 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse7 .cse4) (and .cse8 .cse6 .cse7 .cse4 .cse9) (and .cse8 .cse0 .cse7 .cse4 .cse9) (and .cse0 .cse1 .cse5 .cse3 .cse9) (and .cse8 .cse6 .cse2 .cse7 .cse4) (and .cse0 .cse1 .cse7 .cse4 .cse9) (and .cse1 .cse5 .cse6 .cse3 .cse9) (and .cse8 .cse5 .cse6 .cse3 .cse9) (and .cse1 .cse6 .cse2 .cse7 .cse4) (and .cse1 .cse6 .cse7 .cse4 .cse9) (and .cse8 .cse6 .cse2 .cse3 .cse4) (and .cse1 .cse5 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse3 .cse4 .cse9) (and .cse8 .cse0 .cse5 .cse3 .cse9) (and .cse1 .cse5 .cse6 .cse7 .cse9) (and .cse8 .cse0 .cse5 .cse2 .cse7) (and .cse8 .cse0 .cse3 .cse4 .cse9) (and .cse1 .cse6 .cse2 .cse3 .cse4) (and .cse8 .cse0 .cse2 .cse7 .cse4) (and .cse0 .cse1 .cse5 .cse2 .cse3) (and .cse8 .cse0 .cse5 .cse7 .cse9) (and .cse8 .cse0 .cse2 .cse3 .cse4) (and .cse8 .cse5 .cse6 .cse7 .cse9) (and .cse8 .cse0 .cse5 .cse2 .cse3) (and .cse1 .cse6 .cse3 .cse4 .cse9) (and .cse0 .cse1 .cse5 .cse7 .cse9))) [2022-03-18 05:40:44,716 INFO L885 garLoopResultBuilder]: At program point L99-1(lines 29 104) the Hoare annotation is: true [2022-03-18 05:40:44,716 INFO L878 garLoopResultBuilder]: At program point L75(line 75) the Hoare annotation is: (let ((.cse8 (= main_~p5~0 0)) (.cse7 (= main_~lk4~0 1)) (.cse10 (= main_~p2~0 0)) (.cse4 (= main_~p6~0 0)) (.cse5 (= main_~p3~0 0)) (.cse0 (= main_~p4~0 0)) (.cse1 (= main_~lk5~0 1)) (.cse2 (not (= main_~p1~0 0))) (.cse3 (= main_~lk1~0 1)) (.cse11 (= main_~lk3~0 1)) (.cse9 (= main_~lk6~0 1)) (.cse6 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse3 .cse7 .cse8 .cse9 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse9 .cse5) (and .cse2 .cse3 .cse7 .cse8 .cse4 .cse5 .cse6) (and .cse2 .cse3 .cse7 .cse11 .cse8 .cse4 .cse6) (and .cse2 .cse3 .cse7 .cse8 .cse10 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse8 .cse10 .cse4 .cse5) (and .cse2 .cse3 .cse7 .cse8 .cse10 .cse9 .cse5) (and .cse0 .cse2 .cse3 .cse11 .cse8 .cse9 .cse6) (and .cse2 .cse3 .cse7 .cse11 .cse8 .cse10 .cse4) (and .cse0 .cse2 .cse3 .cse11 .cse8 .cse4 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse11 .cse10 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse4 .cse6) (and .cse0 .cse2 .cse3 .cse11 .cse8 .cse10 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse10 .cse9 .cse5) (and .cse1 .cse2 .cse3 .cse7 .cse9 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse11 .cse10 .cse9) (and .cse2 .cse3 .cse7 .cse11 .cse8 .cse9 .cse6) (and .cse0 .cse2 .cse3 .cse8 .cse10 .cse9 .cse5) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse10 .cse4) (and .cse1 .cse2 .cse3 .cse7 .cse11 .cse4 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse10 .cse9) (and .cse0 .cse2 .cse3 .cse8 .cse9 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse11 .cse9 .cse6) (and .cse0 .cse2 .cse3 .cse11 .cse8 .cse10 .cse9) (and .cse2 .cse3 .cse7 .cse11 .cse8 .cse10 .cse9) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse10 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse9 .cse6))) [2022-03-18 05:40:44,716 INFO L878 garLoopResultBuilder]: At program point L100(line 100) the Hoare annotation is: (= main_~lk6~0 1) [2022-03-18 05:40:44,716 INFO L878 garLoopResultBuilder]: At program point L100-1(lines 7 109) the Hoare annotation is: false [2022-03-18 05:40:44,716 INFO L878 garLoopResultBuilder]: At program point L84-1(lines 29 104) the Hoare annotation is: (let ((.cse0 (= main_~p4~0 0)) (.cse4 (= main_~p5~0 0)) (.cse2 (= main_~p6~0 0)) (.cse1 (= main_~lk5~0 1)) (.cse5 (= main_~lk4~0 1)) (.cse3 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse3) (and .cse0 .cse4 .cse2) (and .cse5 .cse4 .cse3) (and .cse0 .cse4 .cse3) (and .cse1 .cse5 .cse2) (and .cse5 .cse4 .cse2) (and .cse1 .cse5 .cse3))) [2022-03-18 05:40:44,716 INFO L878 garLoopResultBuilder]: At program point L68-1(lines 29 104) the Hoare annotation is: (let ((.cse3 (= main_~p2~0 0)) (.cse7 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse9 (= main_~p1~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse8 (= main_~lk3~0 1)) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse11 (= main_~p5~0 0)) (.cse6 (= main_~p6~0 0)) (.cse5 (= main_~p3~0 0)) (.cse10 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse6 .cse10) (and .cse7 .cse8 .cse9 .cse11 .cse3 .cse4) (and .cse7 .cse1 .cse8 .cse11 .cse6 .cse10) (and .cse0 .cse2 .cse9 .cse4 .cse5 .cse10) (and .cse7 .cse1 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse9 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse9 .cse6 .cse5 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse6 .cse10) (and .cse7 .cse1 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse4 .cse5 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse8 .cse4 .cse10) (and .cse7 .cse0 .cse8 .cse9 .cse3 .cse6) (and .cse0 .cse2 .cse8 .cse9 .cse4 .cse10) (and .cse7 .cse9 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse3 .cse4) (and .cse7 .cse8 .cse9 .cse11 .cse6 .cse10) (and .cse2 .cse9 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse4 .cse10) (and .cse7 .cse1 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse4 .cse10) (and .cse1 .cse2 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse9 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse8 .cse9 .cse11 .cse4 .cse10) (and .cse7 .cse1 .cse8 .cse11 .cse3 .cse6) (and .cse0 .cse2 .cse9 .cse6 .cse5 .cse10) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse9 .cse3 .cse6 .cse5) (and .cse0 .cse2 .cse9 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse8 .cse11 .cse3 .cse4) (and .cse0 .cse2 .cse8 .cse9 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse8 .cse6 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse4) (and .cse7 .cse9 .cse11 .cse6 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse6 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse6) (and .cse7 .cse0 .cse9 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse6) (and .cse0 .cse2 .cse8 .cse9 .cse6 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse3 .cse6) (and .cse7 .cse0 .cse1 .cse8 .cse6 .cse10) (and .cse2 .cse9 .cse11 .cse6 .cse5 .cse10) (and .cse7 .cse1 .cse11 .cse6 .cse5 .cse10) (and .cse2 .cse9 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse9 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse8 .cse9 .cse11 .cse3 .cse6) (and .cse2 .cse8 .cse9 .cse11 .cse3 .cse4) (and .cse7 .cse1 .cse8 .cse11 .cse4 .cse10) (and .cse0 .cse1 .cse2 .cse6 .cse5 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse4 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse4 .cse10) (and .cse1 .cse2 .cse11 .cse3 .cse6 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse4) (and .cse2 .cse9 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse1 .cse8 .cse11 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10) (and .cse0 .cse2 .cse8 .cse9 .cse3 .cse4) (and .cse7 .cse0 .cse9 .cse4 .cse5 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse6 .cse10) (and .cse1 .cse2 .cse11 .cse6 .cse5 .cse10))) [2022-03-18 05:40:44,718 INFO L718 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-03-18 05:40:44,719 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-18 05:40:44,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.03 05:40:44 BoogieIcfgContainer [2022-03-18 05:40:44,726 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-18 05:40:44,726 INFO L158 Benchmark]: Toolchain (without parser) took 11164.26ms. Allocated memory was 209.7MB in the beginning and 687.9MB in the end (delta: 478.2MB). Free memory was 161.5MB in the beginning and 613.1MB in the end (delta: -451.5MB). Peak memory consumption was 386.8MB. Max. memory is 8.0GB. [2022-03-18 05:40:44,726 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 209.7MB. Free memory is still 177.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-18 05:40:44,727 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.25ms. Allocated memory is still 209.7MB. Free memory was 161.4MB in the beginning and 186.9MB in the end (delta: -25.6MB). Peak memory consumption was 13.4MB. Max. memory is 8.0GB. [2022-03-18 05:40:44,727 INFO L158 Benchmark]: Boogie Preprocessor took 41.34ms. Allocated memory is still 209.7MB. Free memory was 186.9MB in the beginning and 185.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-18 05:40:44,727 INFO L158 Benchmark]: RCFGBuilder took 337.44ms. Allocated memory is still 209.7MB. Free memory was 185.4MB in the beginning and 174.4MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-03-18 05:40:44,727 INFO L158 Benchmark]: TraceAbstraction took 10562.45ms. Allocated memory was 209.7MB in the beginning and 687.9MB in the end (delta: 478.2MB). Free memory was 173.8MB in the beginning and 613.1MB in the end (delta: -439.3MB). Peak memory consumption was 398.7MB. Max. memory is 8.0GB. [2022-03-18 05:40:44,728 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 209.7MB. Free memory is still 177.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 218.25ms. Allocated memory is still 209.7MB. Free memory was 161.4MB in the beginning and 186.9MB in the end (delta: -25.6MB). Peak memory consumption was 13.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.34ms. Allocated memory is still 209.7MB. Free memory was 186.9MB in the beginning and 185.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 337.44ms. Allocated memory is still 209.7MB. Free memory was 185.4MB in the beginning and 174.4MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 10562.45ms. Allocated memory was 209.7MB in the beginning and 687.9MB in the end (delta: 478.2MB). Free memory was 173.8MB in the beginning and 613.1MB in the end (delta: -439.3MB). Peak memory consumption was 398.7MB. 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: 107]: 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 4 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.5s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1224 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1224 mSDsluCounter, 1008 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 114 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 614 IncrementalHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 894 mSDtfsCounter, 614 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=905occurred in iteration=15, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 268 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 1162 NumberOfFragments, 4131 HoareAnnotationTreeSize, 33 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 2.6s HoareSimplificationTime, 33 FomulaSimplificationsInter, 38507 FormulaSimplificationTreeSizeReductionInter, 5.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-03-18 05:40:44,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...