./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-sp_file-13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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-sp_file-13.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 51f066b986277b9680a73b6d055c2daa6e446ab9f6af3f7045f30460b8f2f21f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:55:19,697 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:55:19,752 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:55:19,764 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:55:19,766 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:55:19,787 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:55:19,787 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:55:19,788 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:55:19,788 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:55:19,789 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:55:19,789 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:55:19,789 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:55:19,790 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:55:19,791 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:55:19,792 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:55:19,792 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:55:19,793 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:55:19,793 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:55:19,793 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:55:19,793 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:55:19,794 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:55:19,797 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:55:19,798 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:55:19,798 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:55:19,798 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:55:19,798 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:55:19,798 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:55:19,798 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:55:19,799 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:55:19,799 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:55:19,799 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:55:19,799 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:55:19,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:55:19,799 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:55:19,800 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:55:19,800 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:55:19,800 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:55:19,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:55:19,800 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:55:19,800 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:55:19,801 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:55:19,802 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:55:19,802 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 -> 51f066b986277b9680a73b6d055c2daa6e446ab9f6af3f7045f30460b8f2f21f [2024-10-24 11:55:20,004 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:55:20,024 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:55:20,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:55:20,028 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:55:20,028 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:55:20,029 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-13.i [2024-10-24 11:55:21,272 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:55:21,419 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:55:21,420 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-13.i [2024-10-24 11:55:21,429 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f2ec40d0/557ef7b238484341b623366bbc0ade91/FLAG0fff49ffb [2024-10-24 11:55:21,440 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f2ec40d0/557ef7b238484341b623366bbc0ade91 [2024-10-24 11:55:21,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:55:21,443 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:55:21,444 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:55:21,445 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:55:21,448 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:55:21,449 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:55:21" (1/1) ... [2024-10-24 11:55:21,450 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41efd7af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:55:21, skipping insertion in model container [2024-10-24 11:55:21,450 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:55:21" (1/1) ... [2024-10-24 11:55:21,474 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:55:21,621 WARN L248 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-sp_file-13.i[917,930] [2024-10-24 11:55:21,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:55:21,687 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:55:21,697 WARN L248 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-sp_file-13.i[917,930] [2024-10-24 11:55:21,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:55:21,744 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:55:21,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:55:21 WrapperNode [2024-10-24 11:55:21,745 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:55:21,746 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:55:21,746 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:55:21,746 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:55:21,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:55:21" (1/1) ... [2024-10-24 11:55:21,762 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:55:21" (1/1) ... [2024-10-24 11:55:21,788 INFO L138 Inliner]: procedures = 29, calls = 142, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 480 [2024-10-24 11:55:21,788 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:55:21,789 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:55:21,789 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:55:21,789 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:55:21,802 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:55:21" (1/1) ... [2024-10-24 11:55:21,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:55:21" (1/1) ... [2024-10-24 11:55:21,807 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:55:21" (1/1) ... [2024-10-24 11:55:21,828 INFO L175 MemorySlicer]: Split 115 memory accesses to 2 slices as follows [2, 113]. 98 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 13]. The 15 writes are split as follows [0, 15]. [2024-10-24 11:55:21,829 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:55:21" (1/1) ... [2024-10-24 11:55:21,829 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:55:21" (1/1) ... [2024-10-24 11:55:21,845 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:55:21" (1/1) ... [2024-10-24 11:55:21,856 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:55:21" (1/1) ... [2024-10-24 11:55:21,857 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:55:21" (1/1) ... [2024-10-24 11:55:21,860 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:55:21" (1/1) ... [2024-10-24 11:55:21,867 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:55:21,872 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:55:21,872 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:55:21,873 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:55:21,873 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:55:21" (1/1) ... [2024-10-24 11:55:21,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:55:21,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:55:21,909 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-10-24 11:55:21,914 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-10-24 11:55:21,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:55:21,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:55:21,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:55:21,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:55:21,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:55:21,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:55:21,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:55:21,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:55:21,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:55:21,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:55:21,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:55:21,957 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:55:21,958 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:55:21,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:55:21,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:55:21,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:55:21,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:55:22,061 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:55:22,063 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:55:22,508 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2024-10-24 11:55:22,508 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:55:22,546 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:55:22,546 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:55:22,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:55:22 BoogieIcfgContainer [2024-10-24 11:55:22,547 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:55:22,549 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:55:22,549 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:55:22,552 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:55:22,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:55:21" (1/3) ... [2024-10-24 11:55:22,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b703662 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:55:22, skipping insertion in model container [2024-10-24 11:55:22,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:55:21" (2/3) ... [2024-10-24 11:55:22,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b703662 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:55:22, skipping insertion in model container [2024-10-24 11:55:22,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:55:22" (3/3) ... [2024-10-24 11:55:22,554 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-13.i [2024-10-24 11:55:22,567 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:55:22,567 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:55:22,616 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:55:22,621 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;@2b800625, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:55:22,622 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:55:22,625 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 87 states have (on average 1.4827586206896552) internal successors, (129), 88 states have internal predecessors, (129), 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-10-24 11:55:22,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-24 11:55:22,636 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:55:22,637 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] [2024-10-24 11:55:22,637 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:55:22,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:55:22,643 INFO L85 PathProgramCache]: Analyzing trace with hash 813961990, now seen corresponding path program 1 times [2024-10-24 11:55:22,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:55:22,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271700266] [2024-10-24 11:55:22,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:55:22,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:55:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:22,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:55:22,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:22,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:55:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:22,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:55:22,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:22,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:55:22,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:22,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:55:22,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:22,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:55:22,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:22,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:55:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:22,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:55:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:22,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:55:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:22,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:55:22,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:22,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:55:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:22,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:55:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:22,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:55:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:22,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:55:22,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:22,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:55:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:23,006 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:55:23,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:55:23,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271700266] [2024-10-24 11:55:23,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271700266] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:55:23,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:55:23,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:55:23,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247975495] [2024-10-24 11:55:23,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:55:23,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:55:23,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:55:23,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:55:23,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:55:23,037 INFO L87 Difference]: Start difference. First operand has 105 states, 87 states have (on average 1.4827586206896552) internal successors, (129), 88 states have internal predecessors, (129), 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 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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-10-24 11:55:23,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:55:23,076 INFO L93 Difference]: Finished difference Result 207 states and 331 transitions. [2024-10-24 11:55:23,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:55:23,078 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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 126 [2024-10-24 11:55:23,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:55:23,084 INFO L225 Difference]: With dead ends: 207 [2024-10-24 11:55:23,084 INFO L226 Difference]: Without dead ends: 103 [2024-10-24 11:55:23,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:55:23,090 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:55:23,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:55:23,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-24 11:55:23,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-24 11:55:23,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.441860465116279) internal successors, (124), 86 states have internal predecessors, (124), 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-10-24 11:55:23,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 154 transitions. [2024-10-24 11:55:23,131 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 154 transitions. Word has length 126 [2024-10-24 11:55:23,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:55:23,131 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 154 transitions. [2024-10-24 11:55:23,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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-10-24 11:55:23,131 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 154 transitions. [2024-10-24 11:55:23,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-24 11:55:23,134 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:55:23,135 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] [2024-10-24 11:55:23,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:55:23,135 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:55:23,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:55:23,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1375789232, now seen corresponding path program 1 times [2024-10-24 11:55:23,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:55:23,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298252969] [2024-10-24 11:55:23,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:55:23,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:55:23,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:23,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:55:23,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:23,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:55:23,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:23,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:55:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:23,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:55:23,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:23,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:55:23,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:23,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:55:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:23,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:55:23,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:23,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:55:23,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:23,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:55:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:23,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:55:23,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:23,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:55:23,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:23,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:55:23,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:23,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:55:23,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:23,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:55:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:23,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:55:23,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:23,523 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:55:23,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:55:23,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298252969] [2024-10-24 11:55:23,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298252969] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:55:23,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:55:23,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:55:23,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035275707] [2024-10-24 11:55:23,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:55:23,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:55:23,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:55:23,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:55:23,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:55:23,531 INFO L87 Difference]: Start difference. First operand 103 states and 154 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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-10-24 11:55:23,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:55:23,588 INFO L93 Difference]: Finished difference Result 207 states and 310 transitions. [2024-10-24 11:55:23,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:55:23,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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 126 [2024-10-24 11:55:23,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:55:23,594 INFO L225 Difference]: With dead ends: 207 [2024-10-24 11:55:23,594 INFO L226 Difference]: Without dead ends: 105 [2024-10-24 11:55:23,595 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-10-24 11:55:23,598 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:55:23,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 437 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:55:23,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-24 11:55:23,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-24 11:55:23,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.4318181818181819) internal successors, (126), 88 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-10-24 11:55:23,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 156 transitions. [2024-10-24 11:55:23,617 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 156 transitions. Word has length 126 [2024-10-24 11:55:23,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:55:23,618 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 156 transitions. [2024-10-24 11:55:23,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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-10-24 11:55:23,622 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 156 transitions. [2024-10-24 11:55:23,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-24 11:55:23,623 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:55:23,623 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] [2024-10-24 11:55:23,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:55:23,624 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:55:23,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:55:23,624 INFO L85 PathProgramCache]: Analyzing trace with hash 322245781, now seen corresponding path program 1 times [2024-10-24 11:55:23,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:55:23,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915763164] [2024-10-24 11:55:23,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:55:23,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:55:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:24,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:55:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:24,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:55:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:24,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:55:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:24,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:55:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:24,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:55:24,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:24,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:55:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:24,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:55:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:24,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:55:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:24,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:55:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:24,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:55:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:24,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:55:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:24,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:55:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:24,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:55:24,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:24,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:55:24,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:24,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:55:24,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:24,868 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:55:24,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:55:24,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915763164] [2024-10-24 11:55:24,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915763164] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:55:24,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:55:24,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:55:24,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330209622] [2024-10-24 11:55:24,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:55:24,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:55:24,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:55:24,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:55:24,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:55:24,871 INFO L87 Difference]: Start difference. First operand 105 states and 156 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:55:25,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:55:25,130 INFO L93 Difference]: Finished difference Result 273 states and 407 transitions. [2024-10-24 11:55:25,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:55:25,131 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 128 [2024-10-24 11:55:25,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:55:25,133 INFO L225 Difference]: With dead ends: 273 [2024-10-24 11:55:25,133 INFO L226 Difference]: Without dead ends: 169 [2024-10-24 11:55:25,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:55:25,135 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 53 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:55:25,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 412 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:55:25,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-24 11:55:25,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2024-10-24 11:55:25,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 133 states have (on average 1.3984962406015038) internal successors, (186), 133 states have internal predecessors, (186), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 11:55:25,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 246 transitions. [2024-10-24 11:55:25,155 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 246 transitions. Word has length 128 [2024-10-24 11:55:25,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:55:25,156 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 246 transitions. [2024-10-24 11:55:25,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:55:25,157 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 246 transitions. [2024-10-24 11:55:25,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-24 11:55:25,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:55:25,158 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] [2024-10-24 11:55:25,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:55:25,159 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:55:25,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:55:25,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1366697961, now seen corresponding path program 1 times [2024-10-24 11:55:25,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:55:25,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757259069] [2024-10-24 11:55:25,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:55:25,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:55:25,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:25,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:55:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:25,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:55:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:25,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:55:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:25,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:55:25,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:25,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:55:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:25,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:55:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:25,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:55:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:25,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:55:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:25,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:55:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:25,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:55:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:25,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:55:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:25,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:55:25,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:25,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:55:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:25,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:55:25,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:25,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:55:25,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:25,463 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:55:25,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:55:25,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757259069] [2024-10-24 11:55:25,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757259069] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:55:25,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:55:25,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:55:25,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916364714] [2024-10-24 11:55:25,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:55:25,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:55:25,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:55:25,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:55:25,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:55:25,465 INFO L87 Difference]: Start difference. First operand 166 states and 246 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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-10-24 11:55:25,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:55:25,559 INFO L93 Difference]: Finished difference Result 270 states and 401 transitions. [2024-10-24 11:55:25,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:55:25,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 128 [2024-10-24 11:55:25,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:55:25,562 INFO L225 Difference]: With dead ends: 270 [2024-10-24 11:55:25,562 INFO L226 Difference]: Without dead ends: 166 [2024-10-24 11:55:25,563 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-10-24 11:55:25,563 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 4 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:55:25,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 375 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:55:25,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-24 11:55:25,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2024-10-24 11:55:25,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 133 states have (on average 1.3909774436090225) internal successors, (185), 133 states have internal predecessors, (185), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 11:55:25,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 245 transitions. [2024-10-24 11:55:25,575 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 245 transitions. Word has length 128 [2024-10-24 11:55:25,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:55:25,576 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 245 transitions. [2024-10-24 11:55:25,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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-10-24 11:55:25,576 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 245 transitions. [2024-10-24 11:55:25,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-24 11:55:25,577 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:55:25,577 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] [2024-10-24 11:55:25,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:55:25,577 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:55:25,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:55:25,578 INFO L85 PathProgramCache]: Analyzing trace with hash -665633383, now seen corresponding path program 1 times [2024-10-24 11:55:25,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:55:25,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003105063] [2024-10-24 11:55:25,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:55:25,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:55:25,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:26,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:55:26,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:26,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:55:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:26,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:55:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:26,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:55:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:26,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:55:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:26,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:55:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:26,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:55:26,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:26,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:55:26,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:26,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:55:26,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:26,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:55:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:26,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:55:26,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:26,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:55:26,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:26,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:55:26,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:26,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:55:26,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:26,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:55:26,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:26,863 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:55:26,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:55:26,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003105063] [2024-10-24 11:55:26,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003105063] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:55:26,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:55:26,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 11:55:26,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054103018] [2024-10-24 11:55:26,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:55:26,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 11:55:26,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:55:26,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 11:55:26,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:55:26,866 INFO L87 Difference]: Start difference. First operand 166 states and 245 transitions. Second operand has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-24 11:55:27,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:55:27,319 INFO L93 Difference]: Finished difference Result 314 states and 463 transitions. [2024-10-24 11:55:27,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:55:27,320 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 128 [2024-10-24 11:55:27,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:55:27,323 INFO L225 Difference]: With dead ends: 314 [2024-10-24 11:55:27,323 INFO L226 Difference]: Without dead ends: 210 [2024-10-24 11:55:27,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:55:27,324 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 379 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:55:27,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 398 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:55:27,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-24 11:55:27,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 171. [2024-10-24 11:55:27,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 138 states have (on average 1.391304347826087) internal successors, (192), 138 states have internal predecessors, (192), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 11:55:27,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 252 transitions. [2024-10-24 11:55:27,345 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 252 transitions. Word has length 128 [2024-10-24 11:55:27,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:55:27,346 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 252 transitions. [2024-10-24 11:55:27,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-24 11:55:27,346 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 252 transitions. [2024-10-24 11:55:27,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-24 11:55:27,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:55:27,347 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] [2024-10-24 11:55:27,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:55:27,347 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:55:27,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:55:27,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1686701737, now seen corresponding path program 1 times [2024-10-24 11:55:27,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:55:27,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199603818] [2024-10-24 11:55:27,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:55:27,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:55:27,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:27,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:55:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:27,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:55:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:27,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:55:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:27,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:55:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:27,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:55:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:27,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:55:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:27,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:55:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:27,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:55:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:27,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:55:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:27,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:55:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:27,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:55:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:27,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:55:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:27,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:55:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:27,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:55:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:27,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:55:27,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:27,583 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:55:27,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:55:27,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199603818] [2024-10-24 11:55:27,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199603818] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:55:27,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:55:27,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:55:27,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774777262] [2024-10-24 11:55:27,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:55:27,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:55:27,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:55:27,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:55:27,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:55:27,587 INFO L87 Difference]: Start difference. First operand 171 states and 252 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-10-24 11:55:27,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:55:27,718 INFO L93 Difference]: Finished difference Result 313 states and 461 transitions. [2024-10-24 11:55:27,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:55:27,719 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 128 [2024-10-24 11:55:27,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:55:27,720 INFO L225 Difference]: With dead ends: 313 [2024-10-24 11:55:27,721 INFO L226 Difference]: Without dead ends: 204 [2024-10-24 11:55:27,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:55:27,721 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 91 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:55:27,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 403 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:55:27,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-10-24 11:55:27,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 175. [2024-10-24 11:55:27,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 142 states have (on average 1.3943661971830985) internal successors, (198), 142 states have internal predecessors, (198), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 11:55:27,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 258 transitions. [2024-10-24 11:55:27,745 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 258 transitions. Word has length 128 [2024-10-24 11:55:27,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:55:27,746 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 258 transitions. [2024-10-24 11:55:27,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-10-24 11:55:27,747 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 258 transitions. [2024-10-24 11:55:27,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 11:55:27,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:55:27,748 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] [2024-10-24 11:55:27,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 11:55:27,749 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:55:27,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:55:27,750 INFO L85 PathProgramCache]: Analyzing trace with hash 625492444, now seen corresponding path program 1 times [2024-10-24 11:55:27,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:55:27,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026105357] [2024-10-24 11:55:27,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:55:27,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:55:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:27,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:55:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:27,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:55:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:27,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:55:27,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:27,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:55:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:27,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:55:27,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:27,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:55:27,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:27,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:55:27,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:27,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:55:27,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:27,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:55:27,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:27,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:55:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:27,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:55:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:27,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:55:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:27,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:55:27,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:27,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:55:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:27,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:55:27,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:27,912 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:55:27,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:55:27,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026105357] [2024-10-24 11:55:27,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026105357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:55:27,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:55:27,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:55:27,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114729782] [2024-10-24 11:55:27,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:55:27,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:55:27,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:55:27,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:55:27,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:55:27,917 INFO L87 Difference]: Start difference. First operand 175 states and 258 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-10-24 11:55:27,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:55:27,944 INFO L93 Difference]: Finished difference Result 286 states and 422 transitions. [2024-10-24 11:55:27,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:55:27,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 129 [2024-10-24 11:55:27,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:55:27,947 INFO L225 Difference]: With dead ends: 286 [2024-10-24 11:55:27,948 INFO L226 Difference]: Without dead ends: 173 [2024-10-24 11:55:27,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:55:27,949 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:55:27,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 284 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:55:27,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-10-24 11:55:27,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2024-10-24 11:55:27,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 140 states have (on average 1.3785714285714286) internal successors, (193), 140 states have internal predecessors, (193), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 11:55:27,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 253 transitions. [2024-10-24 11:55:27,967 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 253 transitions. Word has length 129 [2024-10-24 11:55:27,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:55:27,968 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 253 transitions. [2024-10-24 11:55:27,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-10-24 11:55:27,968 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 253 transitions. [2024-10-24 11:55:27,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 11:55:27,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:55:27,969 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] [2024-10-24 11:55:27,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 11:55:27,969 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:55:27,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:55:27,969 INFO L85 PathProgramCache]: Analyzing trace with hash 58019569, now seen corresponding path program 1 times [2024-10-24 11:55:27,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:55:27,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600073125] [2024-10-24 11:55:27,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:55:27,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:55:27,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:28,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:55:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:28,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:55:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:28,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:55:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:28,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:55:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:28,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:55:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:28,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:55:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:28,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:55:28,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:28,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:55:28,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:28,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:55:28,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:28,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:55:28,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:28,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:55:28,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:28,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:55:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:28,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:55:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:28,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:55:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:28,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:55:28,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:28,297 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:55:28,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:55:28,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600073125] [2024-10-24 11:55:28,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600073125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:55:28,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:55:28,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:55:28,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644419587] [2024-10-24 11:55:28,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:55:28,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:55:28,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:55:28,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:55:28,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:55:28,300 INFO L87 Difference]: Start difference. First operand 173 states and 253 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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-10-24 11:55:28,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:55:28,525 INFO L93 Difference]: Finished difference Result 332 states and 481 transitions. [2024-10-24 11:55:28,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:55:28,526 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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 129 [2024-10-24 11:55:28,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:55:28,527 INFO L225 Difference]: With dead ends: 332 [2024-10-24 11:55:28,528 INFO L226 Difference]: Without dead ends: 221 [2024-10-24 11:55:28,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:55:28,529 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 195 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:55:28,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 555 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:55:28,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-10-24 11:55:28,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 196. [2024-10-24 11:55:28,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 163 states have (on average 1.3680981595092025) internal successors, (223), 163 states have internal predecessors, (223), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 11:55:28,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 283 transitions. [2024-10-24 11:55:28,552 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 283 transitions. Word has length 129 [2024-10-24 11:55:28,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:55:28,552 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 283 transitions. [2024-10-24 11:55:28,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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-10-24 11:55:28,552 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 283 transitions. [2024-10-24 11:55:28,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 11:55:28,554 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:55:28,554 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] [2024-10-24 11:55:28,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 11:55:28,555 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:55:28,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:55:28,555 INFO L85 PathProgramCache]: Analyzing trace with hash 738077939, now seen corresponding path program 1 times [2024-10-24 11:55:28,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:55:28,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141199063] [2024-10-24 11:55:28,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:55:28,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:55:28,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:28,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:55:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:28,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:55:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:28,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:55:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:28,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:55:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:28,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:55:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:28,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:55:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:28,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:55:28,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:28,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:55:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:28,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:55:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:28,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:55:28,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:28,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:55:28,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:28,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:55:28,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:28,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:55:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:28,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:55:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:28,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:55:28,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:28,651 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:55:28,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:55:28,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141199063] [2024-10-24 11:55:28,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141199063] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:55:28,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:55:28,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:55:28,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630159683] [2024-10-24 11:55:28,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:55:28,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:55:28,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:55:28,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:55:28,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:55:28,653 INFO L87 Difference]: Start difference. First operand 196 states and 283 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-10-24 11:55:28,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:55:28,682 INFO L93 Difference]: Finished difference Result 332 states and 479 transitions. [2024-10-24 11:55:28,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:55:28,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 129 [2024-10-24 11:55:28,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:55:28,684 INFO L225 Difference]: With dead ends: 332 [2024-10-24 11:55:28,685 INFO L226 Difference]: Without dead ends: 198 [2024-10-24 11:55:28,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:55:28,685 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:55:28,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 283 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:55:28,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-10-24 11:55:28,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2024-10-24 11:55:28,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 165 states have (on average 1.3636363636363635) internal successors, (225), 165 states have internal predecessors, (225), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 11:55:28,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 285 transitions. [2024-10-24 11:55:28,705 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 285 transitions. Word has length 129 [2024-10-24 11:55:28,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:55:28,706 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 285 transitions. [2024-10-24 11:55:28,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-10-24 11:55:28,706 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 285 transitions. [2024-10-24 11:55:28,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 11:55:28,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:55:28,707 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] [2024-10-24 11:55:28,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 11:55:28,707 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:55:28,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:55:28,708 INFO L85 PathProgramCache]: Analyzing trace with hash 345050929, now seen corresponding path program 1 times [2024-10-24 11:55:28,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:55:28,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874463091] [2024-10-24 11:55:28,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:55:28,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:55:28,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:29,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:55:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:29,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:55:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:29,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:55:29,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:29,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:55:29,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:29,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:55:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:29,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:55:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:29,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:55:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:29,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:55:29,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:29,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:55:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:29,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:55:29,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:29,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:55:29,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:29,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:55:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:29,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:55:29,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:29,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:55:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:29,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:55:29,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:29,568 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:55:29,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:55:29,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874463091] [2024-10-24 11:55:29,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874463091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:55:29,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:55:29,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:55:29,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358758701] [2024-10-24 11:55:29,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:55:29,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:55:29,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:55:29,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:55:29,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:55:29,570 INFO L87 Difference]: Start difference. First operand 198 states and 285 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 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-10-24 11:55:30,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:55:30,083 INFO L93 Difference]: Finished difference Result 432 states and 611 transitions. [2024-10-24 11:55:30,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 11:55:30,083 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 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 129 [2024-10-24 11:55:30,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:55:30,085 INFO L225 Difference]: With dead ends: 432 [2024-10-24 11:55:30,085 INFO L226 Difference]: Without dead ends: 296 [2024-10-24 11:55:30,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:55:30,086 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 274 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:55:30,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 507 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:55:30,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-10-24 11:55:30,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 216. [2024-10-24 11:55:30,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 183 states have (on average 1.360655737704918) internal successors, (249), 183 states have internal predecessors, (249), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 11:55:30,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 309 transitions. [2024-10-24 11:55:30,104 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 309 transitions. Word has length 129 [2024-10-24 11:55:30,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:55:30,104 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 309 transitions. [2024-10-24 11:55:30,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 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-10-24 11:55:30,105 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 309 transitions. [2024-10-24 11:55:30,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 11:55:30,105 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:55:30,105 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] [2024-10-24 11:55:30,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 11:55:30,106 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:55:30,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:55:30,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1630924173, now seen corresponding path program 1 times [2024-10-24 11:55:30,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:55:30,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573443300] [2024-10-24 11:55:30,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:55:30,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:55:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:30,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:55:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:30,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:55:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:30,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:55:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:30,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:55:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:30,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:55:30,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:30,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:55:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:30,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:55:30,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:30,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:55:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:30,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:55:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:30,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:55:30,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:30,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:55:30,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:30,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:55:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:30,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:55:30,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:30,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:55:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:30,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:55:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:30,942 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:55:30,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:55:30,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573443300] [2024-10-24 11:55:30,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573443300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:55:30,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:55:30,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:55:30,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387408584] [2024-10-24 11:55:30,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:55:30,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:55:30,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:55:30,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:55:30,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:55:30,944 INFO L87 Difference]: Start difference. First operand 216 states and 309 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:55:31,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:55:31,172 INFO L93 Difference]: Finished difference Result 492 states and 701 transitions. [2024-10-24 11:55:31,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:55:31,173 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2024-10-24 11:55:31,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:55:31,174 INFO L225 Difference]: With dead ends: 492 [2024-10-24 11:55:31,174 INFO L226 Difference]: Without dead ends: 342 [2024-10-24 11:55:31,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:55:31,175 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 334 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:55:31,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 377 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:55:31,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-10-24 11:55:31,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 336. [2024-10-24 11:55:31,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 287 states have (on average 1.3519163763066202) internal successors, (388), 287 states have internal predecessors, (388), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-24 11:55:31,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 478 transitions. [2024-10-24 11:55:31,198 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 478 transitions. Word has length 129 [2024-10-24 11:55:31,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:55:31,200 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 478 transitions. [2024-10-24 11:55:31,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:55:31,201 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 478 transitions. [2024-10-24 11:55:31,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 11:55:31,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:55:31,202 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] [2024-10-24 11:55:31,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 11:55:31,202 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:55:31,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:55:31,202 INFO L85 PathProgramCache]: Analyzing trace with hash -2023951183, now seen corresponding path program 1 times [2024-10-24 11:55:31,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:55:31,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89018031] [2024-10-24 11:55:31,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:55:31,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:55:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:31,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:55:31,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:31,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:55:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:31,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:55:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:31,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:55:31,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:31,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:55:31,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:31,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:55:31,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:31,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:55:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:31,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:55:31,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:31,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:55:31,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:31,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:55:31,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:31,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:55:31,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:31,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:55:31,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:31,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:55:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:31,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:55:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:31,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:55:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:31,891 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:55:31,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:55:31,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89018031] [2024-10-24 11:55:31,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89018031] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:55:31,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:55:31,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:55:31,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197930553] [2024-10-24 11:55:31,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:55:31,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:55:31,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:55:31,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:55:31,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:55:31,894 INFO L87 Difference]: Start difference. First operand 336 states and 478 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 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-10-24 11:55:32,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:55:32,462 INFO L93 Difference]: Finished difference Result 750 states and 1057 transitions. [2024-10-24 11:55:32,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:55:32,463 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 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 129 [2024-10-24 11:55:32,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:55:32,465 INFO L225 Difference]: With dead ends: 750 [2024-10-24 11:55:32,465 INFO L226 Difference]: Without dead ends: 480 [2024-10-24 11:55:32,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:55:32,466 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 297 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:55:32,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 515 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:55:32,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2024-10-24 11:55:32,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 358. [2024-10-24 11:55:32,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 309 states have (on average 1.343042071197411) internal successors, (415), 309 states have internal predecessors, (415), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-24 11:55:32,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 505 transitions. [2024-10-24 11:55:32,501 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 505 transitions. Word has length 129 [2024-10-24 11:55:32,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:55:32,501 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 505 transitions. [2024-10-24 11:55:32,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 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-10-24 11:55:32,502 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 505 transitions. [2024-10-24 11:55:32,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 11:55:32,503 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:55:32,503 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] [2024-10-24 11:55:32,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 11:55:32,503 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:55:32,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:55:32,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1343892813, now seen corresponding path program 1 times [2024-10-24 11:55:32,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:55:32,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474628526] [2024-10-24 11:55:32,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:55:32,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:55:32,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:32,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:55:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:32,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:55:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:32,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:55:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:32,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:55:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:32,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:55:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:32,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:55:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:32,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:55:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:32,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:55:32,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:32,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:55:32,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:32,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:55:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:32,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:55:32,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:32,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:55:32,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:32,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:55:32,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:32,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:55:32,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:32,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:55:32,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:32,744 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:55:32,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:55:32,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474628526] [2024-10-24 11:55:32,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474628526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:55:32,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:55:32,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:55:32,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228881483] [2024-10-24 11:55:32,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:55:32,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:55:32,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:55:32,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:55:32,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:55:32,746 INFO L87 Difference]: Start difference. First operand 358 states and 505 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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-10-24 11:55:32,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:55:32,887 INFO L93 Difference]: Finished difference Result 713 states and 1003 transitions. [2024-10-24 11:55:32,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:55:32,888 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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 129 [2024-10-24 11:55:32,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:55:32,889 INFO L225 Difference]: With dead ends: 713 [2024-10-24 11:55:32,889 INFO L226 Difference]: Without dead ends: 421 [2024-10-24 11:55:32,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:55:32,891 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 45 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:55:32,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 763 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:55:32,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-10-24 11:55:32,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 368. [2024-10-24 11:55:32,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 319 states have (on average 1.3448275862068966) internal successors, (429), 319 states have internal predecessors, (429), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-24 11:55:32,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 519 transitions. [2024-10-24 11:55:32,912 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 519 transitions. Word has length 129 [2024-10-24 11:55:32,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:55:32,913 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 519 transitions. [2024-10-24 11:55:32,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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-10-24 11:55:32,914 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 519 transitions. [2024-10-24 11:55:32,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 11:55:32,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:55:32,915 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] [2024-10-24 11:55:32,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 11:55:32,915 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:55:32,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:55:32,915 INFO L85 PathProgramCache]: Analyzing trace with hash 211037423, now seen corresponding path program 1 times [2024-10-24 11:55:32,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:55:32,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876532383] [2024-10-24 11:55:32,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:55:32,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:55:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:33,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:55:33,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:33,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:55:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:33,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:55:33,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:33,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:55:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:33,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:55:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:33,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:55:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:33,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:55:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:33,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:55:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:33,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:55:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:33,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:55:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:33,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:55:33,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:33,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:55:33,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:33,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:55:33,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:33,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:55:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:33,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:55:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:33,954 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:55:33,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:55:33,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876532383] [2024-10-24 11:55:33,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876532383] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:55:33,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:55:33,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 11:55:33,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566495265] [2024-10-24 11:55:33,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:55:33,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:55:33,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:55:33,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:55:33,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:55:33,956 INFO L87 Difference]: Start difference. First operand 368 states and 519 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:55:34,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:55:34,772 INFO L93 Difference]: Finished difference Result 818 states and 1148 transitions. [2024-10-24 11:55:34,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:55:34,773 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2024-10-24 11:55:34,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:55:34,775 INFO L225 Difference]: With dead ends: 818 [2024-10-24 11:55:34,775 INFO L226 Difference]: Without dead ends: 516 [2024-10-24 11:55:34,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:55:34,776 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 325 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 11:55:34,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 759 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 11:55:34,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-10-24 11:55:34,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 484. [2024-10-24 11:55:34,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 419 states have (on average 1.3412887828162292) internal successors, (562), 419 states have internal predecessors, (562), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 11:55:34,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 682 transitions. [2024-10-24 11:55:34,810 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 682 transitions. Word has length 129 [2024-10-24 11:55:34,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:55:34,811 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 682 transitions. [2024-10-24 11:55:34,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:55:34,811 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 682 transitions. [2024-10-24 11:55:34,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 11:55:34,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:55:34,813 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] [2024-10-24 11:55:34,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 11:55:34,813 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:55:34,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:55:34,813 INFO L85 PathProgramCache]: Analyzing trace with hash 2137002607, now seen corresponding path program 1 times [2024-10-24 11:55:34,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:55:34,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583044633] [2024-10-24 11:55:34,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:55:34,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:55:34,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:35,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:55:35,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:35,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:55:35,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:35,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:55:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:35,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:55:35,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:35,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:55:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:35,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:55:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:35,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:55:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:35,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:55:36,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:36,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:55:36,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:36,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:55:36,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:36,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:55:36,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:36,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:55:36,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:36,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:55:36,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:36,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:55:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:36,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:55:36,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:36,029 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:55:36,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:55:36,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583044633] [2024-10-24 11:55:36,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583044633] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:55:36,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:55:36,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 11:55:36,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867846672] [2024-10-24 11:55:36,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:55:36,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:55:36,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:55:36,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:55:36,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:55:36,031 INFO L87 Difference]: Start difference. First operand 484 states and 682 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:55:36,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:55:36,631 INFO L93 Difference]: Finished difference Result 933 states and 1309 transitions. [2024-10-24 11:55:36,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:55:36,631 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2024-10-24 11:55:36,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:55:36,634 INFO L225 Difference]: With dead ends: 933 [2024-10-24 11:55:36,634 INFO L226 Difference]: Without dead ends: 515 [2024-10-24 11:55:36,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:55:36,635 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 302 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:55:36,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 675 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:55:36,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2024-10-24 11:55:36,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 484. [2024-10-24 11:55:36,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 419 states have (on average 1.3389021479713603) internal successors, (561), 419 states have internal predecessors, (561), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 11:55:36,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 681 transitions. [2024-10-24 11:55:36,661 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 681 transitions. Word has length 129 [2024-10-24 11:55:36,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:55:36,661 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 681 transitions. [2024-10-24 11:55:36,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:55:36,662 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 681 transitions. [2024-10-24 11:55:36,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-24 11:55:36,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:55:36,663 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-10-24 11:55:36,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 11:55:36,663 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:55:36,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:55:36,663 INFO L85 PathProgramCache]: Analyzing trace with hash 285886270, now seen corresponding path program 1 times [2024-10-24 11:55:36,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:55:36,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678779468] [2024-10-24 11:55:36,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:55:36,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:55:36,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:36,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:55:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:36,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:55:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:36,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:55:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:36,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:55:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:36,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:55:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:36,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:55:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:36,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:55:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:36,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:55:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:36,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:55:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:36,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:55:36,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:36,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:55:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:36,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:55:36,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:36,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:55:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:36,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:55:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:36,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:55:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:37,003 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:55:37,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:55:37,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678779468] [2024-10-24 11:55:37,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678779468] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:55:37,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:55:37,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:55:37,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362782604] [2024-10-24 11:55:37,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:55:37,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:55:37,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:55:37,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:55:37,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:55:37,004 INFO L87 Difference]: Start difference. First operand 484 states and 681 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:55:37,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:55:37,316 INFO L93 Difference]: Finished difference Result 699 states and 983 transitions. [2024-10-24 11:55:37,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:55:37,317 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2024-10-24 11:55:37,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:55:37,319 INFO L225 Difference]: With dead ends: 699 [2024-10-24 11:55:37,319 INFO L226 Difference]: Without dead ends: 528 [2024-10-24 11:55:37,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:55:37,321 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 183 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:55:37,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 385 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:55:37,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-10-24 11:55:37,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 488. [2024-10-24 11:55:37,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 423 states have (on average 1.3380614657210401) internal successors, (566), 423 states have internal predecessors, (566), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 11:55:37,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 686 transitions. [2024-10-24 11:55:37,351 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 686 transitions. Word has length 130 [2024-10-24 11:55:37,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:55:37,351 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 686 transitions. [2024-10-24 11:55:37,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:55:37,351 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 686 transitions. [2024-10-24 11:55:37,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-24 11:55:37,352 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:55:37,352 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-10-24 11:55:37,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 11:55:37,352 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:55:37,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:55:37,353 INFO L85 PathProgramCache]: Analyzing trace with hash -368392750, now seen corresponding path program 1 times [2024-10-24 11:55:37,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:55:37,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971392476] [2024-10-24 11:55:37,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:55:37,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:55:37,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:37,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:55:37,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:37,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:55:37,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:37,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:55:37,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:37,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:55:37,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:37,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:55:37,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:37,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:55:37,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:37,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:55:37,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:37,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:55:37,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:37,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:55:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:37,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:55:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:37,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:55:37,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:37,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:55:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:37,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:55:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:37,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:55:37,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:37,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:55:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:37,591 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:55:37,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:55:37,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971392476] [2024-10-24 11:55:37,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971392476] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:55:37,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:55:37,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:55:37,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880927255] [2024-10-24 11:55:37,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:55:37,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:55:37,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:55:37,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:55:37,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:55:37,593 INFO L87 Difference]: Start difference. First operand 488 states and 686 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 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-10-24 11:55:37,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:55:37,754 INFO L93 Difference]: Finished difference Result 668 states and 940 transitions. [2024-10-24 11:55:37,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:55:37,754 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 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-10-24 11:55:37,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:55:37,756 INFO L225 Difference]: With dead ends: 668 [2024-10-24 11:55:37,757 INFO L226 Difference]: Without dead ends: 493 [2024-10-24 11:55:37,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:55:37,758 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 8 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:55:37,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 608 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:55:37,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2024-10-24 11:55:37,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 492. [2024-10-24 11:55:37,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 427 states have (on average 1.3372365339578454) internal successors, (571), 427 states have internal predecessors, (571), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 11:55:37,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 691 transitions. [2024-10-24 11:55:37,789 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 691 transitions. Word has length 130 [2024-10-24 11:55:37,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:55:37,790 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 691 transitions. [2024-10-24 11:55:37,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 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-10-24 11:55:37,790 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 691 transitions. [2024-10-24 11:55:37,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-24 11:55:37,791 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:55:37,791 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-10-24 11:55:37,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 11:55:37,791 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:55:37,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:55:37,792 INFO L85 PathProgramCache]: Analyzing trace with hash -2057336492, now seen corresponding path program 1 times [2024-10-24 11:55:37,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:55:37,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702118697] [2024-10-24 11:55:37,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:55:37,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:55:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:37,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:55:37,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:37,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:55:37,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:37,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:55:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:37,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:55:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:37,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:55:37,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:37,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:55:37,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:37,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:55:37,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:37,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:55:37,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:37,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:55:37,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:37,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:55:37,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:37,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:55:37,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:37,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:55:37,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:37,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:55:37,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:37,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:55:37,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:37,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:55:37,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:37,899 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:55:37,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:55:37,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702118697] [2024-10-24 11:55:37,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702118697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:55:37,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:55:37,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:55:37,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084252733] [2024-10-24 11:55:37,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:55:37,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:55:37,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:55:37,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:55:37,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:55:37,900 INFO L87 Difference]: Start difference. First operand 492 states and 691 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-10-24 11:55:37,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:55:37,932 INFO L93 Difference]: Finished difference Result 671 states and 942 transitions. [2024-10-24 11:55:37,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:55:37,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-10-24 11:55:37,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:55:37,934 INFO L225 Difference]: With dead ends: 671 [2024-10-24 11:55:37,934 INFO L226 Difference]: Without dead ends: 492 [2024-10-24 11:55:37,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:55:37,935 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:55:37,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 283 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:55:37,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2024-10-24 11:55:37,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 492. [2024-10-24 11:55:37,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 427 states have (on average 1.3325526932084308) internal successors, (569), 427 states have internal predecessors, (569), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 11:55:37,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 689 transitions. [2024-10-24 11:55:37,960 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 689 transitions. Word has length 130 [2024-10-24 11:55:37,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:55:37,961 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 689 transitions. [2024-10-24 11:55:37,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-10-24 11:55:37,961 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 689 transitions. [2024-10-24 11:55:37,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-24 11:55:37,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:55:37,962 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-10-24 11:55:37,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 11:55:37,963 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:55:37,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:55:37,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1838481774, now seen corresponding path program 1 times [2024-10-24 11:55:37,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:55:37,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567645991] [2024-10-24 11:55:37,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:55:37,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:55:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:38,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:55:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:38,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:55:38,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:38,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:55:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:38,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:55:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:38,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:55:38,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:38,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:55:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:38,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:55:38,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:38,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:55:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:38,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:55:38,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:38,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:55:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:38,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:55:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:38,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:55:38,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:38,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:55:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:38,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:55:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:38,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:55:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:38,786 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:55:38,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:55:38,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567645991] [2024-10-24 11:55:38,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567645991] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:55:38,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:55:38,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 11:55:38,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325998380] [2024-10-24 11:55:38,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:55:38,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 11:55:38,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:55:38,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 11:55:38,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:55:38,787 INFO L87 Difference]: Start difference. First operand 492 states and 689 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 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-10-24 11:55:39,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:55:39,607 INFO L93 Difference]: Finished difference Result 814 states and 1132 transitions. [2024-10-24 11:55:39,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 11:55:39,608 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 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-10-24 11:55:39,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:55:39,611 INFO L225 Difference]: With dead ends: 814 [2024-10-24 11:55:39,611 INFO L226 Difference]: Without dead ends: 635 [2024-10-24 11:55:39,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-24 11:55:39,612 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 267 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:55:39,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 1136 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:55:39,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-10-24 11:55:39,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 509. [2024-10-24 11:55:39,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 444 states have (on average 1.3355855855855856) internal successors, (593), 444 states have internal predecessors, (593), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 11:55:39,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 713 transitions. [2024-10-24 11:55:39,645 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 713 transitions. Word has length 130 [2024-10-24 11:55:39,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:55:39,645 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 713 transitions. [2024-10-24 11:55:39,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 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-10-24 11:55:39,646 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 713 transitions. [2024-10-24 11:55:39,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-24 11:55:39,646 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:55:39,646 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-10-24 11:55:39,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 11:55:39,647 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:55:39,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:55:39,647 INFO L85 PathProgramCache]: Analyzing trace with hash -8989422, now seen corresponding path program 1 times [2024-10-24 11:55:39,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:55:39,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124344297] [2024-10-24 11:55:39,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:55:39,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:55:39,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:40,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:55:40,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:40,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:55:40,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:40,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:55:40,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:40,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:55:40,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:40,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:55:40,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:40,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:55:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:40,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:55:40,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:40,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:55:40,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:40,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:55:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:40,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:55:40,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:40,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:55:40,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:40,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:55:40,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:40,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:55:40,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:40,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:55:40,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:40,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:55:40,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:40,714 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:55:40,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:55:40,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124344297] [2024-10-24 11:55:40,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124344297] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:55:40,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:55:40,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-24 11:55:40,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191105448] [2024-10-24 11:55:40,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:55:40,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 11:55:40,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:55:40,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 11:55:40,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-10-24 11:55:40,717 INFO L87 Difference]: Start difference. First operand 509 states and 713 transitions. Second operand has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:55:42,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:55:42,073 INFO L93 Difference]: Finished difference Result 824 states and 1147 transitions. [2024-10-24 11:55:42,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 11:55:42,074 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2024-10-24 11:55:42,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:55:42,076 INFO L225 Difference]: With dead ends: 824 [2024-10-24 11:55:42,076 INFO L226 Difference]: Without dead ends: 628 [2024-10-24 11:55:42,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=160, Invalid=652, Unknown=0, NotChecked=0, Total=812 [2024-10-24 11:55:42,077 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 344 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 1351 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 1371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 11:55:42,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 1080 Invalid, 1371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1351 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 11:55:42,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2024-10-24 11:55:42,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 509. [2024-10-24 11:55:42,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 444 states have (on average 1.3355855855855856) internal successors, (593), 444 states have internal predecessors, (593), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 11:55:42,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 713 transitions. [2024-10-24 11:55:42,109 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 713 transitions. Word has length 130 [2024-10-24 11:55:42,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:55:42,109 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 713 transitions. [2024-10-24 11:55:42,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:55:42,109 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 713 transitions. [2024-10-24 11:55:42,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-24 11:55:42,110 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:55:42,110 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-10-24 11:55:42,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 11:55:42,110 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:55:42,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:55:42,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1697933164, now seen corresponding path program 1 times [2024-10-24 11:55:42,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:55:42,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678084165] [2024-10-24 11:55:42,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:55:42,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:55:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:42,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:55:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:42,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:55:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:42,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:55:42,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:42,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:55:42,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:42,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:55:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:42,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:55:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:42,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:55:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:42,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:55:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:42,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:55:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:42,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:55:42,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:42,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:55:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:42,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:55:42,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:42,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:55:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:42,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:55:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:42,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:55:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:42,863 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:55:42,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:55:42,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678084165] [2024-10-24 11:55:42,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678084165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:55:42,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:55:42,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 11:55:42,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349428356] [2024-10-24 11:55:42,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:55:42,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 11:55:42,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:55:42,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 11:55:42,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:55:42,866 INFO L87 Difference]: Start difference. First operand 509 states and 713 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:55:43,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:55:43,756 INFO L93 Difference]: Finished difference Result 751 states and 1048 transitions. [2024-10-24 11:55:43,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 11:55:43,757 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2024-10-24 11:55:43,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:55:43,759 INFO L225 Difference]: With dead ends: 751 [2024-10-24 11:55:43,759 INFO L226 Difference]: Without dead ends: 555 [2024-10-24 11:55:43,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2024-10-24 11:55:43,760 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 168 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:55:43,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 890 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 11:55:43,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-10-24 11:55:43,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 488. [2024-10-24 11:55:43,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 423 states have (on average 1.33096926713948) internal successors, (563), 423 states have internal predecessors, (563), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 11:55:43,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 683 transitions. [2024-10-24 11:55:43,798 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 683 transitions. Word has length 130 [2024-10-24 11:55:43,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:55:43,799 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 683 transitions. [2024-10-24 11:55:43,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:55:43,799 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 683 transitions. [2024-10-24 11:55:43,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 11:55:43,800 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:55:43,800 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] [2024-10-24 11:55:43,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 11:55:43,800 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:55:43,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:55:43,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1078705642, now seen corresponding path program 1 times [2024-10-24 11:55:43,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:55:43,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026702932] [2024-10-24 11:55:43,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:55:43,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:55:43,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:44,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:55:44,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:44,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:55:44,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:44,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:55:44,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:44,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:55:44,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:44,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:55:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:44,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:55:44,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:44,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:55:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:44,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:55:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:44,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:55:44,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:44,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:55:44,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:44,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:55:44,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:44,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:55:44,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:44,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:55:44,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:44,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:55:44,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:44,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:55:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:44,174 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:55:44,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:55:44,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026702932] [2024-10-24 11:55:44,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026702932] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:55:44,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:55:44,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:55:44,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886071779] [2024-10-24 11:55:44,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:55:44,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:55:44,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:55:44,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:55:44,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:55:44,177 INFO L87 Difference]: Start difference. First operand 488 states and 683 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:55:44,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:55:44,500 INFO L93 Difference]: Finished difference Result 754 states and 1052 transitions. [2024-10-24 11:55:44,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:55:44,501 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2024-10-24 11:55:44,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:55:44,503 INFO L225 Difference]: With dead ends: 754 [2024-10-24 11:55:44,503 INFO L226 Difference]: Without dead ends: 579 [2024-10-24 11:55:44,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:55:44,503 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 209 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:55:44,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 477 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:55:44,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2024-10-24 11:55:44,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 498. [2024-10-24 11:55:44,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 433 states have (on average 1.3325635103926097) internal successors, (577), 433 states have internal predecessors, (577), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 11:55:44,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 697 transitions. [2024-10-24 11:55:44,538 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 697 transitions. Word has length 131 [2024-10-24 11:55:44,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:55:44,538 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 697 transitions. [2024-10-24 11:55:44,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:55:44,538 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 697 transitions. [2024-10-24 11:55:44,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 11:55:44,539 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:55:44,539 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] [2024-10-24 11:55:44,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 11:55:44,540 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:55:44,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:55:44,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1365737002, now seen corresponding path program 1 times [2024-10-24 11:55:44,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:55:44,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512522051] [2024-10-24 11:55:44,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:55:44,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:55:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:45,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:55:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:45,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:55:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:45,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:55:45,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:45,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:55:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:45,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:55:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:45,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:55:45,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:45,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:55:45,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:45,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:55:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:45,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:55:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:45,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:55:45,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:45,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:55:45,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:45,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:55:45,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:45,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:55:45,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:45,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:55:45,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:45,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:55:45,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:45,429 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:55:45,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:55:45,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512522051] [2024-10-24 11:55:45,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512522051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:55:45,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:55:45,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 11:55:45,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578959931] [2024-10-24 11:55:45,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:55:45,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:55:45,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:55:45,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:55:45,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:55:45,431 INFO L87 Difference]: Start difference. First operand 498 states and 697 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 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-10-24 11:55:45,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:55:45,915 INFO L93 Difference]: Finished difference Result 818 states and 1137 transitions. [2024-10-24 11:55:45,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 11:55:45,915 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 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 131 [2024-10-24 11:55:45,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:55:45,920 INFO L225 Difference]: With dead ends: 818 [2024-10-24 11:55:45,920 INFO L226 Difference]: Without dead ends: 633 [2024-10-24 11:55:45,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2024-10-24 11:55:45,921 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 304 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:55:45,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 493 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:55:45,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2024-10-24 11:55:45,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 500. [2024-10-24 11:55:45,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 435 states have (on average 1.3333333333333333) internal successors, (580), 435 states have internal predecessors, (580), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 11:55:45,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 700 transitions. [2024-10-24 11:55:45,957 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 700 transitions. Word has length 131 [2024-10-24 11:55:45,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:55:45,958 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 700 transitions. [2024-10-24 11:55:45,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 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-10-24 11:55:45,958 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 700 transitions. [2024-10-24 11:55:45,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 11:55:45,958 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:55:45,959 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] [2024-10-24 11:55:45,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-24 11:55:45,959 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:55:45,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:55:45,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1501407468, now seen corresponding path program 1 times [2024-10-24 11:55:45,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:55:45,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079337888] [2024-10-24 11:55:45,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:55:45,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:55:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:46,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:55:46,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:46,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:55:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:46,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:55:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:46,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:55:46,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:46,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:55:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:46,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:55:46,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:46,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:55:46,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:46,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:55:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:46,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:55:46,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:46,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:55:46,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:46,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:55:46,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:46,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:55:46,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:46,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:55:46,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:46,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:55:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:46,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:55:46,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:46,756 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:55:46,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:55:46,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079337888] [2024-10-24 11:55:46,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079337888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:55:46,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:55:46,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:55:46,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944061192] [2024-10-24 11:55:46,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:55:46,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:55:46,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:55:46,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:55:46,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:55:46,758 INFO L87 Difference]: Start difference. First operand 500 states and 700 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:55:47,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:55:47,019 INFO L93 Difference]: Finished difference Result 836 states and 1168 transitions. [2024-10-24 11:55:47,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:55:47,020 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2024-10-24 11:55:47,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:55:47,022 INFO L225 Difference]: With dead ends: 836 [2024-10-24 11:55:47,022 INFO L226 Difference]: Without dead ends: 649 [2024-10-24 11:55:47,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:55:47,023 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 180 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:55:47,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 464 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:55:47,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2024-10-24 11:55:47,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 512. [2024-10-24 11:55:47,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 447 states have (on average 1.3333333333333333) internal successors, (596), 447 states have internal predecessors, (596), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 11:55:47,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 716 transitions. [2024-10-24 11:55:47,069 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 716 transitions. Word has length 131 [2024-10-24 11:55:47,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:55:47,069 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 716 transitions. [2024-10-24 11:55:47,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:55:47,070 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 716 transitions. [2024-10-24 11:55:47,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 11:55:47,070 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:55:47,070 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] [2024-10-24 11:55:47,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-24 11:55:47,070 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:55:47,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:55:47,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1108380458, now seen corresponding path program 1 times [2024-10-24 11:55:47,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:55:47,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17871059] [2024-10-24 11:55:47,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:55:47,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:55:47,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:48,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:55:48,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:48,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:55:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:48,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:55:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:48,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:55:48,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:48,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:55:48,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:48,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:55:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:48,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:55:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:48,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:55:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:48,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:55:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:48,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:55:48,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:48,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:55:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:48,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:55:48,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:48,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:55:48,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:48,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:55:48,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:48,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:55:48,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:48,793 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:55:48,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:55:48,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17871059] [2024-10-24 11:55:48,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17871059] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:55:48,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:55:48,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 11:55:48,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257415802] [2024-10-24 11:55:48,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:55:48,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 11:55:48,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:55:48,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 11:55:48,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:55:48,795 INFO L87 Difference]: Start difference. First operand 512 states and 716 transitions. Second operand has 13 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-24 11:55:49,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:55:49,642 INFO L93 Difference]: Finished difference Result 984 states and 1366 transitions. [2024-10-24 11:55:49,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 11:55:49,643 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 131 [2024-10-24 11:55:49,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:55:49,645 INFO L225 Difference]: With dead ends: 984 [2024-10-24 11:55:49,645 INFO L226 Difference]: Without dead ends: 654 [2024-10-24 11:55:49,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2024-10-24 11:55:49,646 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 359 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:55:49,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 564 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:55:49,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2024-10-24 11:55:49,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 528. [2024-10-24 11:55:49,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 463 states have (on average 1.3282937365010798) internal successors, (615), 463 states have internal predecessors, (615), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 11:55:49,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 735 transitions. [2024-10-24 11:55:49,705 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 735 transitions. Word has length 131 [2024-10-24 11:55:49,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:55:49,706 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 735 transitions. [2024-10-24 11:55:49,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-24 11:55:49,708 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 735 transitions. [2024-10-24 11:55:49,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 11:55:49,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:55:49,709 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] [2024-10-24 11:55:49,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-24 11:55:49,709 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:55:49,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:55:49,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1788438828, now seen corresponding path program 1 times [2024-10-24 11:55:49,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:55:49,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302009950] [2024-10-24 11:55:49,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:55:49,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:55:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:50,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:55:50,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:50,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:55:50,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:50,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:55:50,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:50,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:55:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:50,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:55:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:50,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:55:50,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:50,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:55:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:50,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:55:50,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:50,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:55:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:50,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:55:50,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:50,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:55:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:50,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:55:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:50,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:55:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:50,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:55:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:50,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:55:50,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:50,039 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:55:50,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:55:50,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302009950] [2024-10-24 11:55:50,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302009950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:55:50,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:55:50,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:55:50,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462791517] [2024-10-24 11:55:50,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:55:50,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:55:50,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:55:50,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:55:50,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:55:50,042 INFO L87 Difference]: Start difference. First operand 528 states and 735 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 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-10-24 11:55:50,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:55:50,252 INFO L93 Difference]: Finished difference Result 951 states and 1319 transitions. [2024-10-24 11:55:50,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:55:50,253 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 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 131 [2024-10-24 11:55:50,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:55:50,255 INFO L225 Difference]: With dead ends: 951 [2024-10-24 11:55:50,255 INFO L226 Difference]: Without dead ends: 605 [2024-10-24 11:55:50,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:55:50,256 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 190 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:55:50,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 706 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:55:50,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-10-24 11:55:50,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 504. [2024-10-24 11:55:50,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 439 states have (on average 1.3371298405466971) internal successors, (587), 439 states have internal predecessors, (587), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 11:55:50,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 707 transitions. [2024-10-24 11:55:50,295 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 707 transitions. Word has length 131 [2024-10-24 11:55:50,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:55:50,295 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 707 transitions. [2024-10-24 11:55:50,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 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-10-24 11:55:50,295 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 707 transitions. [2024-10-24 11:55:50,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 11:55:50,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:55:50,296 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] [2024-10-24 11:55:50,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-24 11:55:50,296 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:55:50,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:55:50,297 INFO L85 PathProgramCache]: Analyzing trace with hash -65162922, now seen corresponding path program 1 times [2024-10-24 11:55:50,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:55:50,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645188477] [2024-10-24 11:55:50,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:55:50,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:55:50,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:50,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:55:50,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:50,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:55:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:50,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:55:50,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:50,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:55:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:50,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:55:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:50,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:55:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:50,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:55:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:50,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:55:50,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:50,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:55:50,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:50,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:55:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:50,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:55:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:50,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:55:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:50,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:55:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:50,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:55:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:50,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:55:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:50,412 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:55:50,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:55:50,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645188477] [2024-10-24 11:55:50,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645188477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:55:50,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:55:50,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:55:50,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445288866] [2024-10-24 11:55:50,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:55:50,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:55:50,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:55:50,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:55:50,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:55:50,413 INFO L87 Difference]: Start difference. First operand 504 states and 707 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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-10-24 11:55:50,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:55:50,536 INFO L93 Difference]: Finished difference Result 723 states and 1011 transitions. [2024-10-24 11:55:50,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:55:50,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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 131 [2024-10-24 11:55:50,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:55:50,539 INFO L225 Difference]: With dead ends: 723 [2024-10-24 11:55:50,539 INFO L226 Difference]: Without dead ends: 540 [2024-10-24 11:55:50,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:55:50,540 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 88 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:55:50,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 426 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:55:50,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2024-10-24 11:55:50,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 504. [2024-10-24 11:55:50,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 439 states have (on average 1.3325740318906605) internal successors, (585), 439 states have internal predecessors, (585), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 11:55:50,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 705 transitions. [2024-10-24 11:55:50,579 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 705 transitions. Word has length 131 [2024-10-24 11:55:50,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:55:50,579 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 705 transitions. [2024-10-24 11:55:50,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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-10-24 11:55:50,579 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 705 transitions. [2024-10-24 11:55:50,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 11:55:50,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:55:50,580 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] [2024-10-24 11:55:50,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-24 11:55:50,580 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:55:50,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:55:50,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1653510824, now seen corresponding path program 1 times [2024-10-24 11:55:50,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:55:50,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126986366] [2024-10-24 11:55:50,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:55:50,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:55:50,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:51,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:55:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:51,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:55:51,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:51,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:55:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:51,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:55:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:51,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:55:51,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:51,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:55:51,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:51,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:55:51,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:51,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:55:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:51,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:55:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:51,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:55:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:51,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:55:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:51,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:55:51,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:51,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:55:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:51,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:55:51,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:51,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:55:51,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:51,509 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:55:51,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:55:51,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126986366] [2024-10-24 11:55:51,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126986366] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:55:51,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:55:51,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 11:55:51,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315428200] [2024-10-24 11:55:51,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:55:51,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 11:55:51,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:55:51,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 11:55:51,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:55:51,510 INFO L87 Difference]: Start difference. First operand 504 states and 705 transitions. Second operand has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-24 11:55:51,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:55:51,941 INFO L93 Difference]: Finished difference Result 723 states and 1007 transitions. [2024-10-24 11:55:51,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:55:51,942 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 131 [2024-10-24 11:55:51,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:55:51,944 INFO L225 Difference]: With dead ends: 723 [2024-10-24 11:55:51,944 INFO L226 Difference]: Without dead ends: 540 [2024-10-24 11:55:51,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-24 11:55:51,945 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 164 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:55:51,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 467 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:55:51,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2024-10-24 11:55:51,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 504. [2024-10-24 11:55:51,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 439 states have (on average 1.328018223234624) internal successors, (583), 439 states have internal predecessors, (583), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 11:55:51,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 703 transitions. [2024-10-24 11:55:51,990 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 703 transitions. Word has length 131 [2024-10-24 11:55:51,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:55:51,990 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 703 transitions. [2024-10-24 11:55:51,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-24 11:55:51,991 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 703 transitions. [2024-10-24 11:55:51,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 11:55:51,991 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:55:51,991 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] [2024-10-24 11:55:51,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-24 11:55:51,991 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:55:51,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:55:51,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1427776616, now seen corresponding path program 1 times [2024-10-24 11:55:51,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:55:51,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754825278] [2024-10-24 11:55:51,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:55:51,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:55:52,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:52,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:55:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:52,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:55:52,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:52,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:55:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:52,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:55:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:52,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:55:52,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:52,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:55:52,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:52,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:55:52,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:52,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:55:52,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:52,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:55:52,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:52,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:55:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:52,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:55:52,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:52,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:55:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:52,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:55:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:52,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:55:52,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:52,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:55:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:52,625 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:55:52,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:55:52,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754825278] [2024-10-24 11:55:52,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754825278] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:55:52,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:55:52,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:55:52,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141999467] [2024-10-24 11:55:52,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:55:52,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:55:52,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:55:52,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:55:52,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:55:52,627 INFO L87 Difference]: Start difference. First operand 504 states and 703 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 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-10-24 11:55:53,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:55:53,195 INFO L93 Difference]: Finished difference Result 937 states and 1300 transitions. [2024-10-24 11:55:53,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:55:53,195 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 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 131 [2024-10-24 11:55:53,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:55:53,198 INFO L225 Difference]: With dead ends: 937 [2024-10-24 11:55:53,198 INFO L226 Difference]: Without dead ends: 615 [2024-10-24 11:55:53,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:55:53,199 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 194 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:55:53,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 539 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:55:53,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-10-24 11:55:53,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 523. [2024-10-24 11:55:53,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 458 states have (on average 1.3296943231441047) internal successors, (609), 458 states have internal predecessors, (609), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 11:55:53,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 729 transitions. [2024-10-24 11:55:53,239 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 729 transitions. Word has length 131 [2024-10-24 11:55:53,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:55:53,239 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 729 transitions. [2024-10-24 11:55:53,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 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-10-24 11:55:53,239 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 729 transitions. [2024-10-24 11:55:53,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 11:55:53,240 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:55:53,240 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] [2024-10-24 11:55:53,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-24 11:55:53,240 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:55:53,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:55:53,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1170420072, now seen corresponding path program 1 times [2024-10-24 11:55:53,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:55:53,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975080032] [2024-10-24 11:55:53,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:55:53,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:55:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:54,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:55:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:54,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:55:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:54,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:55:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:54,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:55:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:54,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:55:54,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:54,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:55:54,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:54,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:55:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:54,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:55:54,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:54,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:55:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:54,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:55:54,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:54,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:55:54,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:54,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:55:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:54,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:55:54,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:54,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:55:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:54,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:55:54,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:54,597 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:55:54,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:55:54,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975080032] [2024-10-24 11:55:54,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975080032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:55:54,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:55:54,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 11:55:54,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261748043] [2024-10-24 11:55:54,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:55:54,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 11:55:54,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:55:54,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 11:55:54,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:55:54,598 INFO L87 Difference]: Start difference. First operand 523 states and 729 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:55:55,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:55:55,409 INFO L93 Difference]: Finished difference Result 1034 states and 1436 transitions. [2024-10-24 11:55:55,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:55:55,410 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2024-10-24 11:55:55,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:55:55,413 INFO L225 Difference]: With dead ends: 1034 [2024-10-24 11:55:55,413 INFO L226 Difference]: Without dead ends: 693 [2024-10-24 11:55:55,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2024-10-24 11:55:55,414 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 265 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:55:55,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 841 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 11:55:55,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2024-10-24 11:55:55,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 529. [2024-10-24 11:55:55,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 464 states have (on average 1.331896551724138) internal successors, (618), 464 states have internal predecessors, (618), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 11:55:55,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 738 transitions. [2024-10-24 11:55:55,457 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 738 transitions. Word has length 131 [2024-10-24 11:55:55,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:55:55,457 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 738 transitions. [2024-10-24 11:55:55,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:55:55,457 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 738 transitions. [2024-10-24 11:55:55,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-24 11:55:55,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:55:55,458 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-10-24 11:55:55,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-24 11:55:55,458 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:55:55,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:55:55,458 INFO L85 PathProgramCache]: Analyzing trace with hash 454158777, now seen corresponding path program 1 times [2024-10-24 11:55:55,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:55:55,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171246772] [2024-10-24 11:55:55,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:55:55,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:55:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:56,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:55:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:56,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:55:56,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:56,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:55:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:56,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:55:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:56,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:55:56,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:56,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:55:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:56,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:55:56,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:56,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:55:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:56,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:55:56,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:56,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:55:56,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:56,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:55:56,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:56,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:55:56,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:56,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:55:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:56,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:55:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:56,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:55:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:56,297 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:55:56,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:55:56,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171246772] [2024-10-24 11:55:56,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171246772] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:55:56,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:55:56,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 11:55:56,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775543493] [2024-10-24 11:55:56,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:55:56,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 11:55:56,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:55:56,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 11:55:56,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:55:56,298 INFO L87 Difference]: Start difference. First operand 529 states and 738 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 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-10-24 11:55:56,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:55:56,850 INFO L93 Difference]: Finished difference Result 903 states and 1238 transitions. [2024-10-24 11:55:56,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 11:55:56,851 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 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-10-24 11:55:56,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:55:56,854 INFO L225 Difference]: With dead ends: 903 [2024-10-24 11:55:56,854 INFO L226 Difference]: Without dead ends: 702 [2024-10-24 11:55:56,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2024-10-24 11:55:56,855 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 222 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:55:56,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 1023 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:55:56,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2024-10-24 11:55:56,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 546. [2024-10-24 11:55:56,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 481 states have (on average 1.3347193347193347) internal successors, (642), 481 states have internal predecessors, (642), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 11:55:56,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 762 transitions. [2024-10-24 11:55:56,897 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 762 transitions. Word has length 132 [2024-10-24 11:55:56,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:55:56,898 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 762 transitions. [2024-10-24 11:55:56,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 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-10-24 11:55:56,898 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 762 transitions. [2024-10-24 11:55:56,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-24 11:55:56,898 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:55:56,899 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-10-24 11:55:56,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-24 11:55:56,899 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:55:56,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:55:56,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1954684985, now seen corresponding path program 1 times [2024-10-24 11:55:56,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:55:56,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275818074] [2024-10-24 11:55:56,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:55:56,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:55:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:57,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:55:57,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:57,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:55:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:57,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:55:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:57,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:55:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:57,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:55:57,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:57,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:55:57,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:57,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:55:57,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:57,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:55:57,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:57,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:55:57,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:57,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:55:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:57,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:55:57,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:57,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:55:57,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:57,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:55:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:57,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:55:57,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:57,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:55:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:57,848 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:55:57,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:55:57,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275818074] [2024-10-24 11:55:57,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275818074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:55:57,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:55:57,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-24 11:55:57,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599759290] [2024-10-24 11:55:57,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:55:57,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 11:55:57,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:55:57,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 11:55:57,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-10-24 11:55:57,849 INFO L87 Difference]: Start difference. First operand 546 states and 762 transitions. Second operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:55:59,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:55:59,022 INFO L93 Difference]: Finished difference Result 855 states and 1181 transitions. [2024-10-24 11:55:59,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 11:55:59,022 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 132 [2024-10-24 11:55:59,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:55:59,024 INFO L225 Difference]: With dead ends: 855 [2024-10-24 11:55:59,024 INFO L226 Difference]: Without dead ends: 637 [2024-10-24 11:55:59,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2024-10-24 11:55:59,025 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 399 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 1315 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 11:55:59,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 1051 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1315 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 11:55:59,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-10-24 11:55:59,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 542. [2024-10-24 11:55:59,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 477 states have (on average 1.3354297693920336) internal successors, (637), 477 states have internal predecessors, (637), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 11:55:59,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 757 transitions. [2024-10-24 11:55:59,110 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 757 transitions. Word has length 132 [2024-10-24 11:55:59,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:55:59,110 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 757 transitions. [2024-10-24 11:55:59,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:55:59,110 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 757 transitions. [2024-10-24 11:55:59,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-24 11:55:59,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:55:59,112 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-10-24 11:55:59,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-24 11:55:59,112 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:55:59,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:55:59,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1917580485, now seen corresponding path program 1 times [2024-10-24 11:55:59,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:55:59,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125629225] [2024-10-24 11:55:59,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:55:59,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:55:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:00,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:56:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:00,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:56:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:00,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:56:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:00,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:56:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:00,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:56:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:00,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:56:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:00,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:56:00,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:00,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:56:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:00,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:56:00,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:00,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:56:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:00,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:56:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:00,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:56:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:00,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:56:00,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:00,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:56:00,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:00,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:56:00,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:00,107 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:56:00,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:56:00,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125629225] [2024-10-24 11:56:00,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125629225] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:56:00,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:56:00,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 11:56:00,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827371145] [2024-10-24 11:56:00,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:56:00,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 11:56:00,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:56:00,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 11:56:00,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:56:00,109 INFO L87 Difference]: Start difference. First operand 542 states and 757 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:56:00,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:56:00,755 INFO L93 Difference]: Finished difference Result 795 states and 1104 transitions. [2024-10-24 11:56:00,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 11:56:00,755 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 132 [2024-10-24 11:56:00,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:56:00,757 INFO L225 Difference]: With dead ends: 795 [2024-10-24 11:56:00,757 INFO L226 Difference]: Without dead ends: 581 [2024-10-24 11:56:00,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2024-10-24 11:56:00,758 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 218 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:56:00,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 658 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:56:00,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2024-10-24 11:56:00,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 517. [2024-10-24 11:56:00,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 452 states have (on average 1.334070796460177) internal successors, (603), 452 states have internal predecessors, (603), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 11:56:00,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 723 transitions. [2024-10-24 11:56:00,796 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 723 transitions. Word has length 132 [2024-10-24 11:56:00,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:56:00,796 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 723 transitions. [2024-10-24 11:56:00,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:56:00,797 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 723 transitions. [2024-10-24 11:56:00,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 11:56:00,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:56:00,797 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] [2024-10-24 11:56:00,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-24 11:56:00,798 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:56:00,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:56:00,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1459924975, now seen corresponding path program 1 times [2024-10-24 11:56:00,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:56:00,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599922319] [2024-10-24 11:56:00,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:56:00,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:56:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:01,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:56:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:01,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:56:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:01,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:56:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:01,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:56:01,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:01,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:56:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:01,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:56:01,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:01,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:56:01,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:01,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:56:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:01,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:56:01,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:01,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:56:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:01,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:56:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:01,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:56:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:01,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:56:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:01,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:56:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:01,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:56:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:01,082 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:56:01,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:56:01,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599922319] [2024-10-24 11:56:01,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599922319] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:56:01,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:56:01,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 11:56:01,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300315305] [2024-10-24 11:56:01,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:56:01,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:56:01,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:56:01,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:56:01,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:56:01,083 INFO L87 Difference]: Start difference. First operand 517 states and 723 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 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-10-24 11:56:01,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:56:01,358 INFO L93 Difference]: Finished difference Result 761 states and 1055 transitions. [2024-10-24 11:56:01,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 11:56:01,358 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 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 133 [2024-10-24 11:56:01,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:56:01,360 INFO L225 Difference]: With dead ends: 761 [2024-10-24 11:56:01,360 INFO L226 Difference]: Without dead ends: 572 [2024-10-24 11:56:01,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:56:01,361 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 211 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:56:01,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 642 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:56:01,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2024-10-24 11:56:01,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 540. [2024-10-24 11:56:01,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 475 states have (on average 1.3242105263157895) internal successors, (629), 475 states have internal predecessors, (629), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 11:56:01,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 749 transitions. [2024-10-24 11:56:01,401 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 749 transitions. Word has length 133 [2024-10-24 11:56:01,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:56:01,402 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 749 transitions. [2024-10-24 11:56:01,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 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-10-24 11:56:01,402 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 749 transitions. [2024-10-24 11:56:01,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 11:56:01,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:56:01,403 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] [2024-10-24 11:56:01,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-24 11:56:01,403 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:56:01,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:56:01,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1852951985, now seen corresponding path program 1 times [2024-10-24 11:56:01,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:56:01,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846778496] [2024-10-24 11:56:01,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:56:01,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:56:01,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:03,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:56:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:03,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:56:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:03,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:56:03,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:03,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:56:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:03,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:56:03,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:03,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:56:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:03,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:56:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:03,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:56:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:03,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:56:03,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:03,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:56:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:03,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:56:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:03,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:56:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:03,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:56:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:03,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:56:03,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:03,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:56:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:03,382 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-24 11:56:03,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:56:03,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846778496] [2024-10-24 11:56:03,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846778496] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:56:03,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740095781] [2024-10-24 11:56:03,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:56:03,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:56:03,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:56:03,386 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-10-24 11:56:03,387 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-10-24 11:56:03,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:03,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-24 11:56:03,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:56:05,053 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 11 treesize of output 7 [2024-10-24 11:56:05,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 11:56:05,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-24 11:56:05,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 11:56:05,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 11:56:05,349 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-24 11:56:05,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2024-10-24 11:56:05,459 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:56:05,459 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:56:05,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740095781] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:56:05,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:56:05,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 20 [2024-10-24 11:56:05,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621376874] [2024-10-24 11:56:05,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:56:05,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:56:05,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:56:05,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:56:05,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2024-10-24 11:56:05,460 INFO L87 Difference]: Start difference. First operand 540 states and 749 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 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-10-24 11:56:05,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:56:05,955 INFO L93 Difference]: Finished difference Result 940 states and 1281 transitions. [2024-10-24 11:56:05,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:56:05,956 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 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 133 [2024-10-24 11:56:05,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:56:05,959 INFO L225 Difference]: With dead ends: 940 [2024-10-24 11:56:05,960 INFO L226 Difference]: Without dead ends: 728 [2024-10-24 11:56:05,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2024-10-24 11:56:05,962 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 220 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:56:05,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 580 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:56:05,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2024-10-24 11:56:06,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 540. [2024-10-24 11:56:06,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 475 states have (on average 1.3242105263157895) internal successors, (629), 475 states have internal predecessors, (629), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 11:56:06,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 749 transitions. [2024-10-24 11:56:06,011 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 749 transitions. Word has length 133 [2024-10-24 11:56:06,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:56:06,011 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 749 transitions. [2024-10-24 11:56:06,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 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-10-24 11:56:06,011 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 749 transitions. [2024-10-24 11:56:06,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 11:56:06,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:56:06,012 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] [2024-10-24 11:56:06,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 11:56:06,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-10-24 11:56:06,216 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:56:06,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:56:06,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1872079407, now seen corresponding path program 1 times [2024-10-24 11:56:06,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:56:06,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307240501] [2024-10-24 11:56:06,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:56:06,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:56:06,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:06,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:56:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:06,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:56:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:06,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:56:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:06,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:56:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:06,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:56:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:06,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:56:06,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:06,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:56:06,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:06,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:56:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:06,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:56:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:06,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:56:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:06,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:56:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:06,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:56:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:06,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:56:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:06,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:56:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:06,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:56:06,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:06,659 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:56:06,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:56:06,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307240501] [2024-10-24 11:56:06,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307240501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:56:06,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:56:06,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:56:06,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181898164] [2024-10-24 11:56:06,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:56:06,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:56:06,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:56:06,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:56:06,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:56:06,660 INFO L87 Difference]: Start difference. First operand 540 states and 749 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 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-10-24 11:56:06,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:56:06,968 INFO L93 Difference]: Finished difference Result 799 states and 1098 transitions. [2024-10-24 11:56:06,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:56:06,972 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 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 133 [2024-10-24 11:56:06,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:56:06,974 INFO L225 Difference]: With dead ends: 799 [2024-10-24 11:56:06,974 INFO L226 Difference]: Without dead ends: 587 [2024-10-24 11:56:06,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:56:06,974 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 154 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:56:06,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 687 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:56:06,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2024-10-24 11:56:07,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 553. [2024-10-24 11:56:07,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 488 states have (on average 1.3237704918032787) internal successors, (646), 488 states have internal predecessors, (646), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 11:56:07,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 766 transitions. [2024-10-24 11:56:07,025 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 766 transitions. Word has length 133 [2024-10-24 11:56:07,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:56:07,025 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 766 transitions. [2024-10-24 11:56:07,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 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-10-24 11:56:07,025 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 766 transitions. [2024-10-24 11:56:07,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 11:56:07,026 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:56:07,026 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] [2024-10-24 11:56:07,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-24 11:56:07,026 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:56:07,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:56:07,027 INFO L85 PathProgramCache]: Analyzing trace with hash 2029860879, now seen corresponding path program 1 times [2024-10-24 11:56:07,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:56:07,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672939987] [2024-10-24 11:56:07,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:56:07,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:56:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:07,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:56:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:07,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:56:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:07,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:56:07,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:07,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:56:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:07,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:56:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:07,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:56:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:07,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:56:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:07,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:56:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:07,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:56:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:07,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:56:07,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:07,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:56:07,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:07,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:56:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:07,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:56:07,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:07,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:56:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:07,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:56:07,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:07,249 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:56:07,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:56:07,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672939987] [2024-10-24 11:56:07,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672939987] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:56:07,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:56:07,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:56:07,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617108979] [2024-10-24 11:56:07,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:56:07,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:56:07,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:56:07,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:56:07,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:56:07,250 INFO L87 Difference]: Start difference. First operand 553 states and 766 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 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-10-24 11:56:07,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:56:07,436 INFO L93 Difference]: Finished difference Result 818 states and 1123 transitions. [2024-10-24 11:56:07,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:56:07,438 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 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 133 [2024-10-24 11:56:07,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:56:07,440 INFO L225 Difference]: With dead ends: 818 [2024-10-24 11:56:07,440 INFO L226 Difference]: Without dead ends: 593 [2024-10-24 11:56:07,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:56:07,441 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 218 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:56:07,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 417 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:56:07,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2024-10-24 11:56:07,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 545. [2024-10-24 11:56:07,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 480 states have (on average 1.31875) internal successors, (633), 480 states have internal predecessors, (633), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 11:56:07,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 753 transitions. [2024-10-24 11:56:07,486 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 753 transitions. Word has length 133 [2024-10-24 11:56:07,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:56:07,486 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 753 transitions. [2024-10-24 11:56:07,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 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-10-24 11:56:07,486 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 753 transitions. [2024-10-24 11:56:07,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 11:56:07,487 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:56:07,487 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] [2024-10-24 11:56:07,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-24 11:56:07,487 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:56:07,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:56:07,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1971044047, now seen corresponding path program 1 times [2024-10-24 11:56:07,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:56:07,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438550455] [2024-10-24 11:56:07,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:56:07,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:56:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:07,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:56:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:07,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:56:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:07,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:56:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:07,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:56:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:07,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:56:07,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:07,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:56:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:07,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:56:07,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:07,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:56:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:07,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:56:07,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:07,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:56:07,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:07,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:56:07,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:07,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:56:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:07,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:56:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:07,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:56:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:07,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:56:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:07,786 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:56:07,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:56:07,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438550455] [2024-10-24 11:56:07,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438550455] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:56:07,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:56:07,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:56:07,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314303084] [2024-10-24 11:56:07,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:56:07,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:56:07,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:56:07,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:56:07,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:56:07,787 INFO L87 Difference]: Start difference. First operand 545 states and 753 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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-10-24 11:56:07,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:56:07,998 INFO L93 Difference]: Finished difference Result 1137 states and 1547 transitions. [2024-10-24 11:56:07,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:56:07,999 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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 133 [2024-10-24 11:56:07,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:56:08,001 INFO L225 Difference]: With dead ends: 1137 [2024-10-24 11:56:08,001 INFO L226 Difference]: Without dead ends: 633 [2024-10-24 11:56:08,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:56:08,002 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 183 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:56:08,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 448 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:56:08,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2024-10-24 11:56:08,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 587. [2024-10-24 11:56:08,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 522 states have (on average 1.2950191570881227) internal successors, (676), 522 states have internal predecessors, (676), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 11:56:08,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 796 transitions. [2024-10-24 11:56:08,047 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 796 transitions. Word has length 133 [2024-10-24 11:56:08,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:56:08,047 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 796 transitions. [2024-10-24 11:56:08,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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-10-24 11:56:08,047 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 796 transitions. [2024-10-24 11:56:08,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 11:56:08,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:56:08,048 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] [2024-10-24 11:56:08,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-24 11:56:08,048 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:56:08,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:56:08,049 INFO L85 PathProgramCache]: Analyzing trace with hash 2106714513, now seen corresponding path program 1 times [2024-10-24 11:56:08,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:56:08,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006951578] [2024-10-24 11:56:08,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:56:08,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:56:08,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:08,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:56:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:08,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:56:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:08,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:56:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:08,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:56:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:08,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:56:08,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:08,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:56:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:08,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:56:08,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:08,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:56:08,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:08,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:56:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:08,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:56:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:08,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:56:08,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:08,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:56:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:08,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:56:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:08,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:56:08,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:08,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:56:08,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:08,099 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:56:08,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:56:08,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006951578] [2024-10-24 11:56:08,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006951578] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:56:08,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:56:08,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:56:08,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274369807] [2024-10-24 11:56:08,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:56:08,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:56:08,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:56:08,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:56:08,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:56:08,101 INFO L87 Difference]: Start difference. First operand 587 states and 796 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-10-24 11:56:08,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:56:08,156 INFO L93 Difference]: Finished difference Result 1075 states and 1460 transitions. [2024-10-24 11:56:08,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:56:08,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 133 [2024-10-24 11:56:08,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:56:08,158 INFO L225 Difference]: With dead ends: 1075 [2024-10-24 11:56:08,158 INFO L226 Difference]: Without dead ends: 554 [2024-10-24 11:56:08,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:56:08,160 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 280 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-10-24 11:56:08,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 280 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:56:08,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2024-10-24 11:56:08,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 552. [2024-10-24 11:56:08,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 487 states have (on average 1.297741273100616) internal successors, (632), 487 states have internal predecessors, (632), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 11:56:08,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 752 transitions. [2024-10-24 11:56:08,204 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 752 transitions. Word has length 133 [2024-10-24 11:56:08,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:56:08,204 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 752 transitions. [2024-10-24 11:56:08,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-10-24 11:56:08,204 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 752 transitions. [2024-10-24 11:56:08,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 11:56:08,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:56:08,205 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] [2024-10-24 11:56:08,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-24 11:56:08,205 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:56:08,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:56:08,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1969398065, now seen corresponding path program 1 times [2024-10-24 11:56:08,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:56:08,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585563921] [2024-10-24 11:56:08,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:56:08,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:56:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:08,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:56:08,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:08,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:56:08,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:08,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:56:08,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:08,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:56:08,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:08,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:56:08,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:08,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:56:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:08,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:56:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:08,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:56:08,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:08,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:56:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:08,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:56:08,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:08,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:56:08,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:08,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:56:08,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:08,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:56:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:08,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:56:08,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:08,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:56:08,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:08,596 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:56:08,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:56:08,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585563921] [2024-10-24 11:56:08,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585563921] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:56:08,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:56:08,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:56:08,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236848372] [2024-10-24 11:56:08,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:56:08,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:56:08,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:56:08,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:56:08,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:56:08,598 INFO L87 Difference]: Start difference. First operand 552 states and 752 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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-10-24 11:56:08,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:56:08,874 INFO L93 Difference]: Finished difference Result 911 states and 1214 transitions. [2024-10-24 11:56:08,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:56:08,874 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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 133 [2024-10-24 11:56:08,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:56:08,876 INFO L225 Difference]: With dead ends: 911 [2024-10-24 11:56:08,876 INFO L226 Difference]: Without dead ends: 686 [2024-10-24 11:56:08,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:56:08,878 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 245 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:56:08,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 387 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:56:08,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2024-10-24 11:56:08,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 558. [2024-10-24 11:56:08,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 493 states have (on average 1.2941176470588236) internal successors, (638), 493 states have internal predecessors, (638), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 11:56:08,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 758 transitions. [2024-10-24 11:56:08,925 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 758 transitions. Word has length 133 [2024-10-24 11:56:08,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:56:08,925 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 758 transitions. [2024-10-24 11:56:08,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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-10-24 11:56:08,925 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 758 transitions. [2024-10-24 11:56:08,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 11:56:08,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:56:08,926 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] [2024-10-24 11:56:08,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-24 11:56:08,926 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:56:08,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:56:08,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1932542221, now seen corresponding path program 1 times [2024-10-24 11:56:08,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:56:08,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640010234] [2024-10-24 11:56:08,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:56:08,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:56:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:09,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:56:09,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:09,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:56:09,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:09,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:56:09,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:09,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:56:09,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:09,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:56:09,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:09,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:56:09,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:09,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:56:09,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:09,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:56:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:09,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:56:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:09,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:56:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:09,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:56:09,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:09,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:56:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:09,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:56:09,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:09,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:56:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:09,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:56:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:09,632 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:56:09,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:56:09,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640010234] [2024-10-24 11:56:09,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640010234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:56:09,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:56:09,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 11:56:09,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117227664] [2024-10-24 11:56:09,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:56:09,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 11:56:09,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:56:09,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 11:56:09,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:56:09,633 INFO L87 Difference]: Start difference. First operand 558 states and 758 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:56:10,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:56:10,081 INFO L93 Difference]: Finished difference Result 860 states and 1147 transitions. [2024-10-24 11:56:10,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 11:56:10,082 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 133 [2024-10-24 11:56:10,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:56:10,084 INFO L225 Difference]: With dead ends: 860 [2024-10-24 11:56:10,084 INFO L226 Difference]: Without dead ends: 615 [2024-10-24 11:56:10,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:56:10,085 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 137 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:56:10,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 826 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:56:10,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-10-24 11:56:10,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 571. [2024-10-24 11:56:10,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 506 states have (on average 1.290513833992095) internal successors, (653), 506 states have internal predecessors, (653), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 11:56:10,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 773 transitions. [2024-10-24 11:56:10,131 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 773 transitions. Word has length 133 [2024-10-24 11:56:10,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:56:10,131 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 773 transitions. [2024-10-24 11:56:10,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:56:10,131 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 773 transitions. [2024-10-24 11:56:10,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-24 11:56:10,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:56:10,132 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-10-24 11:56:10,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-24 11:56:10,132 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:56:10,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:56:10,133 INFO L85 PathProgramCache]: Analyzing trace with hash 836258852, now seen corresponding path program 1 times [2024-10-24 11:56:10,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:56:10,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692929451] [2024-10-24 11:56:10,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:56:10,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:56:10,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:10,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:56:10,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:10,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:56:10,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:10,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:56:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:10,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:56:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:10,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:56:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:10,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:56:10,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:10,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:56:10,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:10,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:56:10,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:10,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:56:10,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:10,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:56:10,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:10,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:56:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:10,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:56:10,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:10,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:56:10,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:10,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:56:10,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:10,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:56:10,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:10,227 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:56:10,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:56:10,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692929451] [2024-10-24 11:56:10,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692929451] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:56:10,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:56:10,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:56:10,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928541015] [2024-10-24 11:56:10,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:56:10,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:56:10,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:56:10,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:56:10,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:56:10,228 INFO L87 Difference]: Start difference. First operand 571 states and 773 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-10-24 11:56:10,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:56:10,299 INFO L93 Difference]: Finished difference Result 1075 states and 1450 transitions. [2024-10-24 11:56:10,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:56:10,300 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-10-24 11:56:10,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:56:10,302 INFO L225 Difference]: With dead ends: 1075 [2024-10-24 11:56:10,302 INFO L226 Difference]: Without dead ends: 583 [2024-10-24 11:56:10,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:56:10,303 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:56:10,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 683 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:56:10,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2024-10-24 11:56:10,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2024-10-24 11:56:10,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 518 states have (on average 1.2837837837837838) internal successors, (665), 518 states have internal predecessors, (665), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 11:56:10,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 785 transitions. [2024-10-24 11:56:10,360 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 785 transitions. Word has length 134 [2024-10-24 11:56:10,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:56:10,361 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 785 transitions. [2024-10-24 11:56:10,361 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-10-24 11:56:10,361 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 785 transitions. [2024-10-24 11:56:10,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-24 11:56:10,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:56:10,362 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-10-24 11:56:10,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-24 11:56:10,362 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:56:10,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:56:10,362 INFO L85 PathProgramCache]: Analyzing trace with hash 694127510, now seen corresponding path program 1 times [2024-10-24 11:56:10,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:56:10,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295889622] [2024-10-24 11:56:10,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:56:10,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:56:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:10,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:56:10,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:10,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:56:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:10,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:56:10,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:10,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:56:10,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:10,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:56:10,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:10,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:56:10,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:10,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:56:10,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:10,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:56:10,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:10,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:56:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:10,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:56:10,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:10,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:56:10,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:10,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:56:10,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:10,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:56:10,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:10,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:56:10,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:10,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:56:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:10,428 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:56:10,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:56:10,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295889622] [2024-10-24 11:56:10,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295889622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:56:10,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:56:10,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:56:10,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600299275] [2024-10-24 11:56:10,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:56:10,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:56:10,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:56:10,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:56:10,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:56:10,432 INFO L87 Difference]: Start difference. First operand 583 states and 785 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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-10-24 11:56:10,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:56:10,499 INFO L93 Difference]: Finished difference Result 1081 states and 1450 transitions. [2024-10-24 11:56:10,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:56:10,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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-10-24 11:56:10,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:56:10,503 INFO L225 Difference]: With dead ends: 1081 [2024-10-24 11:56:10,503 INFO L226 Difference]: Without dead ends: 577 [2024-10-24 11:56:10,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:56:10,504 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:56:10,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 272 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:56:10,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2024-10-24 11:56:10,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2024-10-24 11:56:10,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 512 states have (on average 1.275390625) internal successors, (653), 512 states have internal predecessors, (653), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 11:56:10,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 773 transitions. [2024-10-24 11:56:10,556 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 773 transitions. Word has length 134 [2024-10-24 11:56:10,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:56:10,557 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 773 transitions. [2024-10-24 11:56:10,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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-10-24 11:56:10,557 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 773 transitions. [2024-10-24 11:56:10,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-24 11:56:10,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:56:10,558 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-10-24 11:56:10,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-10-24 11:56:10,558 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:56:10,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:56:10,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1698589000, now seen corresponding path program 1 times [2024-10-24 11:56:10,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:56:10,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94016362] [2024-10-24 11:56:10,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:56:10,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:56:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat