./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.06.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.06.cil-2.c -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 fee2fbeec3a60e447cd74345d2f8a46dc28fcea89eab2880c2a2ccd5802bfaa0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 02:59:45,934 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 02:59:46,016 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 02:59:46,020 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 02:59:46,021 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 02:59:46,049 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 02:59:46,049 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 02:59:46,050 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 02:59:46,051 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 02:59:46,051 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 02:59:46,053 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 02:59:46,053 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 02:59:46,053 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 02:59:46,054 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 02:59:46,055 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 02:59:46,056 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 02:59:46,056 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 02:59:46,056 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 02:59:46,056 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 02:59:46,057 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 02:59:46,057 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 02:59:46,057 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 02:59:46,058 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 02:59:46,058 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 02:59:46,058 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 02:59:46,058 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 02:59:46,058 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 02:59:46,059 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 02:59:46,059 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 02:59:46,059 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 02:59:46,059 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 02:59:46,060 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 02:59:46,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 02:59:46,060 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 02:59:46,060 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 02:59:46,061 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 02:59:46,061 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 02:59:46,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 02:59:46,061 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 02:59:46,061 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 02:59:46,062 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 02:59:46,062 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 02:59:46,063 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 -> fee2fbeec3a60e447cd74345d2f8a46dc28fcea89eab2880c2a2ccd5802bfaa0 [2024-10-24 02:59:46,319 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 02:59:46,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 02:59:46,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 02:59:46,342 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 02:59:46,342 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 02:59:46,343 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.06.cil-2.c [2024-10-24 02:59:47,830 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 02:59:48,055 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 02:59:48,055 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.06.cil-2.c [2024-10-24 02:59:48,075 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cc9f70b5/5316a70c315844389f11fa9fc66a9362/FLAG850ddfd89 [2024-10-24 02:59:48,091 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cc9f70b5/5316a70c315844389f11fa9fc66a9362 [2024-10-24 02:59:48,094 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 02:59:48,095 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 02:59:48,097 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 02:59:48,098 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 02:59:48,103 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 02:59:48,104 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:59:48" (1/1) ... [2024-10-24 02:59:48,105 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1655469b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:48, skipping insertion in model container [2024-10-24 02:59:48,106 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:59:48" (1/1) ... [2024-10-24 02:59:48,150 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 02:59:48,399 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/combinations/pc_sfifo_1.cil-2+token_ring.06.cil-2.c[913,926] [2024-10-24 02:59:48,454 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/combinations/pc_sfifo_1.cil-2+token_ring.06.cil-2.c[5977,5990] [2024-10-24 02:59:48,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 02:59:48,526 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 02:59:48,544 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/combinations/pc_sfifo_1.cil-2+token_ring.06.cil-2.c[913,926] [2024-10-24 02:59:48,561 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/combinations/pc_sfifo_1.cil-2+token_ring.06.cil-2.c[5977,5990] [2024-10-24 02:59:48,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 02:59:48,633 INFO L204 MainTranslator]: Completed translation [2024-10-24 02:59:48,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:48 WrapperNode [2024-10-24 02:59:48,634 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 02:59:48,635 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 02:59:48,635 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 02:59:48,635 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 02:59:48,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:48" (1/1) ... [2024-10-24 02:59:48,657 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:48" (1/1) ... [2024-10-24 02:59:48,696 INFO L138 Inliner]: procedures = 60, calls = 66, calls flagged for inlining = 35, calls inlined = 35, statements flattened = 723 [2024-10-24 02:59:48,697 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 02:59:48,698 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 02:59:48,698 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 02:59:48,698 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 02:59:48,708 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:48" (1/1) ... [2024-10-24 02:59:48,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:48" (1/1) ... [2024-10-24 02:59:48,712 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:48" (1/1) ... [2024-10-24 02:59:48,739 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 02:59:48,739 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:48" (1/1) ... [2024-10-24 02:59:48,741 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:48" (1/1) ... [2024-10-24 02:59:48,761 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:48" (1/1) ... [2024-10-24 02:59:48,779 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:48" (1/1) ... [2024-10-24 02:59:48,782 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:48" (1/1) ... [2024-10-24 02:59:48,785 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:48" (1/1) ... [2024-10-24 02:59:48,789 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 02:59:48,790 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 02:59:48,790 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 02:59:48,790 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 02:59:48,791 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:48" (1/1) ... [2024-10-24 02:59:48,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 02:59:48,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 02:59:48,843 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 02:59:48,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 02:59:48,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 02:59:48,897 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-24 02:59:48,897 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-24 02:59:48,898 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2024-10-24 02:59:48,900 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2024-10-24 02:59:48,900 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-24 02:59:48,900 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-24 02:59:48,901 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-24 02:59:48,901 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-24 02:59:48,901 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-24 02:59:48,901 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-24 02:59:48,901 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-24 02:59:48,901 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-24 02:59:48,901 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-24 02:59:48,901 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-24 02:59:48,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 02:59:48,902 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-24 02:59:48,902 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-24 02:59:48,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 02:59:48,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 02:59:48,903 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-24 02:59:48,903 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-24 02:59:49,036 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 02:59:49,040 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 02:59:49,703 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2024-10-24 02:59:49,703 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 02:59:49,804 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 02:59:49,806 INFO L314 CfgBuilder]: Removed 13 assume(true) statements. [2024-10-24 02:59:49,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:59:49 BoogieIcfgContainer [2024-10-24 02:59:49,806 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 02:59:49,809 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 02:59:49,809 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 02:59:49,812 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 02:59:49,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:59:48" (1/3) ... [2024-10-24 02:59:49,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b129fe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:59:49, skipping insertion in model container [2024-10-24 02:59:49,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:48" (2/3) ... [2024-10-24 02:59:49,814 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b129fe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:59:49, skipping insertion in model container [2024-10-24 02:59:49,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:59:49" (3/3) ... [2024-10-24 02:59:49,816 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.06.cil-2.c [2024-10-24 02:59:49,831 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 02:59:49,832 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 02:59:49,899 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 02:59:49,905 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;@15f5eb49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 02:59:49,905 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-24 02:59:49,910 INFO L276 IsEmpty]: Start isEmpty. Operand has 273 states, 235 states have (on average 1.6978723404255318) internal successors, (399), 240 states have internal predecessors, (399), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 02:59:49,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-24 02:59:49,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:59:49,921 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:59:49,921 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:59:49,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:59:49,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1695367655, now seen corresponding path program 1 times [2024-10-24 02:59:49,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:59:49,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240291264] [2024-10-24 02:59:49,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:59:49,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:59:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:50,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 02:59:50,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:50,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 02:59:50,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:50,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:59:50,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:59:50,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240291264] [2024-10-24 02:59:50,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240291264] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:59:50,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:59:50,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 02:59:50,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020371987] [2024-10-24 02:59:50,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:59:50,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 02:59:50,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:59:50,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 02:59:50,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 02:59:50,300 INFO L87 Difference]: Start difference. First operand has 273 states, 235 states have (on average 1.6978723404255318) internal successors, (399), 240 states have internal predecessors, (399), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 02:59:50,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:59:50,850 INFO L93 Difference]: Finished difference Result 593 states and 978 transitions. [2024-10-24 02:59:50,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 02:59:50,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2024-10-24 02:59:50,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:59:50,869 INFO L225 Difference]: With dead ends: 593 [2024-10-24 02:59:50,872 INFO L226 Difference]: Without dead ends: 331 [2024-10-24 02:59:50,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 02:59:50,884 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 544 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 02:59:50,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 499 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 02:59:50,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-10-24 02:59:50,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 325. [2024-10-24 02:59:50,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 282 states have (on average 1.5460992907801419) internal successors, (436), 286 states have internal predecessors, (436), 30 states have call successors, (30), 11 states have call predecessors, (30), 11 states have return successors, (34), 28 states have call predecessors, (34), 28 states have call successors, (34) [2024-10-24 02:59:50,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 500 transitions. [2024-10-24 02:59:50,960 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 500 transitions. Word has length 37 [2024-10-24 02:59:50,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:59:50,961 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 500 transitions. [2024-10-24 02:59:50,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 02:59:50,961 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 500 transitions. [2024-10-24 02:59:50,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-24 02:59:50,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:59:50,964 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:59:50,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 02:59:50,965 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:59:50,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:59:50,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1778259796, now seen corresponding path program 1 times [2024-10-24 02:59:50,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:59:50,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757631004] [2024-10-24 02:59:50,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:59:50,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:59:50,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:51,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 02:59:51,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:51,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 02:59:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:51,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:59:51,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:59:51,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757631004] [2024-10-24 02:59:51,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757631004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:59:51,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:59:51,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 02:59:51,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635577051] [2024-10-24 02:59:51,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:59:51,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 02:59:51,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:59:51,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 02:59:51,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 02:59:51,108 INFO L87 Difference]: Start difference. First operand 325 states and 500 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 02:59:51,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:59:51,506 INFO L93 Difference]: Finished difference Result 559 states and 844 transitions. [2024-10-24 02:59:51,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 02:59:51,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2024-10-24 02:59:51,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:59:51,514 INFO L225 Difference]: With dead ends: 559 [2024-10-24 02:59:51,514 INFO L226 Difference]: Without dead ends: 448 [2024-10-24 02:59:51,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 02:59:51,517 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 557 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 02:59:51,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 493 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 02:59:51,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-10-24 02:59:51,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 425. [2024-10-24 02:59:51,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 369 states have (on average 1.5013550135501355) internal successors, (554), 374 states have internal predecessors, (554), 38 states have call successors, (38), 15 states have call predecessors, (38), 16 states have return successors, (48), 36 states have call predecessors, (48), 36 states have call successors, (48) [2024-10-24 02:59:51,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 640 transitions. [2024-10-24 02:59:51,558 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 640 transitions. Word has length 38 [2024-10-24 02:59:51,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:59:51,558 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 640 transitions. [2024-10-24 02:59:51,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 02:59:51,559 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 640 transitions. [2024-10-24 02:59:51,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-24 02:59:51,561 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:59:51,562 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:59:51,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 02:59:51,562 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:59:51,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:59:51,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1372382596, now seen corresponding path program 1 times [2024-10-24 02:59:51,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:59:51,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265778219] [2024-10-24 02:59:51,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:59:51,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:59:51,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:51,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 02:59:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:51,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-24 02:59:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:51,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:59:51,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:59:51,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265778219] [2024-10-24 02:59:51,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265778219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:59:51,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:59:51,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 02:59:51,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559563306] [2024-10-24 02:59:51,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:59:51,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 02:59:51,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:59:51,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 02:59:51,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 02:59:51,658 INFO L87 Difference]: Start difference. First operand 425 states and 640 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 02:59:52,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:59:52,121 INFO L93 Difference]: Finished difference Result 845 states and 1221 transitions. [2024-10-24 02:59:52,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 02:59:52,122 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2024-10-24 02:59:52,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:59:52,129 INFO L225 Difference]: With dead ends: 845 [2024-10-24 02:59:52,129 INFO L226 Difference]: Without dead ends: 634 [2024-10-24 02:59:52,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 02:59:52,131 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 232 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 02:59:52,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 681 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 02:59:52,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-10-24 02:59:52,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 530. [2024-10-24 02:59:52,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 462 states have (on average 1.4783549783549783) internal successors, (683), 469 states have internal predecessors, (683), 44 states have call successors, (44), 21 states have call predecessors, (44), 22 states have return successors, (54), 40 states have call predecessors, (54), 42 states have call successors, (54) [2024-10-24 02:59:52,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 781 transitions. [2024-10-24 02:59:52,199 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 781 transitions. Word has length 39 [2024-10-24 02:59:52,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:59:52,199 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 781 transitions. [2024-10-24 02:59:52,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 02:59:52,200 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 781 transitions. [2024-10-24 02:59:52,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-24 02:59:52,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:59:52,205 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:59:52,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 02:59:52,205 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:59:52,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:59:52,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1200848462, now seen corresponding path program 1 times [2024-10-24 02:59:52,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:59:52,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536314667] [2024-10-24 02:59:52,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:59:52,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:59:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:52,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 02:59:52,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:52,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 02:59:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:52,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 02:59:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:52,335 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 02:59:52,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:59:52,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536314667] [2024-10-24 02:59:52,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536314667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:59:52,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:59:52,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 02:59:52,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277180713] [2024-10-24 02:59:52,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:59:52,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 02:59:52,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:59:52,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 02:59:52,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 02:59:52,338 INFO L87 Difference]: Start difference. First operand 530 states and 781 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 02:59:52,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:59:52,808 INFO L93 Difference]: Finished difference Result 1046 states and 1498 transitions. [2024-10-24 02:59:52,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 02:59:52,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 54 [2024-10-24 02:59:52,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:59:52,816 INFO L225 Difference]: With dead ends: 1046 [2024-10-24 02:59:52,817 INFO L226 Difference]: Without dead ends: 730 [2024-10-24 02:59:52,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 02:59:52,821 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 217 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 02:59:52,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 728 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 02:59:52,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2024-10-24 02:59:52,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 696. [2024-10-24 02:59:52,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 604 states have (on average 1.4221854304635762) internal successors, (859), 613 states have internal predecessors, (859), 58 states have call successors, (58), 29 states have call predecessors, (58), 32 states have return successors, (78), 54 states have call predecessors, (78), 56 states have call successors, (78) [2024-10-24 02:59:52,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 995 transitions. [2024-10-24 02:59:52,874 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 995 transitions. Word has length 54 [2024-10-24 02:59:52,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:59:52,875 INFO L471 AbstractCegarLoop]: Abstraction has 696 states and 995 transitions. [2024-10-24 02:59:52,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 02:59:52,876 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 995 transitions. [2024-10-24 02:59:52,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-24 02:59:52,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:59:52,892 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:59:52,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 02:59:52,893 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:59:52,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:59:52,893 INFO L85 PathProgramCache]: Analyzing trace with hash 456550865, now seen corresponding path program 1 times [2024-10-24 02:59:52,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:59:52,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600885179] [2024-10-24 02:59:52,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:59:52,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:59:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:52,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 02:59:52,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:52,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 02:59:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:52,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 02:59:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:52,991 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 02:59:52,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:59:52,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600885179] [2024-10-24 02:59:52,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600885179] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:59:52,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:59:52,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 02:59:52,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047099157] [2024-10-24 02:59:52,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:59:52,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 02:59:52,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:59:52,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 02:59:52,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 02:59:52,997 INFO L87 Difference]: Start difference. First operand 696 states and 995 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 02:59:53,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:59:53,365 INFO L93 Difference]: Finished difference Result 1275 states and 1774 transitions. [2024-10-24 02:59:53,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 02:59:53,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2024-10-24 02:59:53,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:59:53,375 INFO L225 Difference]: With dead ends: 1275 [2024-10-24 02:59:53,377 INFO L226 Difference]: Without dead ends: 873 [2024-10-24 02:59:53,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 02:59:53,380 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 543 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 02:59:53,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 505 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 02:59:53,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-10-24 02:59:53,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 824. [2024-10-24 02:59:53,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 716 states have (on average 1.388268156424581) internal successors, (994), 727 states have internal predecessors, (994), 66 states have call successors, (66), 35 states have call predecessors, (66), 40 states have return successors, (92), 62 states have call predecessors, (92), 64 states have call successors, (92) [2024-10-24 02:59:53,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1152 transitions. [2024-10-24 02:59:53,439 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1152 transitions. Word has length 59 [2024-10-24 02:59:53,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:59:53,441 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 1152 transitions. [2024-10-24 02:59:53,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 02:59:53,442 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1152 transitions. [2024-10-24 02:59:53,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-24 02:59:53,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:59:53,444 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:59:53,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 02:59:53,445 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:59:53,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:59:53,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1103850820, now seen corresponding path program 1 times [2024-10-24 02:59:53,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:59:53,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687479296] [2024-10-24 02:59:53,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:59:53,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:59:53,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:53,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 02:59:53,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:53,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 02:59:53,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:53,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 02:59:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:53,559 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 02:59:53,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:59:53,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687479296] [2024-10-24 02:59:53,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687479296] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 02:59:53,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026345241] [2024-10-24 02:59:53,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:59:53,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 02:59:53,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 02:59:53,567 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 02:59:53,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 02:59:53,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:53,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 02:59:53,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 02:59:53,712 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-24 02:59:53,712 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 02:59:53,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026345241] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:59:53,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 02:59:53,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-24 02:59:53,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888929845] [2024-10-24 02:59:53,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:59:53,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 02:59:53,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:59:53,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 02:59:53,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 02:59:53,715 INFO L87 Difference]: Start difference. First operand 824 states and 1152 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 02:59:53,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:59:53,850 INFO L93 Difference]: Finished difference Result 1312 states and 1826 transitions. [2024-10-24 02:59:53,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 02:59:53,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-10-24 02:59:53,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:59:53,857 INFO L225 Difference]: With dead ends: 1312 [2024-10-24 02:59:53,857 INFO L226 Difference]: Without dead ends: 829 [2024-10-24 02:59:53,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 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-24 02:59:53,860 INFO L432 NwaCegarLoop]: 382 mSDtfsCounter, 0 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 02:59:53,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1141 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 02:59:53,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2024-10-24 02:59:53,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 829. [2024-10-24 02:59:53,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 721 states have (on average 1.374479889042996) internal successors, (991), 732 states have internal predecessors, (991), 66 states have call successors, (66), 35 states have call predecessors, (66), 40 states have return successors, (92), 62 states have call predecessors, (92), 64 states have call successors, (92) [2024-10-24 02:59:53,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1149 transitions. [2024-10-24 02:59:53,906 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1149 transitions. Word has length 60 [2024-10-24 02:59:53,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:59:53,906 INFO L471 AbstractCegarLoop]: Abstraction has 829 states and 1149 transitions. [2024-10-24 02:59:53,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 02:59:53,906 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1149 transitions. [2024-10-24 02:59:53,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-24 02:59:53,908 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:59:53,909 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:59:53,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 02:59:54,109 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,SelfDestructingSolverStorable5 [2024-10-24 02:59:54,110 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:59:54,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:59:54,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1947856322, now seen corresponding path program 1 times [2024-10-24 02:59:54,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:59:54,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541873239] [2024-10-24 02:59:54,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:59:54,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:59:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:54,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 02:59:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:54,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 02:59:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:54,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 02:59:54,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:54,213 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-24 02:59:54,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:59:54,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541873239] [2024-10-24 02:59:54,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541873239] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 02:59:54,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619104281] [2024-10-24 02:59:54,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:59:54,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 02:59:54,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 02:59:54,216 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 02:59:54,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 02:59:54,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:54,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 02:59:54,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 02:59:54,327 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 02:59:54,327 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 02:59:54,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619104281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:59:54,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 02:59:54,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-24 02:59:54,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762039748] [2024-10-24 02:59:54,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:59:54,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 02:59:54,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:59:54,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 02:59:54,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 02:59:54,330 INFO L87 Difference]: Start difference. First operand 829 states and 1149 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 02:59:54,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:59:54,435 INFO L93 Difference]: Finished difference Result 1255 states and 1728 transitions. [2024-10-24 02:59:54,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 02:59:54,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-10-24 02:59:54,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:59:54,440 INFO L225 Difference]: With dead ends: 1255 [2024-10-24 02:59:54,440 INFO L226 Difference]: Without dead ends: 726 [2024-10-24 02:59:54,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 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-24 02:59:54,442 INFO L432 NwaCegarLoop]: 382 mSDtfsCounter, 0 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 02:59:54,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1141 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 02:59:54,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2024-10-24 02:59:54,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 719. [2024-10-24 02:59:54,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 629 states have (on average 1.3799682034976153) internal successors, (868), 638 states have internal predecessors, (868), 56 states have call successors, (56), 29 states have call predecessors, (56), 32 states have return successors, (73), 52 states have call predecessors, (73), 54 states have call successors, (73) [2024-10-24 02:59:54,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 997 transitions. [2024-10-24 02:59:54,481 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 997 transitions. Word has length 60 [2024-10-24 02:59:54,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:59:54,483 INFO L471 AbstractCegarLoop]: Abstraction has 719 states and 997 transitions. [2024-10-24 02:59:54,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 02:59:54,485 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 997 transitions. [2024-10-24 02:59:54,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-24 02:59:54,487 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:59:54,488 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:59:54,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-24 02:59:54,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-24 02:59:54,692 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:59:54,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:59:54,693 INFO L85 PathProgramCache]: Analyzing trace with hash -150216706, now seen corresponding path program 1 times [2024-10-24 02:59:54,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:59:54,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642569575] [2024-10-24 02:59:54,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:59:54,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:59:54,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:54,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 02:59:54,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:54,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 02:59:54,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:54,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 02:59:54,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:54,785 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-24 02:59:54,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:59:54,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642569575] [2024-10-24 02:59:54,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642569575] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:59:54,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:59:54,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 02:59:54,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313483070] [2024-10-24 02:59:54,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:59:54,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 02:59:54,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:59:54,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 02:59:54,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 02:59:54,787 INFO L87 Difference]: Start difference. First operand 719 states and 997 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 02:59:55,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:59:55,171 INFO L93 Difference]: Finished difference Result 804 states and 1100 transitions. [2024-10-24 02:59:55,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 02:59:55,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 60 [2024-10-24 02:59:55,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:59:55,176 INFO L225 Difference]: With dead ends: 804 [2024-10-24 02:59:55,176 INFO L226 Difference]: Without dead ends: 801 [2024-10-24 02:59:55,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 02:59:55,177 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 923 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 02:59:55,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 502 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 02:59:55,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2024-10-24 02:59:55,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 718. [2024-10-24 02:59:55,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 629 states have (on average 1.3767885532591415) internal successors, (866), 637 states have internal predecessors, (866), 55 states have call successors, (55), 29 states have call predecessors, (55), 32 states have return successors, (73), 52 states have call predecessors, (73), 54 states have call successors, (73) [2024-10-24 02:59:55,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 994 transitions. [2024-10-24 02:59:55,212 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 994 transitions. Word has length 60 [2024-10-24 02:59:55,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:59:55,212 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 994 transitions. [2024-10-24 02:59:55,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 02:59:55,212 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 994 transitions. [2024-10-24 02:59:55,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-24 02:59:55,214 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:59:55,214 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:59:55,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 02:59:55,214 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:59:55,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:59:55,215 INFO L85 PathProgramCache]: Analyzing trace with hash -362710222, now seen corresponding path program 1 times [2024-10-24 02:59:55,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:59:55,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722154879] [2024-10-24 02:59:55,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:59:55,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:59:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:55,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 02:59:55,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:55,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 02:59:55,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:55,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 02:59:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:55,382 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-24 02:59:55,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:59:55,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722154879] [2024-10-24 02:59:55,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722154879] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 02:59:55,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772395498] [2024-10-24 02:59:55,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:59:55,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 02:59:55,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 02:59:55,387 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 02:59:55,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 02:59:55,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:55,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 02:59:55,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 02:59:55,701 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:59:55,701 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 02:59:55,767 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-24 02:59:55,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772395498] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 02:59:55,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 02:59:55,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 8 [2024-10-24 02:59:55,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474976319] [2024-10-24 02:59:55,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 02:59:55,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 02:59:55,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:59:55,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 02:59:55,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 02:59:55,769 INFO L87 Difference]: Start difference. First operand 718 states and 994 transitions. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-24 02:59:56,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:59:56,569 INFO L93 Difference]: Finished difference Result 1521 states and 2029 transitions. [2024-10-24 02:59:56,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 02:59:56,570 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 61 [2024-10-24 02:59:56,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:59:56,577 INFO L225 Difference]: With dead ends: 1521 [2024-10-24 02:59:56,577 INFO L226 Difference]: Without dead ends: 1518 [2024-10-24 02:59:56,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-24 02:59:56,581 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 732 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 02:59:56,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 1431 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1064 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 02:59:56,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2024-10-24 02:59:56,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1021. [2024-10-24 02:59:56,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 896 states have (on average 1.3526785714285714) internal successors, (1212), 910 states have internal predecessors, (1212), 74 states have call successors, (74), 42 states have call predecessors, (74), 49 states have return successors, (103), 69 states have call predecessors, (103), 73 states have call successors, (103) [2024-10-24 02:59:56,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1389 transitions. [2024-10-24 02:59:56,646 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1389 transitions. Word has length 61 [2024-10-24 02:59:56,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:59:56,646 INFO L471 AbstractCegarLoop]: Abstraction has 1021 states and 1389 transitions. [2024-10-24 02:59:56,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-24 02:59:56,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1389 transitions. [2024-10-24 02:59:56,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 02:59:56,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:59:56,648 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:59:56,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 02:59:56,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 02:59:56,850 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:59:56,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:59:56,851 INFO L85 PathProgramCache]: Analyzing trace with hash 447226569, now seen corresponding path program 2 times [2024-10-24 02:59:56,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:59:56,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746963036] [2024-10-24 02:59:56,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:59:56,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:59:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:56,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 02:59:56,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:56,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 02:59:56,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:56,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 02:59:56,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:56,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 02:59:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:56,910 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-24 02:59:56,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:59:56,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746963036] [2024-10-24 02:59:56,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746963036] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:59:56,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:59:56,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 02:59:56,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382838306] [2024-10-24 02:59:56,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:59:56,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 02:59:56,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:59:56,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 02:59:56,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 02:59:56,912 INFO L87 Difference]: Start difference. First operand 1021 states and 1389 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 02:59:57,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:59:57,296 INFO L93 Difference]: Finished difference Result 1649 states and 2206 transitions. [2024-10-24 02:59:57,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 02:59:57,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 78 [2024-10-24 02:59:57,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:59:57,302 INFO L225 Difference]: With dead ends: 1649 [2024-10-24 02:59:57,302 INFO L226 Difference]: Without dead ends: 990 [2024-10-24 02:59:57,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 02:59:57,304 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 556 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 02:59:57,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 521 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 02:59:57,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2024-10-24 02:59:57,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 913. [2024-10-24 02:59:57,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 801 states have (on average 1.3533083645443196) internal successors, (1084), 815 states have internal predecessors, (1084), 67 states have call successors, (67), 37 states have call predecessors, (67), 43 states have return successors, (92), 61 states have call predecessors, (92), 66 states have call successors, (92) [2024-10-24 02:59:57,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1243 transitions. [2024-10-24 02:59:57,354 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1243 transitions. Word has length 78 [2024-10-24 02:59:57,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:59:57,356 INFO L471 AbstractCegarLoop]: Abstraction has 913 states and 1243 transitions. [2024-10-24 02:59:57,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 02:59:57,356 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1243 transitions. [2024-10-24 02:59:57,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-24 02:59:57,359 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:59:57,359 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:59:57,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 02:59:57,361 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:59:57,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:59:57,362 INFO L85 PathProgramCache]: Analyzing trace with hash 48056276, now seen corresponding path program 1 times [2024-10-24 02:59:57,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:59:57,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136464756] [2024-10-24 02:59:57,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:59:57,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:59:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:57,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 02:59:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:57,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 02:59:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:57,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 02:59:57,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:57,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 02:59:57,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:57,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 02:59:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:57,447 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-24 02:59:57,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:59:57,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136464756] [2024-10-24 02:59:57,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136464756] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 02:59:57,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387265331] [2024-10-24 02:59:57,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:59:57,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 02:59:57,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 02:59:57,450 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 02:59:57,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 02:59:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:57,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 02:59:57,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 02:59:57,575 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-24 02:59:57,575 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 02:59:57,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387265331] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:59:57,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 02:59:57,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-24 02:59:57,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198325883] [2024-10-24 02:59:57,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:59:57,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 02:59:57,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:59:57,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 02:59:57,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 02:59:57,577 INFO L87 Difference]: Start difference. First operand 913 states and 1243 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-24 02:59:57,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:59:57,686 INFO L93 Difference]: Finished difference Result 1196 states and 1599 transitions. [2024-10-24 02:59:57,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 02:59:57,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 92 [2024-10-24 02:59:57,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:59:57,689 INFO L225 Difference]: With dead ends: 1196 [2024-10-24 02:59:57,689 INFO L226 Difference]: Without dead ends: 209 [2024-10-24 02:59:57,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 02:59:57,691 INFO L432 NwaCegarLoop]: 416 mSDtfsCounter, 55 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 02:59:57,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 776 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 02:59:57,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-10-24 02:59:57,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2024-10-24 02:59:57,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 182 states have (on average 1.598901098901099) internal successors, (291), 183 states have internal predecessors, (291), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 02:59:57,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 331 transitions. [2024-10-24 02:59:57,702 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 331 transitions. Word has length 92 [2024-10-24 02:59:57,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:59:57,702 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 331 transitions. [2024-10-24 02:59:57,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-24 02:59:57,702 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 331 transitions. [2024-10-24 02:59:57,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 02:59:57,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:59:57,703 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:59:57,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-24 02:59:57,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 02:59:57,908 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:59:57,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:59:57,908 INFO L85 PathProgramCache]: Analyzing trace with hash -9347914, now seen corresponding path program 1 times [2024-10-24 02:59:57,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:59:57,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639714369] [2024-10-24 02:59:57,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:59:57,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:59:57,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:57,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:59:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:57,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 02:59:57,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:57,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 02:59:57,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:58,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 02:59:58,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:58,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 02:59:58,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:58,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:59:58,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:59:58,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639714369] [2024-10-24 02:59:58,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639714369] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:59:58,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:59:58,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 02:59:58,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619106260] [2024-10-24 02:59:58,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:59:58,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 02:59:58,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:59:58,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 02:59:58,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 02:59:58,010 INFO L87 Difference]: Start difference. First operand 209 states and 331 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:59:58,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:59:58,896 INFO L93 Difference]: Finished difference Result 480 states and 774 transitions. [2024-10-24 02:59:58,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 02:59:58,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-10-24 02:59:58,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:59:58,899 INFO L225 Difference]: With dead ends: 480 [2024-10-24 02:59:58,899 INFO L226 Difference]: Without dead ends: 279 [2024-10-24 02:59:58,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 02:59:58,901 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 552 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 02:59:58,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 376 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 02:59:58,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-10-24 02:59:58,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 209. [2024-10-24 02:59:58,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 182 states have (on average 1.5934065934065933) internal successors, (290), 183 states have internal predecessors, (290), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 02:59:58,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 330 transitions. [2024-10-24 02:59:58,919 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 330 transitions. Word has length 101 [2024-10-24 02:59:58,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:59:58,919 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 330 transitions. [2024-10-24 02:59:58,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:59:58,919 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 330 transitions. [2024-10-24 02:59:58,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 02:59:58,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:59:58,920 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:59:58,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 02:59:58,921 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:59:58,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:59:58,921 INFO L85 PathProgramCache]: Analyzing trace with hash 19152376, now seen corresponding path program 1 times [2024-10-24 02:59:58,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:59:58,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123659518] [2024-10-24 02:59:58,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:59:58,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:59:58,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:58,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:59:58,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:59,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 02:59:59,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:59,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 02:59:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:59,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 02:59:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:59,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 02:59:59,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:59,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:59:59,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:59:59,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123659518] [2024-10-24 02:59:59,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123659518] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:59:59,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:59:59,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 02:59:59,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600609433] [2024-10-24 02:59:59,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:59:59,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 02:59:59,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:59:59,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 02:59:59,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 02:59:59,067 INFO L87 Difference]: Start difference. First operand 209 states and 330 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:00,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:00:00,627 INFO L93 Difference]: Finished difference Result 748 states and 1212 transitions. [2024-10-24 03:00:00,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 03:00:00,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-10-24 03:00:00,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:00:00,631 INFO L225 Difference]: With dead ends: 748 [2024-10-24 03:00:00,631 INFO L226 Difference]: Without dead ends: 552 [2024-10-24 03:00:00,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-24 03:00:00,633 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 823 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 03:00:00,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [836 Valid, 631 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 03:00:00,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-24 03:00:00,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 413. [2024-10-24 03:00:00,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 364 states have (on average 1.6043956043956045) internal successors, (584), 366 states have internal predecessors, (584), 35 states have call successors, (35), 12 states have call predecessors, (35), 13 states have return successors, (38), 35 states have call predecessors, (38), 35 states have call successors, (38) [2024-10-24 03:00:00,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 657 transitions. [2024-10-24 03:00:00,667 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 657 transitions. Word has length 101 [2024-10-24 03:00:00,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:00:00,667 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 657 transitions. [2024-10-24 03:00:00,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:00,668 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 657 transitions. [2024-10-24 03:00:00,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 03:00:00,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:00:00,670 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:00:00,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 03:00:00,670 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:00:00,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:00:00,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1939422410, now seen corresponding path program 1 times [2024-10-24 03:00:00,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:00:00,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142913859] [2024-10-24 03:00:00,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:00,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:00:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:00,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:00:00,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:00,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 03:00:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:00,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 03:00:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:00,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 03:00:00,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:00,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 03:00:00,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:00,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:00:00,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:00:00,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142913859] [2024-10-24 03:00:00,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142913859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:00:00,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:00:00,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:00:00,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412059646] [2024-10-24 03:00:00,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:00:00,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:00:00,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:00:00,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:00:00,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:00:00,847 INFO L87 Difference]: Start difference. First operand 413 states and 657 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:02,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:00:02,972 INFO L93 Difference]: Finished difference Result 1233 states and 1994 transitions. [2024-10-24 03:00:02,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 03:00:02,973 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-10-24 03:00:02,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:00:02,978 INFO L225 Difference]: With dead ends: 1233 [2024-10-24 03:00:02,978 INFO L226 Difference]: Without dead ends: 833 [2024-10-24 03:00:02,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 03:00:02,980 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 844 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 2094 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 2143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-24 03:00:02,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 1186 Invalid, 2143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2094 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-24 03:00:02,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2024-10-24 03:00:03,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 602. [2024-10-24 03:00:03,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 531 states have (on average 1.5969868173258004) internal successors, (848), 534 states have internal predecessors, (848), 50 states have call successors, (50), 18 states have call predecessors, (50), 20 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2024-10-24 03:00:03,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 953 transitions. [2024-10-24 03:00:03,033 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 953 transitions. Word has length 101 [2024-10-24 03:00:03,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:00:03,034 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 953 transitions. [2024-10-24 03:00:03,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:03,034 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 953 transitions. [2024-10-24 03:00:03,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 03:00:03,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:00:03,035 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:00:03,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 03:00:03,035 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:00:03,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:00:03,036 INFO L85 PathProgramCache]: Analyzing trace with hash -62939592, now seen corresponding path program 1 times [2024-10-24 03:00:03,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:00:03,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212689676] [2024-10-24 03:00:03,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:03,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:00:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:03,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:00:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:03,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 03:00:03,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:03,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 03:00:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:03,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 03:00:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:03,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 03:00:03,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:03,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:00:03,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:00:03,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212689676] [2024-10-24 03:00:03,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212689676] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:00:03,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:00:03,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:00:03,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374121646] [2024-10-24 03:00:03,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:00:03,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:00:03,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:00:03,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:00:03,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:00:03,223 INFO L87 Difference]: Start difference. First operand 602 states and 953 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:04,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:00:04,288 INFO L93 Difference]: Finished difference Result 1428 states and 2308 transitions. [2024-10-24 03:00:04,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 03:00:04,289 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-10-24 03:00:04,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:00:04,294 INFO L225 Difference]: With dead ends: 1428 [2024-10-24 03:00:04,294 INFO L226 Difference]: Without dead ends: 839 [2024-10-24 03:00:04,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 03:00:04,298 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 613 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 1061 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 03:00:04,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 602 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1061 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 03:00:04,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2024-10-24 03:00:04,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 602. [2024-10-24 03:00:04,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 531 states have (on average 1.591337099811676) internal successors, (845), 534 states have internal predecessors, (845), 50 states have call successors, (50), 18 states have call predecessors, (50), 20 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2024-10-24 03:00:04,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 950 transitions. [2024-10-24 03:00:04,358 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 950 transitions. Word has length 101 [2024-10-24 03:00:04,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:00:04,358 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 950 transitions. [2024-10-24 03:00:04,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:04,358 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 950 transitions. [2024-10-24 03:00:04,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 03:00:04,359 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:00:04,359 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:00:04,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 03:00:04,360 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:00:04,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:00:04,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1261916602, now seen corresponding path program 1 times [2024-10-24 03:00:04,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:00:04,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276106249] [2024-10-24 03:00:04,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:04,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:00:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:04,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:00:04,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:04,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 03:00:04,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:04,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 03:00:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:04,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 03:00:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:04,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 03:00:04,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:04,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:00:04,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:00:04,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276106249] [2024-10-24 03:00:04,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276106249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:00:04,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:00:04,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:00:04,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179947294] [2024-10-24 03:00:04,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:00:04,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:00:04,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:00:04,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:00:04,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:00:04,537 INFO L87 Difference]: Start difference. First operand 602 states and 950 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:05,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:00:05,365 INFO L93 Difference]: Finished difference Result 1424 states and 2291 transitions. [2024-10-24 03:00:05,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 03:00:05,366 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-10-24 03:00:05,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:00:05,371 INFO L225 Difference]: With dead ends: 1424 [2024-10-24 03:00:05,371 INFO L226 Difference]: Without dead ends: 835 [2024-10-24 03:00:05,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 03:00:05,373 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 697 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 1011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 03:00:05,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 505 Invalid, 1011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 03:00:05,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2024-10-24 03:00:05,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 602. [2024-10-24 03:00:05,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 531 states have (on average 1.5856873822975517) internal successors, (842), 534 states have internal predecessors, (842), 50 states have call successors, (50), 18 states have call predecessors, (50), 20 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2024-10-24 03:00:05,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 947 transitions. [2024-10-24 03:00:05,428 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 947 transitions. Word has length 101 [2024-10-24 03:00:05,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:00:05,428 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 947 transitions. [2024-10-24 03:00:05,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:05,429 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 947 transitions. [2024-10-24 03:00:05,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 03:00:05,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:00:05,430 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:00:05,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 03:00:05,430 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:00:05,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:00:05,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1466292744, now seen corresponding path program 1 times [2024-10-24 03:00:05,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:00:05,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102539986] [2024-10-24 03:00:05,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:05,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:00:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:05,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:00:05,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:05,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 03:00:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:05,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 03:00:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:05,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 03:00:05,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:05,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 03:00:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:05,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:00:05,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:00:05,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102539986] [2024-10-24 03:00:05,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102539986] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:00:05,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:00:05,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:00:05,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873233087] [2024-10-24 03:00:05,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:00:05,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:00:05,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:00:05,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:00:05,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:00:05,612 INFO L87 Difference]: Start difference. First operand 602 states and 947 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:06,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:00:06,451 INFO L93 Difference]: Finished difference Result 1420 states and 2274 transitions. [2024-10-24 03:00:06,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 03:00:06,452 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-10-24 03:00:06,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:00:06,457 INFO L225 Difference]: With dead ends: 1420 [2024-10-24 03:00:06,457 INFO L226 Difference]: Without dead ends: 831 [2024-10-24 03:00:06,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 03:00:06,459 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 609 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 03:00:06,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 602 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 03:00:06,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2024-10-24 03:00:06,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 602. [2024-10-24 03:00:06,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 531 states have (on average 1.5800376647834276) internal successors, (839), 534 states have internal predecessors, (839), 50 states have call successors, (50), 18 states have call predecessors, (50), 20 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2024-10-24 03:00:06,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 944 transitions. [2024-10-24 03:00:06,516 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 944 transitions. Word has length 101 [2024-10-24 03:00:06,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:00:06,516 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 944 transitions. [2024-10-24 03:00:06,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:06,517 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 944 transitions. [2024-10-24 03:00:06,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 03:00:06,518 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:00:06,518 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:00:06,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 03:00:06,518 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:00:06,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:00:06,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1770836474, now seen corresponding path program 1 times [2024-10-24 03:00:06,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:00:06,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006871720] [2024-10-24 03:00:06,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:06,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:00:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:06,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:00:06,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:06,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 03:00:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:06,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 03:00:06,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:06,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 03:00:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:06,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 03:00:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:06,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:00:06,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:00:06,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006871720] [2024-10-24 03:00:06,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006871720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:00:06,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:00:06,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:00:06,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267492920] [2024-10-24 03:00:06,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:00:06,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:00:06,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:00:06,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:00:06,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:00:06,697 INFO L87 Difference]: Start difference. First operand 602 states and 944 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:08,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:00:08,403 INFO L93 Difference]: Finished difference Result 1930 states and 3068 transitions. [2024-10-24 03:00:08,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 03:00:08,404 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-10-24 03:00:08,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:00:08,411 INFO L225 Difference]: With dead ends: 1930 [2024-10-24 03:00:08,411 INFO L226 Difference]: Without dead ends: 1341 [2024-10-24 03:00:08,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 03:00:08,414 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 817 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 1998 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 2049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 03:00:08,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 1184 Invalid, 2049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1998 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 03:00:08,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2024-10-24 03:00:08,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 993. [2024-10-24 03:00:08,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 993 states, 878 states have (on average 1.571753986332574) internal successors, (1380), 883 states have internal predecessors, (1380), 80 states have call successors, (80), 30 states have call predecessors, (80), 34 states have return successors, (93), 83 states have call predecessors, (93), 80 states have call successors, (93) [2024-10-24 03:00:08,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1553 transitions. [2024-10-24 03:00:08,523 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1553 transitions. Word has length 101 [2024-10-24 03:00:08,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:00:08,523 INFO L471 AbstractCegarLoop]: Abstraction has 993 states and 1553 transitions. [2024-10-24 03:00:08,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:08,524 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1553 transitions. [2024-10-24 03:00:08,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 03:00:08,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:00:08,526 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:00:08,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 03:00:08,526 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:00:08,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:00:08,527 INFO L85 PathProgramCache]: Analyzing trace with hash 628334008, now seen corresponding path program 1 times [2024-10-24 03:00:08,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:00:08,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836570004] [2024-10-24 03:00:08,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:08,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:00:08,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:08,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:00:08,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:08,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 03:00:08,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:08,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 03:00:08,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:08,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 03:00:08,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:08,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 03:00:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:08,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:00:08,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:00:08,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836570004] [2024-10-24 03:00:08,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836570004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:00:08,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:00:08,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:00:08,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775360376] [2024-10-24 03:00:08,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:00:08,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:00:08,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:00:08,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:00:08,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:00:08,704 INFO L87 Difference]: Start difference. First operand 993 states and 1553 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:10,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:00:10,860 INFO L93 Difference]: Finished difference Result 3621 states and 5739 transitions. [2024-10-24 03:00:10,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 03:00:10,861 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-10-24 03:00:10,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:00:10,872 INFO L225 Difference]: With dead ends: 3621 [2024-10-24 03:00:10,873 INFO L226 Difference]: Without dead ends: 2641 [2024-10-24 03:00:10,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-24 03:00:10,876 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 872 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 2353 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 2406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 03:00:10,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 1177 Invalid, 2406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2353 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 03:00:10,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2641 states. [2024-10-24 03:00:11,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2641 to 1762. [2024-10-24 03:00:11,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1762 states, 1563 states have (on average 1.564939219449776) internal successors, (2446), 1572 states have internal predecessors, (2446), 136 states have call successors, (136), 54 states have call predecessors, (136), 62 states have return successors, (171), 143 states have call predecessors, (171), 136 states have call successors, (171) [2024-10-24 03:00:11,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 2753 transitions. [2024-10-24 03:00:11,064 INFO L78 Accepts]: Start accepts. Automaton has 1762 states and 2753 transitions. Word has length 101 [2024-10-24 03:00:11,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:00:11,065 INFO L471 AbstractCegarLoop]: Abstraction has 1762 states and 2753 transitions. [2024-10-24 03:00:11,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:11,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 2753 transitions. [2024-10-24 03:00:11,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 03:00:11,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:00:11,067 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:00:11,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 03:00:11,068 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:00:11,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:00:11,068 INFO L85 PathProgramCache]: Analyzing trace with hash 868573754, now seen corresponding path program 1 times [2024-10-24 03:00:11,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:00:11,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72027496] [2024-10-24 03:00:11,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:11,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:00:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:11,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:00:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:11,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 03:00:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:11,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 03:00:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:11,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 03:00:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:11,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 03:00:11,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:11,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:00:11,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:00:11,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72027496] [2024-10-24 03:00:11,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72027496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:00:11,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:00:11,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:00:11,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048035034] [2024-10-24 03:00:11,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:00:11,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:00:11,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:00:11,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:00:11,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:00:11,251 INFO L87 Difference]: Start difference. First operand 1762 states and 2753 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:13,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:00:13,143 INFO L93 Difference]: Finished difference Result 6564 states and 10393 transitions. [2024-10-24 03:00:13,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 03:00:13,143 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-10-24 03:00:13,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:00:13,165 INFO L225 Difference]: With dead ends: 6564 [2024-10-24 03:00:13,165 INFO L226 Difference]: Without dead ends: 4815 [2024-10-24 03:00:13,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-24 03:00:13,171 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 1051 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 1729 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 1801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 03:00:13,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1071 Valid, 820 Invalid, 1801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1729 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 03:00:13,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4815 states. [2024-10-24 03:00:13,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4815 to 3259. [2024-10-24 03:00:13,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3259 states, 2896 states have (on average 1.5607734806629834) internal successors, (4520), 2913 states have internal predecessors, (4520), 244 states have call successors, (244), 102 states have call predecessors, (244), 118 states have return successors, (341), 259 states have call predecessors, (341), 244 states have call successors, (341) [2024-10-24 03:00:13,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3259 states to 3259 states and 5105 transitions. [2024-10-24 03:00:13,518 INFO L78 Accepts]: Start accepts. Automaton has 3259 states and 5105 transitions. Word has length 101 [2024-10-24 03:00:13,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:00:13,519 INFO L471 AbstractCegarLoop]: Abstraction has 3259 states and 5105 transitions. [2024-10-24 03:00:13,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:13,519 INFO L276 IsEmpty]: Start isEmpty. Operand 3259 states and 5105 transitions. [2024-10-24 03:00:13,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 03:00:13,522 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:00:13,522 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:00:13,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 03:00:13,522 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:00:13,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:00:13,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1707607416, now seen corresponding path program 1 times [2024-10-24 03:00:13,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:00:13,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339388826] [2024-10-24 03:00:13,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:13,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:00:13,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:13,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:00:13,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:13,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 03:00:13,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:13,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 03:00:13,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:13,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 03:00:13,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:13,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 03:00:13,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:13,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:00:13,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:00:13,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339388826] [2024-10-24 03:00:13,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339388826] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:00:13,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:00:13,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:00:13,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140495005] [2024-10-24 03:00:13,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:00:13,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:00:13,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:00:13,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:00:13,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:00:13,737 INFO L87 Difference]: Start difference. First operand 3259 states and 5105 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:14,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:00:14,955 INFO L93 Difference]: Finished difference Result 7468 states and 11865 transitions. [2024-10-24 03:00:14,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 03:00:14,956 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-10-24 03:00:14,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:00:14,975 INFO L225 Difference]: With dead ends: 7468 [2024-10-24 03:00:14,976 INFO L226 Difference]: Without dead ends: 4222 [2024-10-24 03:00:14,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 03:00:14,987 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 613 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 03:00:14,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 601 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 03:00:14,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4222 states. [2024-10-24 03:00:15,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4222 to 3259. [2024-10-24 03:00:15,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3259 states, 2896 states have (on average 1.554903314917127) internal successors, (4503), 2913 states have internal predecessors, (4503), 244 states have call successors, (244), 102 states have call predecessors, (244), 118 states have return successors, (341), 259 states have call predecessors, (341), 244 states have call successors, (341) [2024-10-24 03:00:15,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3259 states to 3259 states and 5088 transitions. [2024-10-24 03:00:15,301 INFO L78 Accepts]: Start accepts. Automaton has 3259 states and 5088 transitions. Word has length 101 [2024-10-24 03:00:15,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:00:15,301 INFO L471 AbstractCegarLoop]: Abstraction has 3259 states and 5088 transitions. [2024-10-24 03:00:15,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:15,301 INFO L276 IsEmpty]: Start isEmpty. Operand 3259 states and 5088 transitions. [2024-10-24 03:00:15,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 03:00:15,305 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:00:15,305 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:00:15,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 03:00:15,305 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:00:15,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:00:15,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1734673018, now seen corresponding path program 1 times [2024-10-24 03:00:15,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:00:15,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060694432] [2024-10-24 03:00:15,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:15,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:00:15,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:15,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:00:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:15,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 03:00:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:15,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 03:00:15,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:15,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 03:00:15,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:15,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 03:00:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:15,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:00:15,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:00:15,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060694432] [2024-10-24 03:00:15,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060694432] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:00:15,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:00:15,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:00:15,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839379038] [2024-10-24 03:00:15,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:00:15,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:00:15,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:00:15,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:00:15,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:00:15,476 INFO L87 Difference]: Start difference. First operand 3259 states and 5088 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:17,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:00:17,736 INFO L93 Difference]: Finished difference Result 11799 states and 18643 transitions. [2024-10-24 03:00:17,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 03:00:17,737 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-10-24 03:00:17,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:00:17,770 INFO L225 Difference]: With dead ends: 11799 [2024-10-24 03:00:17,771 INFO L226 Difference]: Without dead ends: 8553 [2024-10-24 03:00:17,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-24 03:00:17,783 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 893 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 1905 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 1959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 03:00:17,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 1177 Invalid, 1959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1905 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 03:00:17,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8553 states. [2024-10-24 03:00:18,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8553 to 6326. [2024-10-24 03:00:18,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6326 states, 5643 states have (on average 1.553251816409711) internal successors, (8765), 5676 states have internal predecessors, (8765), 452 states have call successors, (452), 198 states have call predecessors, (452), 230 states have return successors, (727), 483 states have call predecessors, (727), 452 states have call successors, (727) [2024-10-24 03:00:18,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6326 states to 6326 states and 9944 transitions. [2024-10-24 03:00:18,434 INFO L78 Accepts]: Start accepts. Automaton has 6326 states and 9944 transitions. Word has length 101 [2024-10-24 03:00:18,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:00:18,435 INFO L471 AbstractCegarLoop]: Abstraction has 6326 states and 9944 transitions. [2024-10-24 03:00:18,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:18,437 INFO L276 IsEmpty]: Start isEmpty. Operand 6326 states and 9944 transitions. [2024-10-24 03:00:18,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 03:00:18,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:00:18,442 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:00:18,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 03:00:18,443 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:00:18,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:00:18,443 INFO L85 PathProgramCache]: Analyzing trace with hash -826189828, now seen corresponding path program 1 times [2024-10-24 03:00:18,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:00:18,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923169070] [2024-10-24 03:00:18,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:18,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:00:18,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:18,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:00:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:18,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 03:00:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:18,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 03:00:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:18,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 03:00:18,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:18,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 03:00:18,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:18,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:00:18,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:00:18,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923169070] [2024-10-24 03:00:18,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923169070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:00:18,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:00:18,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:00:18,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326615266] [2024-10-24 03:00:18,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:00:18,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:00:18,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:00:18,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:00:18,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:00:18,634 INFO L87 Difference]: Start difference. First operand 6326 states and 9944 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:19,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:00:19,989 INFO L93 Difference]: Finished difference Result 14300 states and 22764 transitions. [2024-10-24 03:00:19,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 03:00:19,990 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-10-24 03:00:19,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:00:20,024 INFO L225 Difference]: With dead ends: 14300 [2024-10-24 03:00:20,025 INFO L226 Difference]: Without dead ends: 7987 [2024-10-24 03:00:20,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 03:00:20,045 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 697 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 03:00:20,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 504 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 03:00:20,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7987 states. [2024-10-24 03:00:20,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7987 to 6326. [2024-10-24 03:00:20,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6326 states, 5643 states have (on average 1.547403863193337) internal successors, (8732), 5676 states have internal predecessors, (8732), 452 states have call successors, (452), 198 states have call predecessors, (452), 230 states have return successors, (727), 483 states have call predecessors, (727), 452 states have call successors, (727) [2024-10-24 03:00:20,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6326 states to 6326 states and 9911 transitions. [2024-10-24 03:00:20,636 INFO L78 Accepts]: Start accepts. Automaton has 6326 states and 9911 transitions. Word has length 101 [2024-10-24 03:00:20,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:00:20,637 INFO L471 AbstractCegarLoop]: Abstraction has 6326 states and 9911 transitions. [2024-10-24 03:00:20,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:20,638 INFO L276 IsEmpty]: Start isEmpty. Operand 6326 states and 9911 transitions. [2024-10-24 03:00:20,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 03:00:20,643 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:00:20,643 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:00:20,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-24 03:00:20,643 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:00:20,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:00:20,644 INFO L85 PathProgramCache]: Analyzing trace with hash 61033018, now seen corresponding path program 1 times [2024-10-24 03:00:20,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:00:20,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592047622] [2024-10-24 03:00:20,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:20,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:00:20,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:20,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:00:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:20,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 03:00:20,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:20,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 03:00:20,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:20,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 03:00:20,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:20,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 03:00:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:20,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:00:20,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:00:20,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592047622] [2024-10-24 03:00:20,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592047622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:00:20,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:00:20,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:00:20,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160671523] [2024-10-24 03:00:20,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:00:20,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:00:20,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:00:20,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:00:20,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:00:20,821 INFO L87 Difference]: Start difference. First operand 6326 states and 9911 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:23,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:00:23,682 INFO L93 Difference]: Finished difference Result 22174 states and 35109 transitions. [2024-10-24 03:00:23,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 03:00:23,682 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-10-24 03:00:23,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:00:23,736 INFO L225 Difference]: With dead ends: 22174 [2024-10-24 03:00:23,736 INFO L226 Difference]: Without dead ends: 15861 [2024-10-24 03:00:23,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-24 03:00:23,759 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 812 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 1865 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 832 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 1920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 03:00:23,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [832 Valid, 1177 Invalid, 1920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1865 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 03:00:23,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15861 states. [2024-10-24 03:00:24,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15861 to 12488. [2024-10-24 03:00:24,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12488 states, 11181 states have (on average 1.5454789374832305) internal successors, (17280), 11246 states have internal predecessors, (17280), 852 states have call successors, (852), 390 states have call predecessors, (852), 454 states have return successors, (1645), 915 states have call predecessors, (1645), 852 states have call successors, (1645) [2024-10-24 03:00:24,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12488 states to 12488 states and 19777 transitions. [2024-10-24 03:00:24,833 INFO L78 Accepts]: Start accepts. Automaton has 12488 states and 19777 transitions. Word has length 101 [2024-10-24 03:00:24,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:00:24,833 INFO L471 AbstractCegarLoop]: Abstraction has 12488 states and 19777 transitions. [2024-10-24 03:00:24,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:24,833 INFO L276 IsEmpty]: Start isEmpty. Operand 12488 states and 19777 transitions. [2024-10-24 03:00:24,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 03:00:24,843 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:00:24,843 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:00:24,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-24 03:00:24,844 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:00:24,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:00:24,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1850009540, now seen corresponding path program 1 times [2024-10-24 03:00:24,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:00:24,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079159069] [2024-10-24 03:00:24,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:24,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:00:24,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:24,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:00:24,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:24,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 03:00:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:24,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 03:00:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:24,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 03:00:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:24,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 03:00:24,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:24,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:00:24,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:00:24,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079159069] [2024-10-24 03:00:24,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079159069] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:00:24,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:00:24,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 03:00:24,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456001315] [2024-10-24 03:00:24,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:00:24,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 03:00:24,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:00:24,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 03:00:24,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 03:00:24,981 INFO L87 Difference]: Start difference. First operand 12488 states and 19777 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:27,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:00:27,325 INFO L93 Difference]: Finished difference Result 27995 states and 44699 transitions. [2024-10-24 03:00:27,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 03:00:27,326 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-10-24 03:00:27,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:00:27,401 INFO L225 Difference]: With dead ends: 27995 [2024-10-24 03:00:27,402 INFO L226 Difference]: Without dead ends: 15521 [2024-10-24 03:00:27,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-24 03:00:27,447 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 272 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 03:00:27,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 678 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 03:00:27,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15521 states. [2024-10-24 03:00:28,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15521 to 12618. [2024-10-24 03:00:28,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12618 states, 11311 states have (on average 1.5392096189549995) internal successors, (17410), 11376 states have internal predecessors, (17410), 852 states have call successors, (852), 390 states have call predecessors, (852), 454 states have return successors, (1645), 915 states have call predecessors, (1645), 852 states have call successors, (1645) [2024-10-24 03:00:28,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12618 states to 12618 states and 19907 transitions. [2024-10-24 03:00:28,626 INFO L78 Accepts]: Start accepts. Automaton has 12618 states and 19907 transitions. Word has length 101 [2024-10-24 03:00:28,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:00:28,626 INFO L471 AbstractCegarLoop]: Abstraction has 12618 states and 19907 transitions. [2024-10-24 03:00:28,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:28,627 INFO L276 IsEmpty]: Start isEmpty. Operand 12618 states and 19907 transitions. [2024-10-24 03:00:28,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 03:00:28,637 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:00:28,637 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:00:28,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-24 03:00:28,638 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:00:28,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:00:28,638 INFO L85 PathProgramCache]: Analyzing trace with hash 758777918, now seen corresponding path program 1 times [2024-10-24 03:00:28,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:00:28,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637684791] [2024-10-24 03:00:28,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:28,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:00:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:28,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:00:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:28,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 03:00:28,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:28,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 03:00:28,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:28,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 03:00:28,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:28,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 03:00:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:28,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:00:28,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:00:28,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637684791] [2024-10-24 03:00:28,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637684791] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:00:28,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:00:28,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:00:28,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118989961] [2024-10-24 03:00:28,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:00:28,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:00:28,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:00:28,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:00:28,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:00:28,796 INFO L87 Difference]: Start difference. First operand 12618 states and 19907 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:34,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:00:34,307 INFO L93 Difference]: Finished difference Result 57637 states and 92903 transitions. [2024-10-24 03:00:34,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 03:00:34,308 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-10-24 03:00:34,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:00:34,549 INFO L225 Difference]: With dead ends: 57637 [2024-10-24 03:00:34,550 INFO L226 Difference]: Without dead ends: 45033 [2024-10-24 03:00:34,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2024-10-24 03:00:34,632 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 2180 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 1924 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2202 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 2191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 1924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 03:00:34,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2202 Valid, 1007 Invalid, 2191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 1924 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 03:00:34,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45033 states. [2024-10-24 03:00:37,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45033 to 36903. [2024-10-24 03:00:37,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36903 states, 33036 states have (on average 1.5309662186705413) internal successors, (50577), 33328 states have internal predecessors, (50577), 2498 states have call successors, (2498), 1176 states have call predecessors, (2498), 1368 states have return successors, (5226), 2462 states have call predecessors, (5226), 2498 states have call successors, (5226) [2024-10-24 03:00:38,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36903 states to 36903 states and 58301 transitions. [2024-10-24 03:00:38,116 INFO L78 Accepts]: Start accepts. Automaton has 36903 states and 58301 transitions. Word has length 101 [2024-10-24 03:00:38,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:00:38,117 INFO L471 AbstractCegarLoop]: Abstraction has 36903 states and 58301 transitions. [2024-10-24 03:00:38,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:38,117 INFO L276 IsEmpty]: Start isEmpty. Operand 36903 states and 58301 transitions. [2024-10-24 03:00:38,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-24 03:00:38,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:00:38,198 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:00:38,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-24 03:00:38,199 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:00:38,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:00:38,200 INFO L85 PathProgramCache]: Analyzing trace with hash -2053074634, now seen corresponding path program 1 times [2024-10-24 03:00:38,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:00:38,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554084087] [2024-10-24 03:00:38,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:38,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:00:38,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:38,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:00:38,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:38,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 03:00:38,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:38,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 03:00:38,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:38,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 03:00:38,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:38,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 03:00:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:38,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 03:00:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:38,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 03:00:38,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:38,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 03:00:38,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:38,351 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-24 03:00:38,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:00:38,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554084087] [2024-10-24 03:00:38,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554084087] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 03:00:38,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333880848] [2024-10-24 03:00:38,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:38,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:00:38,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 03:00:38,354 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 03:00:38,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-24 03:00:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:38,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 03:00:38,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 03:00:38,566 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-24 03:00:38,566 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 03:00:38,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333880848] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:00:38,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 03:00:38,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-24 03:00:38,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432704136] [2024-10-24 03:00:38,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:00:38,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 03:00:38,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:00:38,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 03:00:38,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:00:38,568 INFO L87 Difference]: Start difference. First operand 36903 states and 58301 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 03:00:44,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:00:44,787 INFO L93 Difference]: Finished difference Result 109896 states and 175258 transitions. [2024-10-24 03:00:44,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 03:00:44,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 163 [2024-10-24 03:00:44,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:00:45,208 INFO L225 Difference]: With dead ends: 109896 [2024-10-24 03:00:45,208 INFO L226 Difference]: Without dead ends: 73007 [2024-10-24 03:00:45,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:00:45,298 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 273 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 03:00:45,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 566 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 03:00:45,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73007 states. [2024-10-24 03:00:51,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73007 to 72809. [2024-10-24 03:00:51,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72809 states, 65276 states have (on average 1.5283411973772902) internal successors, (99764), 65859 states have internal predecessors, (99764), 4796 states have call successors, (4796), 2352 states have call predecessors, (4796), 2736 states have return successors, (10090), 4661 states have call predecessors, (10090), 4796 states have call successors, (10090) [2024-10-24 03:00:51,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72809 states to 72809 states and 114650 transitions. [2024-10-24 03:00:51,883 INFO L78 Accepts]: Start accepts. Automaton has 72809 states and 114650 transitions. Word has length 163 [2024-10-24 03:00:51,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:00:51,883 INFO L471 AbstractCegarLoop]: Abstraction has 72809 states and 114650 transitions. [2024-10-24 03:00:51,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 03:00:51,883 INFO L276 IsEmpty]: Start isEmpty. Operand 72809 states and 114650 transitions. [2024-10-24 03:00:52,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-24 03:00:52,256 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:00:52,256 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:00:52,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-24 03:00:52,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-24 03:00:52,457 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:00:52,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:00:52,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1087237674, now seen corresponding path program 1 times [2024-10-24 03:00:52,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:00:52,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843014684] [2024-10-24 03:00:52,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:52,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:00:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:52,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:00:52,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:52,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 03:00:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:52,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 03:00:52,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:52,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 03:00:52,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:52,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 03:00:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:52,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 03:00:52,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:52,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 03:00:52,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:52,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 03:00:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:52,612 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-24 03:00:52,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:00:52,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843014684] [2024-10-24 03:00:52,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843014684] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 03:00:52,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284653106] [2024-10-24 03:00:52,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:52,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:00:52,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 03:00:52,615 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 03:00:52,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-24 03:00:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:52,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 03:00:52,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 03:00:52,833 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-24 03:00:52,833 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 03:00:52,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284653106] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:00:52,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 03:00:52,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-24 03:00:52,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022971109] [2024-10-24 03:00:52,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:00:52,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 03:00:52,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:00:52,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 03:00:52,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:00:52,835 INFO L87 Difference]: Start difference. First operand 72809 states and 114650 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)