./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a2d0541b7182b8d8954c2042edf4f52b3e2170f02f3494e1e889a6c80f344b8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 08:56:41,182 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 08:56:41,267 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 08:56:41,272 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 08:56:41,275 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 08:56:41,319 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 08:56:41,319 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 08:56:41,320 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 08:56:41,321 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 08:56:41,323 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 08:56:41,323 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 08:56:41,323 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 08:56:41,324 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 08:56:41,326 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 08:56:41,326 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 08:56:41,327 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 08:56:41,327 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 08:56:41,327 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 08:56:41,327 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 08:56:41,328 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 08:56:41,328 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 08:56:41,331 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 08:56:41,331 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 08:56:41,331 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 08:56:41,332 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 08:56:41,332 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 08:56:41,332 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 08:56:41,332 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 08:56:41,333 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 08:56:41,333 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 08:56:41,333 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 08:56:41,333 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 08:56:41,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:56:41,335 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 08:56:41,335 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 08:56:41,335 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 08:56:41,336 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 08:56:41,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 08:56:41,336 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 08:56:41,337 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 08:56:41,337 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 08:56:41,337 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 08:56:41,337 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3a2d0541b7182b8d8954c2042edf4f52b3e2170f02f3494e1e889a6c80f344b8 [2024-11-20 08:56:41,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 08:56:41,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 08:56:41,625 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 08:56:41,627 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 08:56:41,627 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 08:56:41,629 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-4.i [2024-11-20 08:56:43,128 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 08:56:43,365 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 08:56:43,367 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-4.i [2024-11-20 08:56:43,376 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a9c322e5/0c34dad0bbbf4c34b9fc94073d9069a1/FLAG68dafe6d3 [2024-11-20 08:56:43,390 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a9c322e5/0c34dad0bbbf4c34b9fc94073d9069a1 [2024-11-20 08:56:43,392 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 08:56:43,393 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 08:56:43,395 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 08:56:43,395 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 08:56:43,400 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 08:56:43,401 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:56:43" (1/1) ... [2024-11-20 08:56:43,402 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1781f6f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:56:43, skipping insertion in model container [2024-11-20 08:56:43,402 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:56:43" (1/1) ... [2024-11-20 08:56:43,448 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 08:56:43,631 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-4.i[915,928] [2024-11-20 08:56:43,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:56:43,730 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 08:56:43,744 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-4.i[915,928] [2024-11-20 08:56:43,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:56:43,823 INFO L204 MainTranslator]: Completed translation [2024-11-20 08:56:43,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:56:43 WrapperNode [2024-11-20 08:56:43,824 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 08:56:43,825 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 08:56:43,825 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 08:56:43,825 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 08:56:43,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:56:43" (1/1) ... [2024-11-20 08:56:43,851 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:56:43" (1/1) ... [2024-11-20 08:56:43,897 INFO L138 Inliner]: procedures = 30, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 490 [2024-11-20 08:56:43,898 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 08:56:43,899 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 08:56:43,899 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 08:56:43,899 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 08:56:43,911 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:56:43" (1/1) ... [2024-11-20 08:56:43,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:56:43" (1/1) ... [2024-11-20 08:56:43,924 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:56:43" (1/1) ... [2024-11-20 08:56:43,935 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-20 08:56:43,939 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:56:43" (1/1) ... [2024-11-20 08:56:43,940 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:56:43" (1/1) ... [2024-11-20 08:56:43,970 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:56:43" (1/1) ... [2024-11-20 08:56:43,974 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:56:43" (1/1) ... [2024-11-20 08:56:43,981 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:56:43" (1/1) ... [2024-11-20 08:56:43,984 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:56:43" (1/1) ... [2024-11-20 08:56:43,998 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 08:56:43,999 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 08:56:43,999 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 08:56:43,999 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 08:56:44,001 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:56:43" (1/1) ... [2024-11-20 08:56:44,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:56:44,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:56:44,045 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 08:56:44,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 08:56:44,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 08:56:44,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-20 08:56:44,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-20 08:56:44,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-20 08:56:44,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-20 08:56:44,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-20 08:56:44,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-20 08:56:44,108 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 08:56:44,108 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 08:56:44,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-20 08:56:44,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 08:56:44,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 08:56:44,246 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 08:56:44,248 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 08:56:44,869 INFO L? ?]: Removed 144 outVars from TransFormulas that were not future-live. [2024-11-20 08:56:44,869 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 08:56:44,890 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 08:56:44,890 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 08:56:44,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:56:44 BoogieIcfgContainer [2024-11-20 08:56:44,891 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 08:56:44,894 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 08:56:44,894 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 08:56:44,898 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 08:56:44,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:56:43" (1/3) ... [2024-11-20 08:56:44,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e3e006f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:56:44, skipping insertion in model container [2024-11-20 08:56:44,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:56:43" (2/3) ... [2024-11-20 08:56:44,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e3e006f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:56:44, skipping insertion in model container [2024-11-20 08:56:44,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:56:44" (3/3) ... [2024-11-20 08:56:44,901 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-4.i [2024-11-20 08:56:44,920 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 08:56:44,920 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 08:56:44,986 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 08:56:44,996 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@49a6aa31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 08:56:44,996 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 08:56:45,001 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 92 states have (on average 1.423913043478261) internal successors, (131), 93 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 08:56:45,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-20 08:56:45,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:56:45,019 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:56:45,019 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:56:45,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:56:45,026 INFO L85 PathProgramCache]: Analyzing trace with hash -81952660, now seen corresponding path program 1 times [2024-11-20 08:56:45,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:56:45,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73582523] [2024-11-20 08:56:45,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:56:45,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:56:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:45,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:56:45,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:45,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:56:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:45,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:56:45,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:45,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:56:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:45,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:56:45,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:45,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:56:45,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:45,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:56:45,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:45,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:56:45,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:45,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:56:45,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:45,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:56:45,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:45,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:56:45,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:45,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:56:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:45,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:56:45,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:45,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:56:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:45,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:56:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:45,878 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:56:45,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:56:45,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73582523] [2024-11-20 08:56:45,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73582523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:56:45,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:56:45,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:56:45,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522770723] [2024-11-20 08:56:45,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:56:45,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:56:45,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:56:45,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:56:45,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:56:45,930 INFO L87 Difference]: Start difference. First operand has 110 states, 92 states have (on average 1.423913043478261) internal successors, (131), 93 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 08:56:46,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:56:46,008 INFO L93 Difference]: Finished difference Result 216 states and 335 transitions. [2024-11-20 08:56:46,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:56:46,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-11-20 08:56:46,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:56:46,025 INFO L225 Difference]: With dead ends: 216 [2024-11-20 08:56:46,025 INFO L226 Difference]: Without dead ends: 109 [2024-11-20 08:56:46,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:56:46,032 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 1 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:56:46,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 444 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:56:46,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-20 08:56:46,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2024-11-20 08:56:46,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 91 states have internal predecessors, (126), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 08:56:46,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 156 transitions. [2024-11-20 08:56:46,097 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 156 transitions. Word has length 130 [2024-11-20 08:56:46,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:56:46,100 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 156 transitions. [2024-11-20 08:56:46,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 08:56:46,100 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 156 transitions. [2024-11-20 08:56:46,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-20 08:56:46,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:56:46,103 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:56:46,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 08:56:46,103 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:56:46,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:56:46,104 INFO L85 PathProgramCache]: Analyzing trace with hash -80105618, now seen corresponding path program 1 times [2024-11-20 08:56:46,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:56:46,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623025322] [2024-11-20 08:56:46,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:56:46,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:56:46,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:48,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:56:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:48,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:56:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:48,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:56:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:48,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:56:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:48,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:56:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:48,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:56:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:48,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:56:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:48,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:56:48,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:48,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:56:48,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:48,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:56:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:48,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:56:48,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:48,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:56:48,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:48,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:56:48,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:48,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:56:48,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:48,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:56:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:48,950 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:56:48,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:56:48,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623025322] [2024-11-20 08:56:48,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623025322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:56:48,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:56:48,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 08:56:48,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781757197] [2024-11-20 08:56:48,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:56:48,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 08:56:48,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:56:48,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 08:56:48,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:56:48,961 INFO L87 Difference]: Start difference. First operand 108 states and 156 transitions. Second operand has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 08:56:50,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:56:50,273 INFO L93 Difference]: Finished difference Result 354 states and 508 transitions. [2024-11-20 08:56:50,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 08:56:50,273 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2024-11-20 08:56:50,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:56:50,278 INFO L225 Difference]: With dead ends: 354 [2024-11-20 08:56:50,280 INFO L226 Difference]: Without dead ends: 249 [2024-11-20 08:56:50,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-11-20 08:56:50,282 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 273 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:56:50,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 776 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 08:56:50,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-20 08:56:50,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 226. [2024-11-20 08:56:50,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 186 states have (on average 1.3602150537634408) internal successors, (253), 188 states have internal predecessors, (253), 35 states have call successors, (35), 4 states have call predecessors, (35), 4 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-20 08:56:50,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 323 transitions. [2024-11-20 08:56:50,328 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 323 transitions. Word has length 130 [2024-11-20 08:56:50,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:56:50,329 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 323 transitions. [2024-11-20 08:56:50,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 08:56:50,329 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 323 transitions. [2024-11-20 08:56:50,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-20 08:56:50,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:56:50,335 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:56:50,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 08:56:50,336 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:56:50,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:56:50,336 INFO L85 PathProgramCache]: Analyzing trace with hash 620958960, now seen corresponding path program 1 times [2024-11-20 08:56:50,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:56:50,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646362797] [2024-11-20 08:56:50,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:56:50,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:56:50,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:50,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:56:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:50,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:56:50,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:50,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:56:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:50,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:56:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:50,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:56:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:50,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:56:50,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:50,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:56:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:50,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:56:50,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:50,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:56:50,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:50,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:56:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:50,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:56:50,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:50,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:56:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:50,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:56:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:50,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:56:50,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:50,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:56:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:50,582 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:56:50,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:56:50,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646362797] [2024-11-20 08:56:50,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646362797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:56:50,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:56:50,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:56:50,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916822339] [2024-11-20 08:56:50,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:56:50,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:56:50,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:56:50,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:56:50,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:56:50,588 INFO L87 Difference]: Start difference. First operand 226 states and 323 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 08:56:50,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:56:50,626 INFO L93 Difference]: Finished difference Result 438 states and 630 transitions. [2024-11-20 08:56:50,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:56:50,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-11-20 08:56:50,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:56:50,632 INFO L225 Difference]: With dead ends: 438 [2024-11-20 08:56:50,635 INFO L226 Difference]: Without dead ends: 230 [2024-11-20 08:56:50,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:56:50,639 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:56:50,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 446 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:56:50,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-20 08:56:50,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2024-11-20 08:56:50,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 190 states have (on average 1.3526315789473684) internal successors, (257), 192 states have internal predecessors, (257), 35 states have call successors, (35), 4 states have call predecessors, (35), 4 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-20 08:56:50,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 327 transitions. [2024-11-20 08:56:50,679 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 327 transitions. Word has length 130 [2024-11-20 08:56:50,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:56:50,681 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 327 transitions. [2024-11-20 08:56:50,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 08:56:50,681 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 327 transitions. [2024-11-20 08:56:50,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-20 08:56:50,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:56:50,683 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:56:50,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 08:56:50,684 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:56:50,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:56:50,684 INFO L85 PathProgramCache]: Analyzing trace with hash 342596208, now seen corresponding path program 1 times [2024-11-20 08:56:50,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:56:50,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005628613] [2024-11-20 08:56:50,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:56:50,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:56:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:51,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:56:51,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:51,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:56:51,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:51,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:56:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:51,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:56:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:51,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:56:51,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:51,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:56:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:51,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:56:51,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:51,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:56:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:51,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:56:51,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:51,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:56:51,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:51,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:56:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:51,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:56:51,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:51,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:56:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:51,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:56:51,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:51,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:56:51,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:51,986 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:56:51,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:56:51,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005628613] [2024-11-20 08:56:51,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005628613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:56:51,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:56:51,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 08:56:51,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265250934] [2024-11-20 08:56:51,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:56:51,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 08:56:51,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:56:51,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 08:56:51,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:56:51,994 INFO L87 Difference]: Start difference. First operand 230 states and 327 transitions. Second operand has 7 states, 6 states have (on average 9.666666666666666) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 08:56:52,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:56:52,833 INFO L93 Difference]: Finished difference Result 508 states and 729 transitions. [2024-11-20 08:56:52,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 08:56:52,834 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.666666666666666) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2024-11-20 08:56:52,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:56:52,837 INFO L225 Difference]: With dead ends: 508 [2024-11-20 08:56:52,837 INFO L226 Difference]: Without dead ends: 296 [2024-11-20 08:56:52,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-20 08:56:52,839 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 134 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 08:56:52,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 727 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 08:56:52,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-11-20 08:56:52,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 217. [2024-11-20 08:56:52,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 183 states have (on average 1.366120218579235) internal successors, (250), 184 states have internal predecessors, (250), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-20 08:56:52,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 310 transitions. [2024-11-20 08:56:52,862 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 310 transitions. Word has length 130 [2024-11-20 08:56:52,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:56:52,862 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 310 transitions. [2024-11-20 08:56:52,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.666666666666666) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 08:56:52,863 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 310 transitions. [2024-11-20 08:56:52,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-20 08:56:52,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:56:52,865 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:56:52,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 08:56:52,865 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:56:52,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:56:52,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1471545218, now seen corresponding path program 1 times [2024-11-20 08:56:52,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:56:52,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053985603] [2024-11-20 08:56:52,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:56:52,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:56:52,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:53,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:56:53,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:53,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:56:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:53,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:56:53,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:53,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:56:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:53,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:56:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:53,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:56:53,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:53,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:56:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:53,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:56:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:53,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:56:53,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:53,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:56:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:53,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:56:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:53,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:56:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:53,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:56:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:53,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:56:53,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:53,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:56:53,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:53,075 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:56:53,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:56:53,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053985603] [2024-11-20 08:56:53,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053985603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:56:53,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:56:53,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 08:56:53,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911488350] [2024-11-20 08:56:53,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:56:53,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:56:53,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:56:53,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:56:53,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:56:53,080 INFO L87 Difference]: Start difference. First operand 217 states and 310 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 08:56:53,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:56:53,123 INFO L93 Difference]: Finished difference Result 437 states and 625 transitions. [2024-11-20 08:56:53,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 08:56:53,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2024-11-20 08:56:53,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:56:53,127 INFO L225 Difference]: With dead ends: 437 [2024-11-20 08:56:53,127 INFO L226 Difference]: Without dead ends: 223 [2024-11-20 08:56:53,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:56:53,129 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:56:53,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 590 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:56:53,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-20 08:56:53,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 219. [2024-11-20 08:56:53,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 185 states have (on average 1.3621621621621622) internal successors, (252), 186 states have internal predecessors, (252), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-20 08:56:53,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 312 transitions. [2024-11-20 08:56:53,156 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 312 transitions. Word has length 132 [2024-11-20 08:56:53,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:56:53,157 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 312 transitions. [2024-11-20 08:56:53,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 08:56:53,158 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 312 transitions. [2024-11-20 08:56:53,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-20 08:56:53,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:56:53,162 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:56:53,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 08:56:53,163 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:56:53,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:56:53,163 INFO L85 PathProgramCache]: Analyzing trace with hash -967344249, now seen corresponding path program 1 times [2024-11-20 08:56:53,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:56:53,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22686025] [2024-11-20 08:56:53,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:56:53,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:56:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:54,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:56:54,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:54,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:56:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:54,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:56:54,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:54,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:56:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:54,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:56:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:54,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:56:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:54,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:56:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:54,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:56:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:54,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:56:54,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:54,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:56:54,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:54,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:56:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:54,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:56:54,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:54,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:56:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:54,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:56:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:54,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:56:54,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:54,512 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:56:54,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:56:54,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22686025] [2024-11-20 08:56:54,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22686025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:56:54,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:56:54,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 08:56:54,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475837556] [2024-11-20 08:56:54,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:56:54,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 08:56:54,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:56:54,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 08:56:54,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:56:54,515 INFO L87 Difference]: Start difference. First operand 219 states and 312 transitions. Second operand has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 08:56:55,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:56:55,681 INFO L93 Difference]: Finished difference Result 461 states and 653 transitions. [2024-11-20 08:56:55,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 08:56:55,681 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2024-11-20 08:56:55,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:56:55,684 INFO L225 Difference]: With dead ends: 461 [2024-11-20 08:56:55,684 INFO L226 Difference]: Without dead ends: 245 [2024-11-20 08:56:55,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-20 08:56:55,687 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 188 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:56:55,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 437 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-20 08:56:55,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-20 08:56:55,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 219. [2024-11-20 08:56:55,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 185 states have (on average 1.3567567567567567) internal successors, (251), 186 states have internal predecessors, (251), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-20 08:56:55,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 311 transitions. [2024-11-20 08:56:55,713 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 311 transitions. Word has length 134 [2024-11-20 08:56:55,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:56:55,714 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 311 transitions. [2024-11-20 08:56:55,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 08:56:55,715 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 311 transitions. [2024-11-20 08:56:55,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-20 08:56:55,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:56:55,716 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:56:55,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 08:56:55,717 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:56:55,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:56:55,717 INFO L85 PathProgramCache]: Analyzing trace with hash 2047759369, now seen corresponding path program 1 times [2024-11-20 08:56:55,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:56:55,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4126329] [2024-11-20 08:56:55,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:56:55,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:56:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:58,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:56:58,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:58,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:56:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:58,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:56:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:58,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:56:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:58,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:56:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:58,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:56:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:58,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:56:58,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:58,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:56:58,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:58,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:56:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:58,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:56:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:58,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:56:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:58,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:56:58,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:58,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:56:58,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:58,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:56:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:58,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:56:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:58,157 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-20 08:56:58,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:56:58,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4126329] [2024-11-20 08:56:58,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4126329] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:56:58,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266017786] [2024-11-20 08:56:58,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:56:58,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:56:58,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:56:58,164 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 08:56:58,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 08:56:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:56:58,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-20 08:56:58,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:56:58,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 08:56:58,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 08:56:58,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 08:56:58,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 08:56:58,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 08:56:58,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 08:56:58,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 08:56:58,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 08:56:58,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 08:56:58,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:56:58,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-20 08:56:58,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 64 [2024-11-20 08:56:58,859 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:56:58,860 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:56:58,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266017786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:56:58,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 08:56:58,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2024-11-20 08:56:58,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718629255] [2024-11-20 08:56:58,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:56:58,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:56:58,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:56:58,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:56:58,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-11-20 08:56:58,863 INFO L87 Difference]: Start difference. First operand 219 states and 311 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 08:56:59,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:56:59,615 INFO L93 Difference]: Finished difference Result 603 states and 842 transitions. [2024-11-20 08:56:59,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 08:56:59,616 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-20 08:56:59,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:56:59,619 INFO L225 Difference]: With dead ends: 603 [2024-11-20 08:56:59,619 INFO L226 Difference]: Without dead ends: 387 [2024-11-20 08:56:59,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-11-20 08:56:59,621 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 96 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 08:56:59,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 396 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 08:56:59,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-11-20 08:56:59,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 327. [2024-11-20 08:56:59,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 285 states have (on average 1.3473684210526315) internal successors, (384), 288 states have internal predecessors, (384), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-20 08:56:59,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 456 transitions. [2024-11-20 08:56:59,663 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 456 transitions. Word has length 134 [2024-11-20 08:56:59,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:56:59,664 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 456 transitions. [2024-11-20 08:56:59,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 08:56:59,665 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 456 transitions. [2024-11-20 08:56:59,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-20 08:56:59,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:56:59,667 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:56:59,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 08:56:59,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:56:59,868 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:56:59,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:56:59,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1267807044, now seen corresponding path program 1 times [2024-11-20 08:56:59,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:56:59,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400496914] [2024-11-20 08:56:59,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:56:59,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:57:00,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:02,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:57:02,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:02,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:57:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:02,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:57:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:02,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:57:02,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:02,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:57:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:02,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:57:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:02,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:57:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:02,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:57:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:02,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:57:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:02,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:57:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:02,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:57:02,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:02,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:57:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:02,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:57:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:02,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:57:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:02,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:57:02,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:02,692 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:57:02,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:57:02,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400496914] [2024-11-20 08:57:02,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400496914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:57:02,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:57:02,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 08:57:02,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593408118] [2024-11-20 08:57:02,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:57:02,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 08:57:02,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:57:02,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 08:57:02,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:57:02,695 INFO L87 Difference]: Start difference. First operand 327 states and 456 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 08:57:04,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:57:04,772 INFO L93 Difference]: Finished difference Result 987 states and 1376 transitions. [2024-11-20 08:57:04,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 08:57:04,772 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-20 08:57:04,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:57:04,776 INFO L225 Difference]: With dead ends: 987 [2024-11-20 08:57:04,776 INFO L226 Difference]: Without dead ends: 663 [2024-11-20 08:57:04,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-20 08:57:04,780 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 374 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-20 08:57:04,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 456 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-20 08:57:04,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2024-11-20 08:57:04,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 490. [2024-11-20 08:57:04,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 431 states have (on average 1.345707656612529) internal successors, (580), 434 states have internal predecessors, (580), 51 states have call successors, (51), 7 states have call predecessors, (51), 7 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-20 08:57:04,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 682 transitions. [2024-11-20 08:57:04,826 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 682 transitions. Word has length 134 [2024-11-20 08:57:04,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:57:04,826 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 682 transitions. [2024-11-20 08:57:04,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 08:57:04,827 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 682 transitions. [2024-11-20 08:57:04,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-20 08:57:04,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:57:04,829 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:57:04,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 08:57:04,830 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:57:04,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:57:04,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1668236923, now seen corresponding path program 1 times [2024-11-20 08:57:04,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:57:04,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190551690] [2024-11-20 08:57:04,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:57:04,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:57:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:06,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:57:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:06,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:57:06,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:06,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:57:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:06,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:57:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:06,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:57:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:06,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:57:06,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:06,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:57:06,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:06,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:57:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:06,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:57:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:06,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:57:06,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:06,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:57:06,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:06,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:57:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:06,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:57:06,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:06,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:57:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:06,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:57:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:06,372 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:57:06,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:57:06,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190551690] [2024-11-20 08:57:06,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190551690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:57:06,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:57:06,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 08:57:06,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026888939] [2024-11-20 08:57:06,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:57:06,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 08:57:06,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:57:06,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 08:57:06,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-20 08:57:06,375 INFO L87 Difference]: Start difference. First operand 490 states and 682 transitions. Second operand has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 08:57:07,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:57:07,356 INFO L93 Difference]: Finished difference Result 832 states and 1152 transitions. [2024-11-20 08:57:07,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 08:57:07,357 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2024-11-20 08:57:07,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:57:07,360 INFO L225 Difference]: With dead ends: 832 [2024-11-20 08:57:07,361 INFO L226 Difference]: Without dead ends: 508 [2024-11-20 08:57:07,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-11-20 08:57:07,362 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 64 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 08:57:07,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 904 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 08:57:07,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2024-11-20 08:57:07,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 433. [2024-11-20 08:57:07,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 376 states have (on average 1.3404255319148937) internal successors, (504), 378 states have internal predecessors, (504), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-20 08:57:07,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 600 transitions. [2024-11-20 08:57:07,405 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 600 transitions. Word has length 134 [2024-11-20 08:57:07,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:57:07,406 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 600 transitions. [2024-11-20 08:57:07,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 08:57:07,407 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 600 transitions. [2024-11-20 08:57:07,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-20 08:57:07,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:57:07,409 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:57:07,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 08:57:07,409 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:57:07,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:57:07,409 INFO L85 PathProgramCache]: Analyzing trace with hash -967172345, now seen corresponding path program 1 times [2024-11-20 08:57:07,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:57:07,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925831351] [2024-11-20 08:57:07,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:57:07,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:57:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:09,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:57:09,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:09,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:57:09,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:09,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:57:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:09,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:57:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:09,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:57:09,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:09,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:57:09,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:09,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:57:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:09,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:57:09,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:09,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:57:09,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:09,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:57:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:09,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:57:09,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:09,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:57:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:09,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:57:09,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:09,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:57:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:09,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:57:09,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:09,034 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:57:09,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:57:09,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925831351] [2024-11-20 08:57:09,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925831351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:57:09,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:57:09,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 08:57:09,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303366013] [2024-11-20 08:57:09,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:57:09,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 08:57:09,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:57:09,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 08:57:09,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:57:09,037 INFO L87 Difference]: Start difference. First operand 433 states and 600 transitions. Second operand has 7 states, 5 states have (on average 12.4) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-20 08:57:09,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:57:09,955 INFO L93 Difference]: Finished difference Result 716 states and 993 transitions. [2024-11-20 08:57:09,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:57:09,955 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.4) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 134 [2024-11-20 08:57:09,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:57:09,960 INFO L225 Difference]: With dead ends: 716 [2024-11-20 08:57:09,960 INFO L226 Difference]: Without dead ends: 434 [2024-11-20 08:57:09,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:57:09,962 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 57 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 08:57:09,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 571 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 08:57:09,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-11-20 08:57:10,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 432. [2024-11-20 08:57:10,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 375 states have (on average 1.3386666666666667) internal successors, (502), 377 states have internal predecessors, (502), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-20 08:57:10,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 598 transitions. [2024-11-20 08:57:10,013 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 598 transitions. Word has length 134 [2024-11-20 08:57:10,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:57:10,014 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 598 transitions. [2024-11-20 08:57:10,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.4) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-20 08:57:10,014 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 598 transitions. [2024-11-20 08:57:10,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-20 08:57:10,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:57:10,016 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:57:10,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 08:57:10,017 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:57:10,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:57:10,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1527688313, now seen corresponding path program 1 times [2024-11-20 08:57:10,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:57:10,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046911255] [2024-11-20 08:57:10,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:57:10,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:57:10,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:11,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:57:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:11,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:57:11,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:11,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:57:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:11,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:57:11,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:11,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:57:11,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:11,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:57:11,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:11,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:57:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:11,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:57:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:11,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:57:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:11,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:57:11,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:11,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:57:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:11,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:57:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:11,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:57:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:11,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:57:11,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:11,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:57:11,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:11,667 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:57:11,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:57:11,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046911255] [2024-11-20 08:57:11,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046911255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:57:11,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:57:11,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 08:57:11,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915544143] [2024-11-20 08:57:11,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:57:11,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 08:57:11,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:57:11,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 08:57:11,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:57:11,670 INFO L87 Difference]: Start difference. First operand 432 states and 598 transitions. Second operand has 7 states, 5 states have (on average 12.4) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-20 08:57:12,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:57:12,403 INFO L93 Difference]: Finished difference Result 827 states and 1143 transitions. [2024-11-20 08:57:12,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:57:12,404 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.4) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 134 [2024-11-20 08:57:12,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:57:12,407 INFO L225 Difference]: With dead ends: 827 [2024-11-20 08:57:12,407 INFO L226 Difference]: Without dead ends: 546 [2024-11-20 08:57:12,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:57:12,409 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 60 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 08:57:12,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 649 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 08:57:12,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2024-11-20 08:57:12,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 444. [2024-11-20 08:57:12,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 387 states have (on average 1.3436692506459949) internal successors, (520), 389 states have internal predecessors, (520), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-20 08:57:12,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 616 transitions. [2024-11-20 08:57:12,443 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 616 transitions. Word has length 134 [2024-11-20 08:57:12,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:57:12,446 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 616 transitions. [2024-11-20 08:57:12,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.4) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-20 08:57:12,447 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 616 transitions. [2024-11-20 08:57:12,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-20 08:57:12,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:57:12,448 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:57:12,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 08:57:12,448 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:57:12,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:57:12,449 INFO L85 PathProgramCache]: Analyzing trace with hash -826623735, now seen corresponding path program 1 times [2024-11-20 08:57:12,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:57:12,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180482637] [2024-11-20 08:57:12,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:57:12,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:57:12,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:14,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:57:14,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:14,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:57:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:14,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:57:14,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:14,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:57:14,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:14,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:57:14,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:14,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:57:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:14,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:57:14,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:14,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:57:14,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:14,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:57:14,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:14,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:57:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:14,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:57:14,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:14,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:57:14,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:14,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:57:14,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:14,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:57:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:14,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:57:14,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:14,516 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:57:14,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:57:14,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180482637] [2024-11-20 08:57:14,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180482637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:57:14,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:57:14,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-20 08:57:14,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505577590] [2024-11-20 08:57:14,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:57:14,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 08:57:14,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:57:14,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 08:57:14,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-20 08:57:14,518 INFO L87 Difference]: Start difference. First operand 444 states and 616 transitions. Second operand has 12 states, 10 states have (on average 6.2) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-20 08:57:16,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:57:16,024 INFO L93 Difference]: Finished difference Result 792 states and 1096 transitions. [2024-11-20 08:57:16,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 08:57:16,025 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.2) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 134 [2024-11-20 08:57:16,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:57:16,028 INFO L225 Difference]: With dead ends: 792 [2024-11-20 08:57:16,029 INFO L226 Difference]: Without dead ends: 480 [2024-11-20 08:57:16,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-11-20 08:57:16,031 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 61 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:57:16,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 1435 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 972 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-20 08:57:16,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2024-11-20 08:57:16,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 448. [2024-11-20 08:57:16,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 391 states have (on average 1.340153452685422) internal successors, (524), 393 states have internal predecessors, (524), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-20 08:57:16,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 620 transitions. [2024-11-20 08:57:16,067 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 620 transitions. Word has length 134 [2024-11-20 08:57:16,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:57:16,067 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 620 transitions. [2024-11-20 08:57:16,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.2) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-20 08:57:16,068 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 620 transitions. [2024-11-20 08:57:16,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-20 08:57:16,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:57:16,069 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:57:16,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 08:57:16,070 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:57:16,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:57:16,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1328811445, now seen corresponding path program 1 times [2024-11-20 08:57:16,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:57:16,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266037936] [2024-11-20 08:57:16,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:57:16,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:57:16,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:17,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:57:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:17,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:57:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:17,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:57:17,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:17,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:57:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:17,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:57:17,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:17,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:57:17,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:17,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:57:17,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:17,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:57:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:17,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:57:17,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:17,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:57:17,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:17,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:57:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:17,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:57:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:17,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:57:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:17,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:57:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:17,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:57:17,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:17,529 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:57:17,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:57:17,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266037936] [2024-11-20 08:57:17,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266037936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:57:17,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:57:17,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 08:57:17,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246796618] [2024-11-20 08:57:17,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:57:17,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 08:57:17,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:57:17,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 08:57:17,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:57:17,531 INFO L87 Difference]: Start difference. First operand 448 states and 620 transitions. Second operand has 7 states, 5 states have (on average 12.4) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-20 08:57:18,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:57:18,225 INFO L93 Difference]: Finished difference Result 879 states and 1214 transitions. [2024-11-20 08:57:18,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:57:18,226 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.4) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 134 [2024-11-20 08:57:18,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:57:18,229 INFO L225 Difference]: With dead ends: 879 [2024-11-20 08:57:18,229 INFO L226 Difference]: Without dead ends: 563 [2024-11-20 08:57:18,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:57:18,231 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 60 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 08:57:18,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 643 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 08:57:18,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2024-11-20 08:57:18,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 480. [2024-11-20 08:57:18,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 423 states have (on average 1.3451536643026005) internal successors, (569), 425 states have internal predecessors, (569), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-20 08:57:18,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 665 transitions. [2024-11-20 08:57:18,271 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 665 transitions. Word has length 134 [2024-11-20 08:57:18,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:57:18,271 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 665 transitions. [2024-11-20 08:57:18,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.4) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-20 08:57:18,271 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 665 transitions. [2024-11-20 08:57:18,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-20 08:57:18,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:57:18,274 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:57:18,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 08:57:18,274 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:57:18,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:57:18,274 INFO L85 PathProgramCache]: Analyzing trace with hash 2029876023, now seen corresponding path program 1 times [2024-11-20 08:57:18,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:57:18,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544253050] [2024-11-20 08:57:18,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:57:18,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:57:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:19,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:57:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:19,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:57:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:19,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:57:19,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:19,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:57:19,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:19,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:57:19,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:19,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:57:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:19,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:57:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:19,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:57:19,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:19,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:57:19,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:19,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:57:19,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:19,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:57:19,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:19,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:57:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:19,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:57:19,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:19,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:57:19,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:19,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:57:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:19,617 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:57:19,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:57:19,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544253050] [2024-11-20 08:57:19,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544253050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:57:19,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:57:19,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 08:57:19,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528853644] [2024-11-20 08:57:19,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:57:19,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 08:57:19,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:57:19,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 08:57:19,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-20 08:57:19,620 INFO L87 Difference]: Start difference. First operand 480 states and 665 transitions. Second operand has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 08:57:20,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:57:20,540 INFO L93 Difference]: Finished difference Result 864 states and 1194 transitions. [2024-11-20 08:57:20,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 08:57:20,541 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2024-11-20 08:57:20,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:57:20,544 INFO L225 Difference]: With dead ends: 864 [2024-11-20 08:57:20,544 INFO L226 Difference]: Without dead ends: 516 [2024-11-20 08:57:20,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-11-20 08:57:20,546 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 63 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 08:57:20,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 1161 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 08:57:20,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-11-20 08:57:20,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 481. [2024-11-20 08:57:20,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 424 states have (on average 1.3443396226415094) internal successors, (570), 426 states have internal predecessors, (570), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-20 08:57:20,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 666 transitions. [2024-11-20 08:57:20,580 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 666 transitions. Word has length 134 [2024-11-20 08:57:20,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:57:20,581 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 666 transitions. [2024-11-20 08:57:20,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 08:57:20,581 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 666 transitions. [2024-11-20 08:57:20,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-20 08:57:20,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:57:20,583 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:57:20,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 08:57:20,583 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:57:20,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:57:20,584 INFO L85 PathProgramCache]: Analyzing trace with hash 928381566, now seen corresponding path program 1 times [2024-11-20 08:57:20,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:57:20,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786338766] [2024-11-20 08:57:20,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:57:20,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:57:20,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:21,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:57:21,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:21,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:57:21,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:21,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:57:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:21,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:57:21,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:21,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:57:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:21,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:57:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:21,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:57:21,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:21,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:57:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:21,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:57:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:21,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:57:21,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:21,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:57:21,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:21,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:57:21,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:21,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:57:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:21,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:57:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:21,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:57:21,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:21,861 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:57:21,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:57:21,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786338766] [2024-11-20 08:57:21,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786338766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:57:21,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:57:21,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 08:57:21,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505533919] [2024-11-20 08:57:21,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:57:21,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 08:57:21,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:57:21,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 08:57:21,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:57:21,866 INFO L87 Difference]: Start difference. First operand 481 states and 666 transitions. Second operand has 7 states, 5 states have (on average 12.4) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-20 08:57:22,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:57:22,452 INFO L93 Difference]: Finished difference Result 865 states and 1194 transitions. [2024-11-20 08:57:22,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:57:22,453 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.4) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 134 [2024-11-20 08:57:22,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:57:22,456 INFO L225 Difference]: With dead ends: 865 [2024-11-20 08:57:22,456 INFO L226 Difference]: Without dead ends: 516 [2024-11-20 08:57:22,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:57:22,458 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 59 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 08:57:22,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 641 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 08:57:22,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-11-20 08:57:22,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 482. [2024-11-20 08:57:22,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 425 states have (on average 1.3435294117647059) internal successors, (571), 427 states have internal predecessors, (571), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-20 08:57:22,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 667 transitions. [2024-11-20 08:57:22,493 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 667 transitions. Word has length 134 [2024-11-20 08:57:22,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:57:22,494 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 667 transitions. [2024-11-20 08:57:22,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.4) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-20 08:57:22,494 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 667 transitions. [2024-11-20 08:57:22,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-20 08:57:22,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:57:22,496 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:57:22,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 08:57:22,496 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:57:22,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:57:22,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1629446144, now seen corresponding path program 1 times [2024-11-20 08:57:22,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:57:22,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208079524] [2024-11-20 08:57:22,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:57:22,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:57:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:23,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:57:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:23,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:57:23,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:23,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:57:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:23,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:57:23,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:23,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:57:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:23,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:57:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:23,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:57:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:23,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:57:23,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:23,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:57:23,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:23,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:57:23,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:23,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:57:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:23,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:57:23,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:23,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:57:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:23,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:57:23,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:23,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:57:23,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:23,513 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:57:23,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:57:23,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208079524] [2024-11-20 08:57:23,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208079524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:57:23,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:57:23,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 08:57:23,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030535071] [2024-11-20 08:57:23,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:57:23,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:57:23,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:57:23,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:57:23,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:57:23,517 INFO L87 Difference]: Start difference. First operand 482 states and 667 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 08:57:25,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:57:25,282 INFO L93 Difference]: Finished difference Result 851 states and 1176 transitions. [2024-11-20 08:57:25,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 08:57:25,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-20 08:57:25,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:57:25,286 INFO L225 Difference]: With dead ends: 851 [2024-11-20 08:57:25,286 INFO L226 Difference]: Without dead ends: 501 [2024-11-20 08:57:25,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:57:25,287 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 44 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-20 08:57:25,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 429 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-20 08:57:25,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2024-11-20 08:57:25,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 477. [2024-11-20 08:57:25,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 420 states have (on average 1.3357142857142856) internal successors, (561), 422 states have internal predecessors, (561), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-20 08:57:25,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 657 transitions. [2024-11-20 08:57:25,323 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 657 transitions. Word has length 134 [2024-11-20 08:57:25,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:57:25,323 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 657 transitions. [2024-11-20 08:57:25,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 08:57:25,323 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 657 transitions. [2024-11-20 08:57:25,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-20 08:57:25,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:57:25,325 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:57:25,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 08:57:25,326 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:57:25,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:57:25,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1188262835, now seen corresponding path program 1 times [2024-11-20 08:57:25,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:57:25,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188029979] [2024-11-20 08:57:25,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:57:25,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:57:25,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:26,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:57:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:26,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:57:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:26,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:57:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:26,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:57:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:26,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:57:26,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:26,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:57:26,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:26,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:57:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:26,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:57:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:26,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:57:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:26,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:57:26,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:26,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:57:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:26,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:57:26,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:26,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:57:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:26,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:57:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:26,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:57:26,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:26,938 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:57:26,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:57:26,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188029979] [2024-11-20 08:57:26,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188029979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:57:26,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:57:26,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 08:57:26,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970168867] [2024-11-20 08:57:26,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:57:26,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 08:57:26,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:57:26,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 08:57:26,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-20 08:57:26,941 INFO L87 Difference]: Start difference. First operand 477 states and 657 transitions. Second operand has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 08:57:27,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:57:27,872 INFO L93 Difference]: Finished difference Result 870 states and 1192 transitions. [2024-11-20 08:57:27,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 08:57:27,873 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2024-11-20 08:57:27,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:57:27,876 INFO L225 Difference]: With dead ends: 870 [2024-11-20 08:57:27,876 INFO L226 Difference]: Without dead ends: 525 [2024-11-20 08:57:27,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-11-20 08:57:27,877 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 64 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 08:57:27,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 1296 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 08:57:27,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2024-11-20 08:57:27,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 522. [2024-11-20 08:57:27,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 458 states have (on average 1.3231441048034935) internal successors, (606), 461 states have internal predecessors, (606), 53 states have call successors, (53), 10 states have call predecessors, (53), 10 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-20 08:57:27,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 712 transitions. [2024-11-20 08:57:27,936 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 712 transitions. Word has length 134 [2024-11-20 08:57:27,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:57:27,937 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 712 transitions. [2024-11-20 08:57:27,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 08:57:27,937 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 712 transitions. [2024-11-20 08:57:27,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-20 08:57:27,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:57:27,940 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:57:27,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 08:57:27,940 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:57:27,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:57:27,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1889327413, now seen corresponding path program 1 times [2024-11-20 08:57:27,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:57:27,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206313345] [2024-11-20 08:57:27,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:57:27,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:57:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:29,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:57:29,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:29,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:57:29,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:29,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:57:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:29,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:57:29,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:29,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:57:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:29,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:57:29,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:29,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:57:29,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:29,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:57:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:29,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:57:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:29,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:57:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:29,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:57:29,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:29,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:57:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:29,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:57:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:29,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:57:29,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:29,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:57:29,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:29,060 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:57:29,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:57:29,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206313345] [2024-11-20 08:57:29,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206313345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:57:29,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:57:29,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 08:57:29,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364897482] [2024-11-20 08:57:29,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:57:29,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 08:57:29,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:57:29,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 08:57:29,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:57:29,063 INFO L87 Difference]: Start difference. First operand 522 states and 712 transitions. Second operand has 7 states, 5 states have (on average 12.4) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-20 08:57:29,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:57:29,680 INFO L93 Difference]: Finished difference Result 914 states and 1243 transitions. [2024-11-20 08:57:29,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:57:29,681 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.4) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 134 [2024-11-20 08:57:29,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:57:29,685 INFO L225 Difference]: With dead ends: 914 [2024-11-20 08:57:29,685 INFO L226 Difference]: Without dead ends: 524 [2024-11-20 08:57:29,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:57:29,687 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 54 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 08:57:29,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 746 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 08:57:29,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2024-11-20 08:57:29,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 472. [2024-11-20 08:57:29,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 411 states have (on average 1.3236009732360097) internal successors, (544), 413 states have internal predecessors, (544), 50 states have call successors, (50), 10 states have call predecessors, (50), 10 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-20 08:57:29,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 644 transitions. [2024-11-20 08:57:29,724 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 644 transitions. Word has length 134 [2024-11-20 08:57:29,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:57:29,724 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 644 transitions. [2024-11-20 08:57:29,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.4) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-20 08:57:29,725 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 644 transitions. [2024-11-20 08:57:29,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-20 08:57:29,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:57:29,726 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:57:29,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-20 08:57:29,726 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:57:29,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:57:29,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1267279625, now seen corresponding path program 1 times [2024-11-20 08:57:29,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:57:29,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902455920] [2024-11-20 08:57:29,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:57:29,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:57:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:30,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:57:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:30,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:57:30,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:30,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:57:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:30,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:57:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:30,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:57:30,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:30,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:57:30,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:30,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:57:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:30,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:57:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:30,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:57:30,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:30,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:57:30,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:30,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:57:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:30,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:57:30,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:30,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:57:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:30,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:57:30,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:30,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:57:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:30,091 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:57:30,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:57:30,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902455920] [2024-11-20 08:57:30,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902455920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:57:30,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:57:30,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 08:57:30,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766366743] [2024-11-20 08:57:30,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:57:30,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:57:30,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:57:30,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:57:30,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:57:30,093 INFO L87 Difference]: Start difference. First operand 472 states and 644 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 08:57:30,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:57:30,703 INFO L93 Difference]: Finished difference Result 958 states and 1290 transitions. [2024-11-20 08:57:30,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 08:57:30,704 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2024-11-20 08:57:30,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:57:30,707 INFO L225 Difference]: With dead ends: 958 [2024-11-20 08:57:30,707 INFO L226 Difference]: Without dead ends: 598 [2024-11-20 08:57:30,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:57:30,709 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 38 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 08:57:30,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 529 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 08:57:30,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2024-11-20 08:57:30,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 490. [2024-11-20 08:57:30,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 429 states have (on average 1.324009324009324) internal successors, (568), 431 states have internal predecessors, (568), 50 states have call successors, (50), 10 states have call predecessors, (50), 10 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-20 08:57:30,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 668 transitions. [2024-11-20 08:57:30,747 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 668 transitions. Word has length 135 [2024-11-20 08:57:30,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:57:30,748 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 668 transitions. [2024-11-20 08:57:30,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 08:57:30,748 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 668 transitions. [2024-11-20 08:57:30,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-20 08:57:30,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:57:30,749 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:57:30,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-20 08:57:30,750 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:57:30,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:57:30,750 INFO L85 PathProgramCache]: Analyzing trace with hash 134424644, now seen corresponding path program 1 times [2024-11-20 08:57:30,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:57:30,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637229658] [2024-11-20 08:57:30,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:57:30,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:57:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:31,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:57:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:31,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:57:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:31,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:57:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:31,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:57:31,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:31,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:57:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:31,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:57:31,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:31,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:57:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:31,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:57:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:31,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:57:31,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:31,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:57:31,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:31,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:57:31,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:31,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:57:31,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:31,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:57:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:31,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:57:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:31,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:57:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:31,373 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:57:31,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:57:31,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637229658] [2024-11-20 08:57:31,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637229658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:57:31,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:57:31,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 08:57:31,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848997459] [2024-11-20 08:57:31,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:57:31,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 08:57:31,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:57:31,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 08:57:31,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:57:31,375 INFO L87 Difference]: Start difference. First operand 490 states and 668 transitions. Second operand has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 7 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 08:57:31,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:57:31,972 INFO L93 Difference]: Finished difference Result 869 states and 1181 transitions. [2024-11-20 08:57:31,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:57:31,973 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 7 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2024-11-20 08:57:31,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:57:31,976 INFO L225 Difference]: With dead ends: 869 [2024-11-20 08:57:31,976 INFO L226 Difference]: Without dead ends: 492 [2024-11-20 08:57:31,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:57:31,977 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 65 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 08:57:31,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 531 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 08:57:31,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2024-11-20 08:57:32,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 490. [2024-11-20 08:57:32,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 429 states have (on average 1.3193473193473193) internal successors, (566), 431 states have internal predecessors, (566), 50 states have call successors, (50), 10 states have call predecessors, (50), 10 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-20 08:57:32,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 666 transitions. [2024-11-20 08:57:32,024 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 666 transitions. Word has length 136 [2024-11-20 08:57:32,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:57:32,024 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 666 transitions. [2024-11-20 08:57:32,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 7 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 08:57:32,026 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 666 transitions. [2024-11-20 08:57:32,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-20 08:57:32,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:57:32,027 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:57:32,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-20 08:57:32,027 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:57:32,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:57:32,027 INFO L85 PathProgramCache]: Analyzing trace with hash 353279362, now seen corresponding path program 1 times [2024-11-20 08:57:32,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:57:32,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499827166] [2024-11-20 08:57:32,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:57:32,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:57:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:32,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:57:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:32,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:57:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:32,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:57:32,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:32,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:57:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:32,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:57:32,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:32,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:57:32,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:32,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:57:32,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:32,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:57:32,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:32,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:57:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:32,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:57:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:32,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:57:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:32,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:57:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:32,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:57:32,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:32,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:57:32,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:32,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:57:32,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:32,704 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:57:32,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:57:32,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499827166] [2024-11-20 08:57:32,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499827166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:57:32,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:57:32,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 08:57:32,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723238337] [2024-11-20 08:57:32,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:57:32,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:57:32,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:57:32,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:57:32,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:57:32,706 INFO L87 Difference]: Start difference. First operand 490 states and 666 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 08:57:33,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:57:33,086 INFO L93 Difference]: Finished difference Result 984 states and 1319 transitions. [2024-11-20 08:57:33,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 08:57:33,087 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 136 [2024-11-20 08:57:33,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:57:33,090 INFO L225 Difference]: With dead ends: 984 [2024-11-20 08:57:33,090 INFO L226 Difference]: Without dead ends: 604 [2024-11-20 08:57:33,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:57:33,092 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 38 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:57:33,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 421 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 08:57:33,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-11-20 08:57:33,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 478. [2024-11-20 08:57:33,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 417 states have (on average 1.314148681055156) internal successors, (548), 419 states have internal predecessors, (548), 50 states have call successors, (50), 10 states have call predecessors, (50), 10 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-20 08:57:33,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 648 transitions. [2024-11-20 08:57:33,133 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 648 transitions. Word has length 136 [2024-11-20 08:57:33,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:57:33,133 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 648 transitions. [2024-11-20 08:57:33,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 08:57:33,134 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 648 transitions. [2024-11-20 08:57:33,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-20 08:57:33,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:57:33,136 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:57:33,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-20 08:57:33,136 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:57:33,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:57:33,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1184010755, now seen corresponding path program 1 times [2024-11-20 08:57:33,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:57:33,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112639823] [2024-11-20 08:57:33,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:57:33,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:57:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:34,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:57:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:34,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:57:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:34,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:57:34,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:34,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:57:34,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:34,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:57:34,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:34,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:57:34,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:34,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:57:34,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:34,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:57:34,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:34,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:57:34,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:34,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:57:34,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:34,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:57:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:34,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:57:34,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:34,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:57:34,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:34,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:57:34,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:34,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:57:34,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:34,134 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:57:34,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:57:34,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112639823] [2024-11-20 08:57:34,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112639823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:57:34,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:57:34,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-20 08:57:34,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51231504] [2024-11-20 08:57:34,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:57:34,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 08:57:34,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:57:34,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 08:57:34,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-20 08:57:34,136 INFO L87 Difference]: Start difference. First operand 478 states and 648 transitions. Second operand has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 08:57:34,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:57:34,909 INFO L93 Difference]: Finished difference Result 493 states and 664 transitions. [2024-11-20 08:57:34,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 08:57:34,910 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 137 [2024-11-20 08:57:34,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:57:34,912 INFO L225 Difference]: With dead ends: 493 [2024-11-20 08:57:34,912 INFO L226 Difference]: Without dead ends: 491 [2024-11-20 08:57:34,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2024-11-20 08:57:34,914 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 105 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 08:57:34,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 936 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 08:57:34,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2024-11-20 08:57:34,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 362. [2024-11-20 08:57:34,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 325 states have (on average 1.3261538461538462) internal successors, (431), 325 states have internal predecessors, (431), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-20 08:57:34,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 491 transitions. [2024-11-20 08:57:34,943 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 491 transitions. Word has length 137 [2024-11-20 08:57:34,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:57:34,943 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 491 transitions. [2024-11-20 08:57:34,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 08:57:34,944 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 491 transitions. [2024-11-20 08:57:34,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-20 08:57:34,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:57:34,945 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:57:34,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-20 08:57:34,945 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:57:34,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:57:34,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1182163713, now seen corresponding path program 1 times [2024-11-20 08:57:34,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:57:34,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338809737] [2024-11-20 08:57:34,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:57:34,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:57:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:37,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:57:37,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:37,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:57:37,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:37,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:57:37,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:37,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:57:37,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:37,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:57:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:37,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:57:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:37,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:57:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:37,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:57:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:37,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:57:37,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:37,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:57:37,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:37,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:57:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:37,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:57:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:37,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:57:37,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:37,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:57:37,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:37,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:57:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:37,981 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:57:37,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:57:37,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338809737] [2024-11-20 08:57:37,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338809737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:57:37,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:57:37,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-20 08:57:37,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575616951] [2024-11-20 08:57:37,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:57:37,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 08:57:37,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:57:37,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 08:57:37,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-20 08:57:37,984 INFO L87 Difference]: Start difference. First operand 362 states and 491 transitions. Second operand has 14 states, 12 states have (on average 5.416666666666667) internal successors, (65), 14 states have internal predecessors, (65), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-20 08:57:39,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:57:39,419 INFO L93 Difference]: Finished difference Result 724 states and 968 transitions. [2024-11-20 08:57:39,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 08:57:39,420 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.416666666666667) internal successors, (65), 14 states have internal predecessors, (65), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 137 [2024-11-20 08:57:39,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:57:39,422 INFO L225 Difference]: With dead ends: 724 [2024-11-20 08:57:39,422 INFO L226 Difference]: Without dead ends: 496 [2024-11-20 08:57:39,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2024-11-20 08:57:39,424 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 164 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:57:39,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 1030 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 08:57:39,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-11-20 08:57:39,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 429. [2024-11-20 08:57:39,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 392 states have (on average 1.3239795918367347) internal successors, (519), 392 states have internal predecessors, (519), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-20 08:57:39,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 579 transitions. [2024-11-20 08:57:39,474 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 579 transitions. Word has length 137 [2024-11-20 08:57:39,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:57:39,474 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 579 transitions. [2024-11-20 08:57:39,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.416666666666667) internal successors, (65), 14 states have internal predecessors, (65), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-20 08:57:39,475 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 579 transitions. [2024-11-20 08:57:39,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-20 08:57:39,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:57:39,476 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:57:39,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-20 08:57:39,476 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:57:39,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:57:39,477 INFO L85 PathProgramCache]: Analyzing trace with hash -563381742, now seen corresponding path program 1 times [2024-11-20 08:57:39,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:57:39,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072807319] [2024-11-20 08:57:39,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:57:39,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:57:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:40,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:57:40,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:40,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:57:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:40,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:57:40,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:40,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:57:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:40,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:57:40,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:40,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:57:40,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:40,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:57:40,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:40,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:57:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:40,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:57:40,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:40,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:57:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:40,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:57:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:40,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:57:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:40,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:57:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:40,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:57:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:40,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:57:40,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:40,211 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:57:40,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:57:40,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072807319] [2024-11-20 08:57:40,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072807319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:57:40,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:57:40,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 08:57:40,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110242669] [2024-11-20 08:57:40,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:57:40,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 08:57:40,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:57:40,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 08:57:40,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:57:40,213 INFO L87 Difference]: Start difference. First operand 429 states and 579 transitions. Second operand has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 08:57:41,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:57:41,051 INFO L93 Difference]: Finished difference Result 831 states and 1116 transitions. [2024-11-20 08:57:41,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 08:57:41,051 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 137 [2024-11-20 08:57:41,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:57:41,054 INFO L225 Difference]: With dead ends: 831 [2024-11-20 08:57:41,054 INFO L226 Difference]: Without dead ends: 528 [2024-11-20 08:57:41,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-20 08:57:41,055 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 185 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 08:57:41,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 496 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 08:57:41,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-11-20 08:57:41,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 429. [2024-11-20 08:57:41,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 392 states have (on average 1.3137755102040816) internal successors, (515), 392 states have internal predecessors, (515), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-20 08:57:41,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 575 transitions. [2024-11-20 08:57:41,090 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 575 transitions. Word has length 137 [2024-11-20 08:57:41,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:57:41,091 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 575 transitions. [2024-11-20 08:57:41,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 08:57:41,091 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 575 transitions. [2024-11-20 08:57:41,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-20 08:57:41,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:57:41,092 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:57:41,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-20 08:57:41,092 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:57:41,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:57:41,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1381030192, now seen corresponding path program 1 times [2024-11-20 08:57:41,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:57:41,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244542290] [2024-11-20 08:57:41,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:57:41,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:57:41,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:42,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:57:42,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:42,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:57:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:42,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:57:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:42,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:57:42,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:42,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:57:42,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:42,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:57:42,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:42,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:57:42,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:42,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:57:42,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:42,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:57:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:42,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:57:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:42,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:57:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:42,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:57:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:42,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:57:42,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:42,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:57:42,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:42,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:57:42,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:57:42,285 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 08:57:42,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:57:42,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244542290] [2024-11-20 08:57:42,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244542290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:57:42,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:57:42,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-20 08:57:42,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407013246] [2024-11-20 08:57:42,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:57:42,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 08:57:42,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:57:42,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 08:57:42,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-11-20 08:57:42,288 INFO L87 Difference]: Start difference. First operand 429 states and 575 transitions. Second operand has 14 states, 13 states have (on average 5.0) internal successors, (65), 14 states have internal predecessors, (65), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15)