./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-ap_file-62.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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-ap_file-62.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 c9ea8f5132fafef47c5cde74633ce85a3773c3d65cff180ef26fe244a046ff77 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 13:37:24,260 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 13:37:24,333 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 13:37:24,337 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 13:37:24,338 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 13:37:24,378 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 13:37:24,378 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 13:37:24,379 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 13:37:24,379 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 13:37:24,380 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 13:37:24,380 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 13:37:24,381 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 13:37:24,390 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 13:37:24,391 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 13:37:24,391 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 13:37:24,393 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 13:37:24,393 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 13:37:24,393 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 13:37:24,393 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 13:37:24,394 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 13:37:24,394 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 13:37:24,398 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 13:37:24,398 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 13:37:24,398 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 13:37:24,398 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 13:37:24,398 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 13:37:24,398 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 13:37:24,399 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 13:37:24,399 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 13:37:24,399 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 13:37:24,399 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 13:37:24,399 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 13:37:24,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:37:24,400 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 13:37:24,400 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 13:37:24,400 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 13:37:24,400 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 13:37:24,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 13:37:24,400 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 13:37:24,400 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 13:37:24,401 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 13:37:24,401 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 13:37:24,401 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 -> c9ea8f5132fafef47c5cde74633ce85a3773c3d65cff180ef26fe244a046ff77 [2024-10-14 13:37:24,579 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 13:37:24,600 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 13:37:24,603 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 13:37:24,603 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 13:37:24,604 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 13:37:24,605 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-62.i [2024-10-14 13:37:25,886 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 13:37:26,039 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 13:37:26,039 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-62.i [2024-10-14 13:37:26,045 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a28cca50/8261f120c39d4b0cb4817db3d52297cb/FLAG3026f2805 [2024-10-14 13:37:26,439 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a28cca50/8261f120c39d4b0cb4817db3d52297cb [2024-10-14 13:37:26,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 13:37:26,442 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 13:37:26,443 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 13:37:26,443 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 13:37:26,447 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 13:37:26,447 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:37:26" (1/1) ... [2024-10-14 13:37:26,448 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dc6e411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:37:26, skipping insertion in model container [2024-10-14 13:37:26,448 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:37:26" (1/1) ... [2024-10-14 13:37:26,480 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 13:37:26,606 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-ap_file-62.i[917,930] [2024-10-14 13:37:26,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:37:26,656 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 13:37:26,666 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-ap_file-62.i[917,930] [2024-10-14 13:37:26,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:37:26,703 INFO L204 MainTranslator]: Completed translation [2024-10-14 13:37:26,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:37:26 WrapperNode [2024-10-14 13:37:26,704 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 13:37:26,705 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 13:37:26,705 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 13:37:26,705 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 13:37:26,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:37:26" (1/1) ... [2024-10-14 13:37:26,721 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:37:26" (1/1) ... [2024-10-14 13:37:26,751 INFO L138 Inliner]: procedures = 26, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 340 [2024-10-14 13:37:26,752 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 13:37:26,753 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 13:37:26,753 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 13:37:26,753 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 13:37:26,765 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:37:26" (1/1) ... [2024-10-14 13:37:26,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:37:26" (1/1) ... [2024-10-14 13:37:26,768 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:37:26" (1/1) ... [2024-10-14 13:37:26,801 INFO L175 MemorySlicer]: Split 87 memory accesses to 6 slices as follows [2, 10, 29, 26, 4, 16]. 33 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 3, 3, 1, 2]. The 14 writes are split as follows [0, 1, 4, 6, 1, 2]. [2024-10-14 13:37:26,801 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:37:26" (1/1) ... [2024-10-14 13:37:26,801 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:37:26" (1/1) ... [2024-10-14 13:37:26,810 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:37:26" (1/1) ... [2024-10-14 13:37:26,814 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:37:26" (1/1) ... [2024-10-14 13:37:26,816 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:37:26" (1/1) ... [2024-10-14 13:37:26,826 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:37:26" (1/1) ... [2024-10-14 13:37:26,829 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 13:37:26,830 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 13:37:26,830 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 13:37:26,830 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 13:37:26,831 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:37:26" (1/1) ... [2024-10-14 13:37:26,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:37:26,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:37:26,860 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-14 13:37:26,862 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-14 13:37:26,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 13:37:26,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 13:37:26,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 13:37:26,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 13:37:26,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-14 13:37:26,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-14 13:37:26,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-14 13:37:26,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 13:37:26,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 13:37:26,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 13:37:26,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-14 13:37:26,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-14 13:37:26,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-14 13:37:26,914 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 13:37:26,914 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 13:37:26,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 13:37:26,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 13:37:26,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 13:37:26,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 13:37:26,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-14 13:37:26,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-14 13:37:26,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 13:37:26,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 13:37:27,050 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 13:37:27,052 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 13:37:27,367 INFO L? ?]: Removed 71 outVars from TransFormulas that were not future-live. [2024-10-14 13:37:27,368 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 13:37:27,421 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 13:37:27,421 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 13:37:27,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:37:27 BoogieIcfgContainer [2024-10-14 13:37:27,422 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 13:37:27,424 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 13:37:27,424 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 13:37:27,428 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 13:37:27,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:37:26" (1/3) ... [2024-10-14 13:37:27,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a18af4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:37:27, skipping insertion in model container [2024-10-14 13:37:27,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:37:26" (2/3) ... [2024-10-14 13:37:27,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a18af4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:37:27, skipping insertion in model container [2024-10-14 13:37:27,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:37:27" (3/3) ... [2024-10-14 13:37:27,431 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-62.i [2024-10-14 13:37:27,449 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 13:37:27,449 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 13:37:27,510 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 13:37:27,515 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;@77a4eba2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 13:37:27,515 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 13:37:27,518 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 13:37:27,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 13:37:27,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:37:27,526 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:37:27,527 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:37:27,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:37:27,531 INFO L85 PathProgramCache]: Analyzing trace with hash 679761065, now seen corresponding path program 1 times [2024-10-14 13:37:27,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:37:27,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052170173] [2024-10-14 13:37:27,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:37:27,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:37:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:27,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:37:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:27,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:37:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:27,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:37:27,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:27,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:37:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:27,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:37:27,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:27,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:37:27,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:27,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:37:27,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:27,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:37:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:27,786 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:37:27,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:37:27,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052170173] [2024-10-14 13:37:27,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052170173] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:37:27,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:37:27,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 13:37:27,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193199174] [2024-10-14 13:37:27,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:37:27,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 13:37:27,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:37:27,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 13:37:27,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:37:27,813 INFO L87 Difference]: Start difference. First operand has 66 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 13:37:27,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:37:27,847 INFO L93 Difference]: Finished difference Result 129 states and 200 transitions. [2024-10-14 13:37:27,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 13:37:27,849 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 68 [2024-10-14 13:37:27,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:37:27,855 INFO L225 Difference]: With dead ends: 129 [2024-10-14 13:37:27,855 INFO L226 Difference]: Without dead ends: 64 [2024-10-14 13:37:27,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 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-14 13:37:27,861 INFO L432 NwaCegarLoop]: 88 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, 88 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-14 13:37:27,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:37:27,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-14 13:37:27,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-14 13:37:27,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 54 states have internal predecessors, (76), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 13:37:27,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 92 transitions. [2024-10-14 13:37:27,964 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 92 transitions. Word has length 68 [2024-10-14 13:37:27,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:37:27,965 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 92 transitions. [2024-10-14 13:37:27,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 13:37:27,965 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 92 transitions. [2024-10-14 13:37:27,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 13:37:27,967 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:37:27,967 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:37:27,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 13:37:27,968 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:37:27,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:37:27,973 INFO L85 PathProgramCache]: Analyzing trace with hash 619301017, now seen corresponding path program 1 times [2024-10-14 13:37:27,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:37:27,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346800156] [2024-10-14 13:37:27,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:37:27,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:37:28,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:28,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:37:28,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:28,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:37:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:28,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:37:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:28,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:37:28,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:28,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:37:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:28,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:37:28,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:28,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:37:28,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:28,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:37:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:28,183 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:37:28,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:37:28,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346800156] [2024-10-14 13:37:28,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346800156] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:37:28,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:37:28,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:37:28,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503400376] [2024-10-14 13:37:28,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:37:28,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:37:28,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:37:28,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:37:28,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:37:28,187 INFO L87 Difference]: Start difference. First operand 64 states and 92 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:28,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:37:28,218 INFO L93 Difference]: Finished difference Result 130 states and 187 transitions. [2024-10-14 13:37:28,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:37:28,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2024-10-14 13:37:28,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:37:28,220 INFO L225 Difference]: With dead ends: 130 [2024-10-14 13:37:28,220 INFO L226 Difference]: Without dead ends: 67 [2024-10-14 13:37:28,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 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-14 13:37:28,222 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 1 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:37:28,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 248 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:37:28,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-14 13:37:28,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2024-10-14 13:37:28,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 13:37:28,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 94 transitions. [2024-10-14 13:37:28,229 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 94 transitions. Word has length 68 [2024-10-14 13:37:28,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:37:28,230 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 94 transitions. [2024-10-14 13:37:28,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:28,230 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 94 transitions. [2024-10-14 13:37:28,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 13:37:28,232 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:37:28,232 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:37:28,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 13:37:28,232 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:37:28,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:37:28,233 INFO L85 PathProgramCache]: Analyzing trace with hash 676559319, now seen corresponding path program 1 times [2024-10-14 13:37:28,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:37:28,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920018035] [2024-10-14 13:37:28,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:37:28,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:37:28,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:28,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:37:28,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:28,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:37:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:28,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:37:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:28,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:37:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:28,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:37:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:28,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:37:28,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:28,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:37:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:28,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:37:28,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:28,383 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:37:28,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:37:28,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920018035] [2024-10-14 13:37:28,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920018035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:37:28,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:37:28,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:37:28,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921440359] [2024-10-14 13:37:28,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:37:28,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:37:28,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:37:28,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:37:28,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:37:28,385 INFO L87 Difference]: Start difference. First operand 66 states and 94 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:28,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:37:28,414 INFO L93 Difference]: Finished difference Result 134 states and 191 transitions. [2024-10-14 13:37:28,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:37:28,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2024-10-14 13:37:28,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:37:28,418 INFO L225 Difference]: With dead ends: 134 [2024-10-14 13:37:28,418 INFO L226 Difference]: Without dead ends: 69 [2024-10-14 13:37:28,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 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-14 13:37:28,420 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 1 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:37:28,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 252 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:37:28,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-14 13:37:28,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2024-10-14 13:37:28,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 58 states have internal predecessors, (80), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 13:37:28,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2024-10-14 13:37:28,432 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 96 transitions. Word has length 68 [2024-10-14 13:37:28,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:37:28,433 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 96 transitions. [2024-10-14 13:37:28,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:28,433 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 96 transitions. [2024-10-14 13:37:28,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 13:37:28,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:37:28,435 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:37:28,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 13:37:28,436 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:37:28,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:37:28,436 INFO L85 PathProgramCache]: Analyzing trace with hash 676618901, now seen corresponding path program 1 times [2024-10-14 13:37:28,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:37:28,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596882943] [2024-10-14 13:37:28,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:37:28,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:37:28,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:28,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:37:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:28,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:37:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:28,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:37:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:28,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:37:28,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:28,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:37:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:28,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:37:28,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:28,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:37:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:28,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:37:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:28,848 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:37:28,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:37:28,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596882943] [2024-10-14 13:37:28,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596882943] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:37:28,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:37:28,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:37:28,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297915414] [2024-10-14 13:37:28,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:37:28,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:37:28,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:37:28,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:37:28,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:37:28,852 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:29,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:37:29,049 INFO L93 Difference]: Finished difference Result 144 states and 201 transitions. [2024-10-14 13:37:29,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:37:29,050 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2024-10-14 13:37:29,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:37:29,051 INFO L225 Difference]: With dead ends: 144 [2024-10-14 13:37:29,051 INFO L226 Difference]: Without dead ends: 77 [2024-10-14 13:37:29,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:37:29,056 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 78 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:37:29,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 178 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:37:29,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-14 13:37:29,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2024-10-14 13:37:29,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 64 states have internal predecessors, (84), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 13:37:29,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2024-10-14 13:37:29,076 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 104 transitions. Word has length 68 [2024-10-14 13:37:29,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:37:29,076 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 104 transitions. [2024-10-14 13:37:29,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:29,077 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2024-10-14 13:37:29,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-14 13:37:29,080 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:37:29,080 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:37:29,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 13:37:29,081 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:37:29,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:37:29,081 INFO L85 PathProgramCache]: Analyzing trace with hash -707403974, now seen corresponding path program 1 times [2024-10-14 13:37:29,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:37:29,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262616684] [2024-10-14 13:37:29,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:37:29,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:37:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:29,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:37:29,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:29,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:37:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:29,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:37:29,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:29,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:37:29,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:29,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:37:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:29,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:37:29,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:29,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:37:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:29,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:37:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:29,242 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:37:29,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:37:29,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262616684] [2024-10-14 13:37:29,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262616684] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:37:29,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:37:29,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:37:29,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151491871] [2024-10-14 13:37:29,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:37:29,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:37:29,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:37:29,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:37:29,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:37:29,245 INFO L87 Difference]: Start difference. First operand 76 states and 104 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:29,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:37:29,429 INFO L93 Difference]: Finished difference Result 198 states and 269 transitions. [2024-10-14 13:37:29,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:37:29,429 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 70 [2024-10-14 13:37:29,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:37:29,432 INFO L225 Difference]: With dead ends: 198 [2024-10-14 13:37:29,432 INFO L226 Difference]: Without dead ends: 127 [2024-10-14 13:37:29,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 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-14 13:37:29,435 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 58 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:37:29,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 480 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:37:29,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-14 13:37:29,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 86. [2024-10-14 13:37:29,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 74 states have internal predecessors, (98), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 13:37:29,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 118 transitions. [2024-10-14 13:37:29,444 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 118 transitions. Word has length 70 [2024-10-14 13:37:29,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:37:29,444 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 118 transitions. [2024-10-14 13:37:29,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:29,445 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 118 transitions. [2024-10-14 13:37:29,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-14 13:37:29,445 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:37:29,446 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:37:29,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 13:37:29,446 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:37:29,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:37:29,446 INFO L85 PathProgramCache]: Analyzing trace with hash -746674476, now seen corresponding path program 1 times [2024-10-14 13:37:29,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:37:29,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497538846] [2024-10-14 13:37:29,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:37:29,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:37:29,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:29,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:37:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:29,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:37:29,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:29,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:37:29,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:29,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:37:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:29,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:37:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:29,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:37:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:29,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:37:29,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:29,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:37:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:29,614 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:37:29,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:37:29,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497538846] [2024-10-14 13:37:29,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497538846] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:37:29,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:37:29,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:37:29,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060612781] [2024-10-14 13:37:29,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:37:29,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:37:29,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:37:29,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:37:29,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:37:29,616 INFO L87 Difference]: Start difference. First operand 86 states and 118 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:29,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:37:29,671 INFO L93 Difference]: Finished difference Result 200 states and 273 transitions. [2024-10-14 13:37:29,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:37:29,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2024-10-14 13:37:29,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:37:29,673 INFO L225 Difference]: With dead ends: 200 [2024-10-14 13:37:29,673 INFO L226 Difference]: Without dead ends: 119 [2024-10-14 13:37:29,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:37:29,674 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 47 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:37:29,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 445 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:37:29,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-14 13:37:29,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 86. [2024-10-14 13:37:29,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 73 states have (on average 1.3287671232876712) internal successors, (97), 74 states have internal predecessors, (97), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 13:37:29,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 117 transitions. [2024-10-14 13:37:29,681 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 117 transitions. Word has length 72 [2024-10-14 13:37:29,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:37:29,681 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 117 transitions. [2024-10-14 13:37:29,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:29,682 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 117 transitions. [2024-10-14 13:37:29,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-14 13:37:29,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:37:29,682 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:37:29,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 13:37:29,683 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:37:29,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:37:29,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1499775503, now seen corresponding path program 1 times [2024-10-14 13:37:29,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:37:29,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282692221] [2024-10-14 13:37:29,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:37:29,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:37:29,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:29,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:37:29,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:29,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:37:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:29,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:37:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:29,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:37:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:29,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:37:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:29,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:37:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:29,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:37:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:29,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:37:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:29,777 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:37:29,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:37:29,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282692221] [2024-10-14 13:37:29,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282692221] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:37:29,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:37:29,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:37:29,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75329100] [2024-10-14 13:37:29,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:37:29,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:37:29,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:37:29,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:37:29,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:37:29,779 INFO L87 Difference]: Start difference. First operand 86 states and 117 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:29,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:37:29,804 INFO L93 Difference]: Finished difference Result 170 states and 231 transitions. [2024-10-14 13:37:29,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:37:29,806 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2024-10-14 13:37:29,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:37:29,807 INFO L225 Difference]: With dead ends: 170 [2024-10-14 13:37:29,807 INFO L226 Difference]: Without dead ends: 89 [2024-10-14 13:37:29,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:37:29,808 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:37:29,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 325 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:37:29,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-14 13:37:29,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-14 13:37:29,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 77 states have internal predecessors, (100), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 13:37:29,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2024-10-14 13:37:29,815 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 120 transitions. Word has length 72 [2024-10-14 13:37:29,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:37:29,815 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 120 transitions. [2024-10-14 13:37:29,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:29,816 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2024-10-14 13:37:29,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-14 13:37:29,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:37:29,817 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:37:29,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 13:37:29,818 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:37:29,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:37:29,818 INFO L85 PathProgramCache]: Analyzing trace with hash 300332512, now seen corresponding path program 1 times [2024-10-14 13:37:29,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:37:29,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577290851] [2024-10-14 13:37:29,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:37:29,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:37:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:29,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:37:29,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:29,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:37:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:29,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:37:29,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:29,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:37:29,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:29,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:37:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:29,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:37:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:29,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:37:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:29,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:37:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:29,961 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:37:29,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:37:29,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577290851] [2024-10-14 13:37:29,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577290851] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:37:29,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:37:29,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:37:29,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056147156] [2024-10-14 13:37:29,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:37:29,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:37:29,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:37:29,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:37:29,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:37:29,964 INFO L87 Difference]: Start difference. First operand 89 states and 120 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:30,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:37:30,017 INFO L93 Difference]: Finished difference Result 204 states and 273 transitions. [2024-10-14 13:37:30,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:37:30,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2024-10-14 13:37:30,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:37:30,019 INFO L225 Difference]: With dead ends: 204 [2024-10-14 13:37:30,019 INFO L226 Difference]: Without dead ends: 120 [2024-10-14 13:37:30,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:37:30,020 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 42 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:37:30,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 338 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:37:30,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-14 13:37:30,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 89. [2024-10-14 13:37:30,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 77 states have internal predecessors, (99), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 13:37:30,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 119 transitions. [2024-10-14 13:37:30,033 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 119 transitions. Word has length 72 [2024-10-14 13:37:30,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:37:30,033 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 119 transitions. [2024-10-14 13:37:30,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:30,034 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 119 transitions. [2024-10-14 13:37:30,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 13:37:30,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:37:30,037 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:37:30,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 13:37:30,037 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:37:30,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:37:30,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1216085754, now seen corresponding path program 1 times [2024-10-14 13:37:30,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:37:30,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416892325] [2024-10-14 13:37:30,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:37:30,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:37:30,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:30,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:37:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:30,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:37:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:30,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:37:30,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:30,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:37:30,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:30,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:37:30,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:30,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:37:30,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:30,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:37:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:30,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:37:30,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:30,764 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:37:30,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:37:30,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416892325] [2024-10-14 13:37:30,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416892325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:37:30,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:37:30,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 13:37:30,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269449180] [2024-10-14 13:37:30,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:37:30,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 13:37:30,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:37:30,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 13:37:30,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-14 13:37:30,767 INFO L87 Difference]: Start difference. First operand 89 states and 119 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:31,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:37:31,310 INFO L93 Difference]: Finished difference Result 229 states and 303 transitions. [2024-10-14 13:37:31,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 13:37:31,311 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 74 [2024-10-14 13:37:31,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:37:31,312 INFO L225 Difference]: With dead ends: 229 [2024-10-14 13:37:31,312 INFO L226 Difference]: Without dead ends: 145 [2024-10-14 13:37:31,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-10-14 13:37:31,313 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 142 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 13:37:31,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 809 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 13:37:31,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-14 13:37:31,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 99. [2024-10-14 13:37:31,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 86 states have (on average 1.313953488372093) internal successors, (113), 87 states have internal predecessors, (113), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 13:37:31,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 133 transitions. [2024-10-14 13:37:31,332 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 133 transitions. Word has length 74 [2024-10-14 13:37:31,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:37:31,332 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 133 transitions. [2024-10-14 13:37:31,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:31,332 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 133 transitions. [2024-10-14 13:37:31,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 13:37:31,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:37:31,333 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:37:31,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 13:37:31,333 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:37:31,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:37:31,334 INFO L85 PathProgramCache]: Analyzing trace with hash 204968504, now seen corresponding path program 1 times [2024-10-14 13:37:31,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:37:31,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434428954] [2024-10-14 13:37:31,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:37:31,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:37:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:31,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:37:31,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:31,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:37:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:31,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:37:31,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:31,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:37:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:31,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:37:31,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:31,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:37:31,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:31,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:37:31,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:31,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:37:31,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:31,550 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:37:31,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:37:31,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434428954] [2024-10-14 13:37:31,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434428954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:37:31,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:37:31,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 13:37:31,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852444327] [2024-10-14 13:37:31,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:37:31,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 13:37:31,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:37:31,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 13:37:31,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 13:37:31,553 INFO L87 Difference]: Start difference. First operand 99 states and 133 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:31,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:37:31,739 INFO L93 Difference]: Finished difference Result 239 states and 314 transitions. [2024-10-14 13:37:31,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 13:37:31,739 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 74 [2024-10-14 13:37:31,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:37:31,742 INFO L225 Difference]: With dead ends: 239 [2024-10-14 13:37:31,742 INFO L226 Difference]: Without dead ends: 145 [2024-10-14 13:37:31,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-14 13:37:31,743 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 125 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:37:31,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 433 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:37:31,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-14 13:37:31,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 95. [2024-10-14 13:37:31,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 13:37:31,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 126 transitions. [2024-10-14 13:37:31,757 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 126 transitions. Word has length 74 [2024-10-14 13:37:31,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:37:31,758 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 126 transitions. [2024-10-14 13:37:31,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:31,758 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 126 transitions. [2024-10-14 13:37:31,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 13:37:31,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:37:31,760 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:37:31,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 13:37:31,760 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:37:31,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:37:31,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1638787580, now seen corresponding path program 1 times [2024-10-14 13:37:31,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:37:31,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5163620] [2024-10-14 13:37:31,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:37:31,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:37:31,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:31,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:37:31,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:31,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:37:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:31,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:37:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:31,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:37:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:31,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:37:31,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:31,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:37:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:31,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:37:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:31,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:37:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:31,998 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:37:31,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:37:31,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5163620] [2024-10-14 13:37:31,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5163620] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:37:31,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:37:31,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 13:37:31,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411415198] [2024-10-14 13:37:31,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:37:31,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 13:37:32,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:37:32,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 13:37:32,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 13:37:32,000 INFO L87 Difference]: Start difference. First operand 95 states and 126 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:32,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:37:32,178 INFO L93 Difference]: Finished difference Result 228 states and 300 transitions. [2024-10-14 13:37:32,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 13:37:32,179 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 74 [2024-10-14 13:37:32,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:37:32,180 INFO L225 Difference]: With dead ends: 228 [2024-10-14 13:37:32,180 INFO L226 Difference]: Without dead ends: 134 [2024-10-14 13:37:32,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-14 13:37:32,181 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 136 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:37:32,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 469 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:37:32,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-14 13:37:32,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 95. [2024-10-14 13:37:32,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 84 states have internal predecessors, (109), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 13:37:32,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 125 transitions. [2024-10-14 13:37:32,189 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 125 transitions. Word has length 74 [2024-10-14 13:37:32,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:37:32,189 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 125 transitions. [2024-10-14 13:37:32,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:32,190 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 125 transitions. [2024-10-14 13:37:32,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 13:37:32,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:37:32,190 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:37:32,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 13:37:32,191 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:37:32,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:37:32,191 INFO L85 PathProgramCache]: Analyzing trace with hash 627670330, now seen corresponding path program 1 times [2024-10-14 13:37:32,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:37:32,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000561210] [2024-10-14 13:37:32,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:37:32,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:37:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:37:33,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:37:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:37:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:37:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:37:33,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:37:33,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:37:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:37:33,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,375 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-10-14 13:37:33,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:37:33,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000561210] [2024-10-14 13:37:33,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000561210] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:37:33,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062429580] [2024-10-14 13:37:33,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:37:33,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:37:33,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:37:33,377 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-14 13:37:33,378 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-14 13:37:33,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-10-14 13:37:33,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:37:34,129 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 15 treesize of output 1 [2024-10-14 13:37:34,453 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 15 treesize of output 1 [2024-10-14 13:37:35,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 13:37:35,240 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-14 13:37:35,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 13:37:35,294 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 19 treesize of output 18 [2024-10-14 13:37:35,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2024-10-14 13:37:35,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 13:37:35,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 13:37:35,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 74 [2024-10-14 13:37:35,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 13:37:35,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 13:37:35,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 30 [2024-10-14 13:37:35,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:37:35,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 77 treesize of output 81 [2024-10-14 13:37:35,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 13:37:35,788 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 3 proven. 92 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-14 13:37:35,789 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:37:35,887 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#3| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset)) (.cse2 (select |c_#memory_int#2| c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base))) (and (forall ((v_ArrVal_241 (Array Int Int))) (let ((.cse1 (select v_ArrVal_241 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset))) (or (< (select (select (store |c_#memory_int#2| c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base v_ArrVal_241) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset) .cse0) (< .cse1 0) (not (= v_ArrVal_241 (store .cse2 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset .cse1))) (< 127 .cse1)))) (forall ((v_ArrVal_241 (Array Int Int))) (let ((.cse3 (select v_ArrVal_241 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset))) (or (< (select (select (store |c_#memory_int#2| c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base v_ArrVal_241) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset) .cse0) (< (+ 128 .cse3) 0) (not (= v_ArrVal_241 (store .cse2 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset .cse3))) (< 0 (+ .cse3 1))))))) is different from false [2024-10-14 13:37:35,959 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (store |c_#memory_int#2| c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base (store (select |c_#memory_int#2| c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset 14)))) (let ((.cse0 (select .cse2 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base)) (.cse3 (select (select |c_#memory_int#3| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset))) (and (forall ((v_ArrVal_241 (Array Int Int))) (let ((.cse1 (select v_ArrVal_241 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset))) (or (not (= v_ArrVal_241 (store .cse0 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset .cse1))) (< (select (select (store .cse2 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base v_ArrVal_241) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset) .cse3) (< .cse1 0) (< 127 .cse1)))) (forall ((v_ArrVal_241 (Array Int Int))) (let ((.cse4 (select v_ArrVal_241 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset))) (or (not (= v_ArrVal_241 (store .cse0 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset .cse4))) (< (+ 128 .cse4) 0) (< (select (select (store .cse2 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base v_ArrVal_241) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset) .cse3) (< 0 (+ .cse4 1)))))))) is different from false [2024-10-14 13:37:36,002 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (store |c_#memory_int#2| c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base (store (select |c_#memory_int#2| c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset 14)))) (let ((.cse0 (select .cse2 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base)) (.cse3 (select |c_#memory_int#3| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base))) (and (forall ((v_ArrVal_241 (Array Int Int)) (v_ArrVal_238 Int)) (let ((.cse1 (select v_ArrVal_241 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset))) (or (not (= v_ArrVal_241 (store .cse0 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset .cse1))) (< (+ 128 .cse1) 0) (< (select (select (store .cse2 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base v_ArrVal_241) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset) (select (select (store |c_#memory_int#3| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base (store .cse3 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset v_ArrVal_238)) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset)) (< 0 (+ .cse1 1))))) (forall ((v_ArrVal_241 (Array Int Int)) (v_ArrVal_238 Int)) (let ((.cse4 (select v_ArrVal_241 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset))) (or (not (= v_ArrVal_241 (store .cse0 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset .cse4))) (< .cse4 0) (< (select (select (store .cse2 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base v_ArrVal_241) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset) (select (select (store |c_#memory_int#3| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base (store .cse3 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset v_ArrVal_238)) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset)) (< 127 .cse4))))))) is different from false [2024-10-14 13:37:36,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062429580] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:37:36,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 13:37:36,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2024-10-14 13:37:36,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869259049] [2024-10-14 13:37:36,063 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 13:37:36,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-14 13:37:36,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:37:36,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-14 13:37:36,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=732, Unknown=3, NotChecked=168, Total=992 [2024-10-14 13:37:36,064 INFO L87 Difference]: Start difference. First operand 95 states and 125 transitions. Second operand has 27 states, 25 states have (on average 2.88) internal successors, (72), 26 states have internal predecessors, (72), 7 states have call successors, (16), 5 states have call predecessors, (16), 7 states have return successors, (16), 5 states have call predecessors, (16), 7 states have call successors, (16) [2024-10-14 13:37:39,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:37:39,898 INFO L93 Difference]: Finished difference Result 509 states and 641 transitions. [2024-10-14 13:37:39,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-10-14 13:37:39,899 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 2.88) internal successors, (72), 26 states have internal predecessors, (72), 7 states have call successors, (16), 5 states have call predecessors, (16), 7 states have return successors, (16), 5 states have call predecessors, (16), 7 states have call successors, (16) Word has length 74 [2024-10-14 13:37:39,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:37:39,900 INFO L225 Difference]: With dead ends: 509 [2024-10-14 13:37:39,900 INFO L226 Difference]: Without dead ends: 415 [2024-10-14 13:37:39,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1496 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1122, Invalid=4739, Unknown=3, NotChecked=456, Total=6320 [2024-10-14 13:37:39,902 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 2012 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 274 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2012 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1069 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 13:37:39,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2012 Valid, 526 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1069 Invalid, 1 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 13:37:39,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-10-14 13:37:39,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 215. [2024-10-14 13:37:39,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 185 states have (on average 1.2378378378378379) internal successors, (229), 186 states have internal predecessors, (229), 20 states have call successors, (20), 9 states have call predecessors, (20), 9 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 13:37:39,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 269 transitions. [2024-10-14 13:37:39,924 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 269 transitions. Word has length 74 [2024-10-14 13:37:39,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:37:39,924 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 269 transitions. [2024-10-14 13:37:39,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 2.88) internal successors, (72), 26 states have internal predecessors, (72), 7 states have call successors, (16), 5 states have call predecessors, (16), 7 states have return successors, (16), 5 states have call predecessors, (16), 7 states have call successors, (16) [2024-10-14 13:37:39,924 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 269 transitions. [2024-10-14 13:37:39,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 13:37:39,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:37:39,925 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:37:39,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 13:37:40,125 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,SelfDestructingSolverStorable11 [2024-10-14 13:37:40,125 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:37:40,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:37:40,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1540476555, now seen corresponding path program 1 times [2024-10-14 13:37:40,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:37:40,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669050119] [2024-10-14 13:37:40,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:37:40,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:37:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:41,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:37:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:41,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:37:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:41,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:37:41,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:41,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:37:41,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:41,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:37:41,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:41,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:37:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:41,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:37:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:41,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:37:41,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:41,843 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:37:41,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:37:41,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669050119] [2024-10-14 13:37:41,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669050119] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:37:41,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:37:41,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-10-14 13:37:41,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015610028] [2024-10-14 13:37:41,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:37:41,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-14 13:37:41,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:37:41,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-14 13:37:41,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2024-10-14 13:37:41,845 INFO L87 Difference]: Start difference. First operand 215 states and 269 transitions. Second operand has 20 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-14 13:37:43,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:37:43,383 INFO L93 Difference]: Finished difference Result 680 states and 844 transitions. [2024-10-14 13:37:43,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-14 13:37:43,384 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 75 [2024-10-14 13:37:43,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:37:43,386 INFO L225 Difference]: With dead ends: 680 [2024-10-14 13:37:43,386 INFO L226 Difference]: Without dead ends: 478 [2024-10-14 13:37:43,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=329, Invalid=1311, Unknown=0, NotChecked=0, Total=1640 [2024-10-14 13:37:43,388 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 964 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 13:37:43,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [964 Valid, 1127 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1079 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 13:37:43,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-10-14 13:37:43,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 231. [2024-10-14 13:37:43,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 201 states have (on average 1.2388059701492538) internal successors, (249), 202 states have internal predecessors, (249), 20 states have call successors, (20), 9 states have call predecessors, (20), 9 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 13:37:43,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 289 transitions. [2024-10-14 13:37:43,411 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 289 transitions. Word has length 75 [2024-10-14 13:37:43,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:37:43,411 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 289 transitions. [2024-10-14 13:37:43,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-14 13:37:43,412 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 289 transitions. [2024-10-14 13:37:43,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 13:37:43,412 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:37:43,412 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:37:43,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 13:37:43,413 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:37:43,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:37:43,413 INFO L85 PathProgramCache]: Analyzing trace with hash 574790036, now seen corresponding path program 1 times [2024-10-14 13:37:43,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:37:43,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639886597] [2024-10-14 13:37:43,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:37:43,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:37:43,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:43,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:37:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:43,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:37:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:43,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:37:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:43,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:37:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:43,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:37:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:43,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:37:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:43,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:37:43,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:43,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:37:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:43,487 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:37:43,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:37:43,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639886597] [2024-10-14 13:37:43,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639886597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:37:43,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:37:43,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:37:43,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299770853] [2024-10-14 13:37:43,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:37:43,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:37:43,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:37:43,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:37:43,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:37:43,489 INFO L87 Difference]: Start difference. First operand 231 states and 289 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:43,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:37:43,537 INFO L93 Difference]: Finished difference Result 457 states and 572 transitions. [2024-10-14 13:37:43,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:37:43,538 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2024-10-14 13:37:43,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:37:43,539 INFO L225 Difference]: With dead ends: 457 [2024-10-14 13:37:43,539 INFO L226 Difference]: Without dead ends: 239 [2024-10-14 13:37:43,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 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-14 13:37:43,540 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:37:43,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 397 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:37:43,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-10-14 13:37:43,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 233. [2024-10-14 13:37:43,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 203 states have (on average 1.2364532019704433) internal successors, (251), 204 states have internal predecessors, (251), 20 states have call successors, (20), 9 states have call predecessors, (20), 9 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 13:37:43,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 291 transitions. [2024-10-14 13:37:43,565 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 291 transitions. Word has length 75 [2024-10-14 13:37:43,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:37:43,566 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 291 transitions. [2024-10-14 13:37:43,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:43,566 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 291 transitions. [2024-10-14 13:37:43,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 13:37:43,567 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:37:43,567 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:37:43,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 13:37:43,567 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:37:43,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:37:43,567 INFO L85 PathProgramCache]: Analyzing trace with hash 2021205531, now seen corresponding path program 1 times [2024-10-14 13:37:43,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:37:43,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859161739] [2024-10-14 13:37:43,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:37:43,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:37:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:43,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:37:43,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:43,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:37:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:43,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:37:43,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:43,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:37:43,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:43,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:37:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:43,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:37:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:43,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:37:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:43,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:37:43,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:43,692 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:37:43,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:37:43,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859161739] [2024-10-14 13:37:43,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859161739] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:37:43,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:37:43,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:37:43,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960114935] [2024-10-14 13:37:43,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:37:43,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:37:43,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:37:43,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:37:43,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:37:43,694 INFO L87 Difference]: Start difference. First operand 233 states and 291 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:43,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:37:43,848 INFO L93 Difference]: Finished difference Result 453 states and 566 transitions. [2024-10-14 13:37:43,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:37:43,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2024-10-14 13:37:43,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:37:43,852 INFO L225 Difference]: With dead ends: 453 [2024-10-14 13:37:43,852 INFO L226 Difference]: Without dead ends: 233 [2024-10-14 13:37:43,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:37:43,854 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 49 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:37:43,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 197 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:37:43,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-10-14 13:37:43,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2024-10-14 13:37:43,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 203 states have (on average 1.2266009852216748) internal successors, (249), 204 states have internal predecessors, (249), 20 states have call successors, (20), 9 states have call predecessors, (20), 9 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 13:37:43,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 289 transitions. [2024-10-14 13:37:43,881 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 289 transitions. Word has length 75 [2024-10-14 13:37:43,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:37:43,881 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 289 transitions. [2024-10-14 13:37:43,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:43,881 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 289 transitions. [2024-10-14 13:37:43,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-14 13:37:43,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:37:43,882 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:37:43,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 13:37:43,882 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:37:43,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:37:43,883 INFO L85 PathProgramCache]: Analyzing trace with hash -527455935, now seen corresponding path program 1 times [2024-10-14 13:37:43,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:37:43,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797806391] [2024-10-14 13:37:43,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:37:43,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:37:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:44,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:37:44,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:44,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:37:44,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:44,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:37:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:44,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:37:44,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:44,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:37:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:44,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:37:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:44,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:37:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:44,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:37:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:44,392 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:37:44,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:37:44,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797806391] [2024-10-14 13:37:44,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797806391] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:37:44,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:37:44,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 13:37:44,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541817432] [2024-10-14 13:37:44,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:37:44,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 13:37:44,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:37:44,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 13:37:44,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-14 13:37:44,393 INFO L87 Difference]: Start difference. First operand 233 states and 289 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:44,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:37:44,868 INFO L93 Difference]: Finished difference Result 539 states and 667 transitions. [2024-10-14 13:37:44,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 13:37:44,869 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 76 [2024-10-14 13:37:44,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:37:44,871 INFO L225 Difference]: With dead ends: 539 [2024-10-14 13:37:44,871 INFO L226 Difference]: Without dead ends: 319 [2024-10-14 13:37:44,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-10-14 13:37:44,872 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 111 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 13:37:44,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 850 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 13:37:44,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-10-14 13:37:44,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 209. [2024-10-14 13:37:44,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 179 states have (on average 1.223463687150838) internal successors, (219), 180 states have internal predecessors, (219), 20 states have call successors, (20), 9 states have call predecessors, (20), 9 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 13:37:44,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 259 transitions. [2024-10-14 13:37:44,903 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 259 transitions. Word has length 76 [2024-10-14 13:37:44,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:37:44,904 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 259 transitions. [2024-10-14 13:37:44,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:44,904 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 259 transitions. [2024-10-14 13:37:44,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-14 13:37:44,905 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:37:44,905 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:37:44,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 13:37:44,905 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:37:44,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:37:44,906 INFO L85 PathProgramCache]: Analyzing trace with hash 76875821, now seen corresponding path program 1 times [2024-10-14 13:37:44,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:37:44,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141125689] [2024-10-14 13:37:44,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:37:44,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:37:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:44,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:37:44,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:44,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:37:44,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:44,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:37:44,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:44,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:37:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:44,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:37:44,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:44,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:37:45,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:45,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:37:45,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:45,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:37:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:45,002 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:37:45,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:37:45,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141125689] [2024-10-14 13:37:45,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141125689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:37:45,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:37:45,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:37:45,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041379019] [2024-10-14 13:37:45,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:37:45,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:37:45,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:37:45,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:37:45,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:37:45,004 INFO L87 Difference]: Start difference. First operand 209 states and 259 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:45,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:37:45,067 INFO L93 Difference]: Finished difference Result 473 states and 587 transitions. [2024-10-14 13:37:45,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:37:45,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 77 [2024-10-14 13:37:45,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:37:45,068 INFO L225 Difference]: With dead ends: 473 [2024-10-14 13:37:45,068 INFO L226 Difference]: Without dead ends: 277 [2024-10-14 13:37:45,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:37:45,069 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 41 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:37:45,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 299 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:37:45,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-10-14 13:37:45,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 209. [2024-10-14 13:37:45,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 179 states have (on average 1.2122905027932962) internal successors, (217), 180 states have internal predecessors, (217), 20 states have call successors, (20), 9 states have call predecessors, (20), 9 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 13:37:45,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 257 transitions. [2024-10-14 13:37:45,097 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 257 transitions. Word has length 77 [2024-10-14 13:37:45,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:37:45,097 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 257 transitions. [2024-10-14 13:37:45,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:45,097 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 257 transitions. [2024-10-14 13:37:45,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 13:37:45,098 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:37:45,098 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:37:45,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 13:37:45,098 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:37:45,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:37:45,099 INFO L85 PathProgramCache]: Analyzing trace with hash 2122187141, now seen corresponding path program 1 times [2024-10-14 13:37:45,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:37:45,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816408219] [2024-10-14 13:37:45,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:37:45,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:37:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:45,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:37:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:45,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:37:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:45,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:37:45,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:45,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:37:45,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:45,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:37:45,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:45,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:37:45,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:45,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:37:45,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:45,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:37:45,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:45,200 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:37:45,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:37:45,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816408219] [2024-10-14 13:37:45,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816408219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:37:45,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:37:45,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:37:45,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515591814] [2024-10-14 13:37:45,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:37:45,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:37:45,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:37:45,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:37:45,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:37:45,202 INFO L87 Difference]: Start difference. First operand 209 states and 257 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:45,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:37:45,264 INFO L93 Difference]: Finished difference Result 465 states and 575 transitions. [2024-10-14 13:37:45,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:37:45,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 78 [2024-10-14 13:37:45,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:37:45,266 INFO L225 Difference]: With dead ends: 465 [2024-10-14 13:37:45,266 INFO L226 Difference]: Without dead ends: 269 [2024-10-14 13:37:45,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:37:45,267 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 31 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:37:45,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 299 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:37:45,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-10-14 13:37:45,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 219. [2024-10-14 13:37:45,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 189 states have (on average 1.2010582010582012) internal successors, (227), 190 states have internal predecessors, (227), 20 states have call successors, (20), 9 states have call predecessors, (20), 9 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 13:37:45,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 267 transitions. [2024-10-14 13:37:45,292 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 267 transitions. Word has length 78 [2024-10-14 13:37:45,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:37:45,293 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 267 transitions. [2024-10-14 13:37:45,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:45,293 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 267 transitions. [2024-10-14 13:37:45,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 13:37:45,294 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:37:45,294 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:37:45,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 13:37:45,294 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:37:45,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:37:45,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1674557519, now seen corresponding path program 1 times [2024-10-14 13:37:45,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:37:45,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442378908] [2024-10-14 13:37:45,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:37:45,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:37:45,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:45,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:37:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:45,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:37:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:45,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:37:45,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:45,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:37:45,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:45,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:37:45,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:45,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:37:45,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:45,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:37:45,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:45,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:37:45,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:45,584 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:37:45,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:37:45,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442378908] [2024-10-14 13:37:45,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442378908] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:37:45,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:37:45,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 13:37:45,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933104129] [2024-10-14 13:37:45,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:37:45,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 13:37:45,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:37:45,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 13:37:45,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-14 13:37:45,587 INFO L87 Difference]: Start difference. First operand 219 states and 267 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 13:37:45,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:37:45,836 INFO L93 Difference]: Finished difference Result 526 states and 631 transitions. [2024-10-14 13:37:45,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 13:37:45,837 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2024-10-14 13:37:45,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:37:45,839 INFO L225 Difference]: With dead ends: 526 [2024-10-14 13:37:45,839 INFO L226 Difference]: Without dead ends: 320 [2024-10-14 13:37:45,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2024-10-14 13:37:45,840 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 228 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:37:45,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 536 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:37:45,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-10-14 13:37:45,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 201. [2024-10-14 13:37:45,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 169 states have (on average 1.1597633136094674) internal successors, (196), 171 states have internal predecessors, (196), 20 states have call successors, (20), 11 states have call predecessors, (20), 11 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 13:37:45,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 236 transitions. [2024-10-14 13:37:45,872 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 236 transitions. Word has length 78 [2024-10-14 13:37:45,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:37:45,872 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 236 transitions. [2024-10-14 13:37:45,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 13:37:45,873 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 236 transitions. [2024-10-14 13:37:45,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 13:37:45,873 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:37:45,873 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:37:45,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 13:37:45,873 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:37:45,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:37:45,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1455702801, now seen corresponding path program 1 times [2024-10-14 13:37:45,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:37:45,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512767495] [2024-10-14 13:37:45,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:37:45,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:37:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:45,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:37:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:45,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:37:45,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:45,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:37:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:45,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:37:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:45,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:37:45,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:45,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:37:45,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:45,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:37:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:45,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:37:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:45,935 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:37:45,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:37:45,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512767495] [2024-10-14 13:37:45,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512767495] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:37:45,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:37:45,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:37:45,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586937523] [2024-10-14 13:37:45,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:37:45,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:37:45,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:37:45,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:37:45,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:37:45,937 INFO L87 Difference]: Start difference. First operand 201 states and 236 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:46,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:37:46,047 INFO L93 Difference]: Finished difference Result 423 states and 498 transitions. [2024-10-14 13:37:46,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:37:46,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 78 [2024-10-14 13:37:46,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:37:46,048 INFO L225 Difference]: With dead ends: 423 [2024-10-14 13:37:46,048 INFO L226 Difference]: Without dead ends: 247 [2024-10-14 13:37:46,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:37:46,049 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 41 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:37:46,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 388 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:37:46,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-10-14 13:37:46,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 216. [2024-10-14 13:37:46,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 184 states have (on average 1.1521739130434783) internal successors, (212), 186 states have internal predecessors, (212), 20 states have call successors, (20), 11 states have call predecessors, (20), 11 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 13:37:46,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 252 transitions. [2024-10-14 13:37:46,081 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 252 transitions. Word has length 78 [2024-10-14 13:37:46,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:37:46,081 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 252 transitions. [2024-10-14 13:37:46,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:46,081 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 252 transitions. [2024-10-14 13:37:46,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 13:37:46,082 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:37:46,082 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:37:46,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 13:37:46,082 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:37:46,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:37:46,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1177574646, now seen corresponding path program 1 times [2024-10-14 13:37:46,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:37:46,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548030879] [2024-10-14 13:37:46,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:37:46,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:37:46,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:46,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:37:46,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:46,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:37:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:46,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:37:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:46,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:37:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:46,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:37:46,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:46,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:37:46,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:46,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:37:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:46,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:37:46,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:46,625 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:37:46,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:37:46,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548030879] [2024-10-14 13:37:46,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548030879] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:37:46,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:37:46,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 13:37:46,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223728779] [2024-10-14 13:37:46,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:37:46,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 13:37:46,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:37:46,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 13:37:46,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:37:46,627 INFO L87 Difference]: Start difference. First operand 216 states and 252 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:46,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:37:46,808 INFO L93 Difference]: Finished difference Result 222 states and 259 transitions. [2024-10-14 13:37:46,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:37:46,809 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2024-10-14 13:37:46,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:37:46,810 INFO L225 Difference]: With dead ends: 222 [2024-10-14 13:37:46,811 INFO L226 Difference]: Without dead ends: 220 [2024-10-14 13:37:46,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:37:46,811 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 136 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:37:46,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 267 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:37:46,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-10-14 13:37:46,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2024-10-14 13:37:46,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 188 states have (on average 1.148936170212766) internal successors, (216), 190 states have internal predecessors, (216), 20 states have call successors, (20), 11 states have call predecessors, (20), 11 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 13:37:46,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 256 transitions. [2024-10-14 13:37:46,846 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 256 transitions. Word has length 80 [2024-10-14 13:37:46,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:37:46,847 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 256 transitions. [2024-10-14 13:37:46,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:46,847 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 256 transitions. [2024-10-14 13:37:46,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 13:37:46,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:37:46,848 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:37:46,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 13:37:46,848 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:37:46,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:37:46,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1177515064, now seen corresponding path program 1 times [2024-10-14 13:37:46,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:37:46,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186536032] [2024-10-14 13:37:46,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:37:46,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:37:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:46,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:37:46,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:46,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:37:46,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:46,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:37:46,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:46,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:37:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:46,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:37:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:46,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:37:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:46,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:37:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:46,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:37:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:46,996 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:37:46,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:37:46,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186536032] [2024-10-14 13:37:46,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186536032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:37:46,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:37:46,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:37:46,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109201205] [2024-10-14 13:37:46,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:37:46,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:37:46,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:37:46,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:37:46,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:37:46,997 INFO L87 Difference]: Start difference. First operand 220 states and 256 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:47,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:37:47,134 INFO L93 Difference]: Finished difference Result 415 states and 484 transitions. [2024-10-14 13:37:47,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:37:47,135 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2024-10-14 13:37:47,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:37:47,135 INFO L225 Difference]: With dead ends: 415 [2024-10-14 13:37:47,136 INFO L226 Difference]: Without dead ends: 220 [2024-10-14 13:37:47,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:37:47,136 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 102 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:37:47,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 271 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:37:47,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-10-14 13:37:47,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2024-10-14 13:37:47,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 188 states have (on average 1.1382978723404256) internal successors, (214), 190 states have internal predecessors, (214), 20 states have call successors, (20), 11 states have call predecessors, (20), 11 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 13:37:47,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 254 transitions. [2024-10-14 13:37:47,170 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 254 transitions. Word has length 80 [2024-10-14 13:37:47,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:37:47,171 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 254 transitions. [2024-10-14 13:37:47,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:47,171 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 254 transitions. [2024-10-14 13:37:47,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 13:37:47,171 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:37:47,171 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:37:47,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 13:37:47,172 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:37:47,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:37:47,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1120256762, now seen corresponding path program 1 times [2024-10-14 13:37:47,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:37:47,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066202199] [2024-10-14 13:37:47,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:37:47,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:37:47,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:47,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:37:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:47,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:37:47,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:47,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:37:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:47,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:37:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:47,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:37:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:47,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:37:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:47,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:37:47,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:47,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:37:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:47,900 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:37:47,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:37:47,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066202199] [2024-10-14 13:37:47,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066202199] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:37:47,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:37:47,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 13:37:47,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737653973] [2024-10-14 13:37:47,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:37:47,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 13:37:47,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:37:47,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 13:37:47,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-14 13:37:47,901 INFO L87 Difference]: Start difference. First operand 220 states and 254 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 13:37:48,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:37:48,379 INFO L93 Difference]: Finished difference Result 556 states and 644 transitions. [2024-10-14 13:37:48,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 13:37:48,379 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 80 [2024-10-14 13:37:48,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:37:48,381 INFO L225 Difference]: With dead ends: 556 [2024-10-14 13:37:48,381 INFO L226 Difference]: Without dead ends: 361 [2024-10-14 13:37:48,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2024-10-14 13:37:48,382 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 581 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:37:48,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 423 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:37:48,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-10-14 13:37:48,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 321. [2024-10-14 13:37:48,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 289 states have (on average 1.1418685121107266) internal successors, (330), 291 states have internal predecessors, (330), 20 states have call successors, (20), 11 states have call predecessors, (20), 11 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 13:37:48,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 370 transitions. [2024-10-14 13:37:48,415 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 370 transitions. Word has length 80 [2024-10-14 13:37:48,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:37:48,415 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 370 transitions. [2024-10-14 13:37:48,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 13:37:48,416 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 370 transitions. [2024-10-14 13:37:48,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 13:37:48,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:37:48,416 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:37:48,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 13:37:48,417 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:37:48,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:37:48,417 INFO L85 PathProgramCache]: Analyzing trace with hash 318973285, now seen corresponding path program 1 times [2024-10-14 13:37:48,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:37:48,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603469489] [2024-10-14 13:37:48,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:37:48,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:37:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:48,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:37:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:48,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:37:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:48,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:37:48,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:48,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:37:48,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:48,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:37:48,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:48,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:37:48,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:48,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:37:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:48,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:37:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:48,499 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:37:48,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:37:48,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603469489] [2024-10-14 13:37:48,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603469489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:37:48,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:37:48,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:37:48,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111396877] [2024-10-14 13:37:48,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:37:48,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:37:48,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:37:48,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:37:48,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:37:48,501 INFO L87 Difference]: Start difference. First operand 321 states and 370 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:48,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:37:48,577 INFO L93 Difference]: Finished difference Result 665 states and 767 transitions. [2024-10-14 13:37:48,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:37:48,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 81 [2024-10-14 13:37:48,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:37:48,578 INFO L225 Difference]: With dead ends: 665 [2024-10-14 13:37:48,578 INFO L226 Difference]: Without dead ends: 369 [2024-10-14 13:37:48,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:37:48,579 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 31 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:37:48,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 382 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:37:48,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-10-14 13:37:48,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 279. [2024-10-14 13:37:48,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 247 states have (on average 1.125506072874494) internal successors, (278), 249 states have internal predecessors, (278), 20 states have call successors, (20), 11 states have call predecessors, (20), 11 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 13:37:48,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 318 transitions. [2024-10-14 13:37:48,649 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 318 transitions. Word has length 81 [2024-10-14 13:37:48,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:37:48,653 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 318 transitions. [2024-10-14 13:37:48,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:48,653 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 318 transitions. [2024-10-14 13:37:48,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-14 13:37:48,654 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:37:48,654 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:37:48,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 13:37:48,654 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:37:48,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:37:48,654 INFO L85 PathProgramCache]: Analyzing trace with hash -283922431, now seen corresponding path program 1 times [2024-10-14 13:37:48,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:37:48,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466398697] [2024-10-14 13:37:48,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:37:48,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:37:48,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:49,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:37:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:49,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:37:49,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:49,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:37:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:49,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:37:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:49,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:37:49,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:49,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:37:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:49,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:37:49,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:49,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:37:49,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:49,230 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:37:49,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:37:49,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466398697] [2024-10-14 13:37:49,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466398697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:37:49,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:37:49,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 13:37:49,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882030953] [2024-10-14 13:37:49,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:37:49,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 13:37:49,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:37:49,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 13:37:49,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 13:37:49,236 INFO L87 Difference]: Start difference. First operand 279 states and 318 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:49,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:37:49,431 INFO L93 Difference]: Finished difference Result 626 states and 711 transitions. [2024-10-14 13:37:49,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 13:37:49,431 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 82 [2024-10-14 13:37:49,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:37:49,435 INFO L225 Difference]: With dead ends: 626 [2024-10-14 13:37:49,436 INFO L226 Difference]: Without dead ends: 372 [2024-10-14 13:37:49,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-14 13:37:49,437 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 127 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:37:49,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 227 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:37:49,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-10-14 13:37:49,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 354. [2024-10-14 13:37:49,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 322 states have (on average 1.1211180124223603) internal successors, (361), 324 states have internal predecessors, (361), 20 states have call successors, (20), 11 states have call predecessors, (20), 11 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 13:37:49,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 401 transitions. [2024-10-14 13:37:49,472 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 401 transitions. Word has length 82 [2024-10-14 13:37:49,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:37:49,472 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 401 transitions. [2024-10-14 13:37:49,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:49,473 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 401 transitions. [2024-10-14 13:37:49,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-14 13:37:49,473 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:37:49,474 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:37:49,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-14 13:37:49,474 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:37:49,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:37:49,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1678882448, now seen corresponding path program 1 times [2024-10-14 13:37:49,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:37:49,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678148130] [2024-10-14 13:37:49,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:37:49,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:37:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:49,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:37:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:49,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:37:49,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:49,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:37:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:49,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:37:49,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:49,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:37:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:49,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:37:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:49,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:37:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:49,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:37:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:49,548 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:37:49,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:37:49,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678148130] [2024-10-14 13:37:49,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678148130] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:37:49,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:37:49,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:37:49,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766234723] [2024-10-14 13:37:49,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:37:49,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:37:49,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:37:49,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:37:49,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:37:49,550 INFO L87 Difference]: Start difference. First operand 354 states and 401 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:49,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:37:49,645 INFO L93 Difference]: Finished difference Result 607 states and 687 transitions. [2024-10-14 13:37:49,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:37:49,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 82 [2024-10-14 13:37:49,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:37:49,647 INFO L225 Difference]: With dead ends: 607 [2024-10-14 13:37:49,647 INFO L226 Difference]: Without dead ends: 278 [2024-10-14 13:37:49,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 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-14 13:37:49,648 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:37:49,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:37:49,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-10-14 13:37:49,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2024-10-14 13:37:49,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 246 states have (on average 1.1097560975609757) internal successors, (273), 248 states have internal predecessors, (273), 20 states have call successors, (20), 11 states have call predecessors, (20), 11 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 13:37:49,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 313 transitions. [2024-10-14 13:37:49,687 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 313 transitions. Word has length 82 [2024-10-14 13:37:49,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:37:49,687 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 313 transitions. [2024-10-14 13:37:49,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:49,687 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 313 transitions. [2024-10-14 13:37:49,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-14 13:37:49,688 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:37:49,688 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:37:49,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-14 13:37:49,688 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:37:49,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:37:49,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1495393611, now seen corresponding path program 1 times [2024-10-14 13:37:49,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:37:49,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709872241] [2024-10-14 13:37:49,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:37:49,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:37:49,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:50,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:37:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:50,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:37:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:50,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:37:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:50,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:37:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:50,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:37:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:50,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:37:50,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:50,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:37:50,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:50,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:37:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:50,680 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:37:50,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:37:50,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709872241] [2024-10-14 13:37:50,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709872241] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:37:50,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:37:50,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-14 13:37:50,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864880940] [2024-10-14 13:37:50,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:37:50,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 13:37:50,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:37:50,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 13:37:50,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-10-14 13:37:50,682 INFO L87 Difference]: Start difference. First operand 278 states and 313 transitions. Second operand has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 14 states have internal predecessors, (46), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-14 13:37:51,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:37:51,205 INFO L93 Difference]: Finished difference Result 541 states and 609 transitions. [2024-10-14 13:37:51,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 13:37:51,206 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 14 states have internal predecessors, (46), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 83 [2024-10-14 13:37:51,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:37:51,207 INFO L225 Difference]: With dead ends: 541 [2024-10-14 13:37:51,207 INFO L226 Difference]: Without dead ends: 288 [2024-10-14 13:37:51,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2024-10-14 13:37:51,208 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 411 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:37:51,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 404 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:37:51,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-10-14 13:37:51,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 280. [2024-10-14 13:37:51,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 248 states have (on average 1.1088709677419355) internal successors, (275), 250 states have internal predecessors, (275), 20 states have call successors, (20), 11 states have call predecessors, (20), 11 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 13:37:51,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 315 transitions. [2024-10-14 13:37:51,242 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 315 transitions. Word has length 83 [2024-10-14 13:37:51,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:37:51,243 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 315 transitions. [2024-10-14 13:37:51,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 14 states have internal predecessors, (46), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-14 13:37:51,243 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 315 transitions. [2024-10-14 13:37:51,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-14 13:37:51,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:37:51,244 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:37:51,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-14 13:37:51,244 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:37:51,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:37:51,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1981685327, now seen corresponding path program 1 times [2024-10-14 13:37:51,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:37:51,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284170186] [2024-10-14 13:37:51,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:37:51,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:37:51,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:51,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:37:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:51,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:37:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:51,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:37:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:51,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:37:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:51,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:37:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:51,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:37:51,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:51,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:37:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:51,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:37:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:51,316 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:37:51,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:37:51,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284170186] [2024-10-14 13:37:51,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284170186] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:37:51,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:37:51,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:37:51,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388958675] [2024-10-14 13:37:51,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:37:51,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:37:51,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:37:51,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:37:51,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:37:51,318 INFO L87 Difference]: Start difference. First operand 280 states and 315 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:51,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:37:51,391 INFO L93 Difference]: Finished difference Result 513 states and 575 transitions. [2024-10-14 13:37:51,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:37:51,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 85 [2024-10-14 13:37:51,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:37:51,393 INFO L225 Difference]: With dead ends: 513 [2024-10-14 13:37:51,393 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 13:37:51,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:37:51,394 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:37:51,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 231 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:37:51,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 13:37:51,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 13:37:51,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 13:37:51,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 13:37:51,395 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2024-10-14 13:37:51,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:37:51,395 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 13:37:51,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:37:51,395 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 13:37:51,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 13:37:51,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 13:37:51,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-14 13:37:51,400 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:37:51,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.