./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+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 0becd5109c9f10d4cd495bd258560ff3ae7f6a1dd143c8dd06621d725fa7a35e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 22:56:12,987 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 22:56:13,087 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 22:56:13,092 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 22:56:13,093 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 22:56:13,117 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 22:56:13,119 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 22:56:13,120 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 22:56:13,120 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 22:56:13,121 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 22:56:13,122 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 22:56:13,122 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 22:56:13,122 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 22:56:13,123 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 22:56:13,124 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 22:56:13,124 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 22:56:13,125 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 22:56:13,125 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 22:56:13,125 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 22:56:13,125 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 22:56:13,126 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 22:56:13,128 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 22:56:13,129 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 22:56:13,129 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 22:56:13,129 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 22:56:13,129 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 22:56:13,129 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 22:56:13,130 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 22:56:13,130 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 22:56:13,130 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 22:56:13,130 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 22:56:13,130 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 22:56:13,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:56:13,131 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 22:56:13,131 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 22:56:13,131 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 22:56:13,131 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 22:56:13,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 22:56:13,132 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 22:56:13,132 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 22:56:13,132 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 22:56:13,132 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 22:56:13,132 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 -> 0becd5109c9f10d4cd495bd258560ff3ae7f6a1dd143c8dd06621d725fa7a35e [2024-11-11 22:56:13,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 22:56:13,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 22:56:13,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 22:56:13,334 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 22:56:13,335 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 22:56:13,335 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-2.c [2024-11-11 22:56:14,539 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 22:56:14,713 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 22:56:14,713 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-2.c [2024-11-11 22:56:14,732 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67f22cfe6/481414c672794f4a8e9390e6012f6f4e/FLAG98d30bdd0 [2024-11-11 22:56:14,747 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67f22cfe6/481414c672794f4a8e9390e6012f6f4e [2024-11-11 22:56:14,749 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 22:56:14,751 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 22:56:14,753 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 22:56:14,754 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 22:56:14,758 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 22:56:14,758 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:56:14" (1/1) ... [2024-11-11 22:56:14,759 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a7ba445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:56:14, skipping insertion in model container [2024-11-11 22:56:14,760 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:56:14" (1/1) ... [2024-11-11 22:56:14,801 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 22:56:14,941 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-2.c[914,927] [2024-11-11 22:56:15,024 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-2.c[7115,7128] [2024-11-11 22:56:15,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:56:15,088 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 22:56:15,097 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-2.c[914,927] [2024-11-11 22:56:15,109 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-2.c[7115,7128] [2024-11-11 22:56:15,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:56:15,169 INFO L204 MainTranslator]: Completed translation [2024-11-11 22:56:15,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:56:15 WrapperNode [2024-11-11 22:56:15,169 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 22:56:15,170 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 22:56:15,170 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 22:56:15,170 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 22:56:15,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:56:15" (1/1) ... [2024-11-11 22:56:15,186 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:56:15" (1/1) ... [2024-11-11 22:56:15,219 INFO L138 Inliner]: procedures = 65, calls = 75, calls flagged for inlining = 34, calls inlined = 34, statements flattened = 708 [2024-11-11 22:56:15,219 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 22:56:15,220 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 22:56:15,220 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 22:56:15,220 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 22:56:15,228 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:56:15" (1/1) ... [2024-11-11 22:56:15,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:56:15" (1/1) ... [2024-11-11 22:56:15,232 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:56:15" (1/1) ... [2024-11-11 22:56:15,245 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-11-11 22:56:15,245 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:56:15" (1/1) ... [2024-11-11 22:56:15,246 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:56:15" (1/1) ... [2024-11-11 22:56:15,253 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:56:15" (1/1) ... [2024-11-11 22:56:15,263 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:56:15" (1/1) ... [2024-11-11 22:56:15,265 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:56:15" (1/1) ... [2024-11-11 22:56:15,267 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:56:15" (1/1) ... [2024-11-11 22:56:15,277 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 22:56:15,279 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 22:56:15,279 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 22:56:15,279 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 22:56:15,280 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:56:15" (1/1) ... [2024-11-11 22:56:15,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:56:15,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:56:15,311 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 22:56:15,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 22:56:15,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 22:56:15,351 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-11 22:56:15,351 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-11 22:56:15,351 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-11 22:56:15,351 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-11 22:56:15,351 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-11 22:56:15,352 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-11 22:56:15,352 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-11 22:56:15,352 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-11 22:56:15,352 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-11 22:56:15,353 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-11 22:56:15,353 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-11 22:56:15,353 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-11 22:56:15,353 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-11 22:56:15,353 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-11 22:56:15,353 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-11 22:56:15,353 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-11 22:56:15,353 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-11 22:56:15,353 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-11 22:56:15,353 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-11 22:56:15,353 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-11 22:56:15,353 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-11 22:56:15,353 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-11 22:56:15,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 22:56:15,354 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-11 22:56:15,354 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-11 22:56:15,354 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-11 22:56:15,354 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-11 22:56:15,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 22:56:15,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 22:56:15,354 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-11 22:56:15,354 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-11 22:56:15,441 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 22:56:15,443 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 22:56:15,997 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2024-11-11 22:56:15,997 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 22:56:16,019 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 22:56:16,020 INFO L316 CfgBuilder]: Removed 13 assume(true) statements. [2024-11-11 22:56:16,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:56:16 BoogieIcfgContainer [2024-11-11 22:56:16,020 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 22:56:16,022 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 22:56:16,022 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 22:56:16,025 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 22:56:16,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 10:56:14" (1/3) ... [2024-11-11 22:56:16,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b0081bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:56:16, skipping insertion in model container [2024-11-11 22:56:16,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:56:15" (2/3) ... [2024-11-11 22:56:16,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b0081bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:56:16, skipping insertion in model container [2024-11-11 22:56:16,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:56:16" (3/3) ... [2024-11-11 22:56:16,027 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.06.cil-2.c [2024-11-11 22:56:16,039 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 22:56:16,039 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-11 22:56:16,094 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 22:56:16,098 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;@7e045a57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 22:56:16,098 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-11 22:56:16,102 INFO L276 IsEmpty]: Start isEmpty. Operand has 340 states, 289 states have (on average 1.5916955017301038) internal successors, (460), 295 states have internal predecessors, (460), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-11 22:56:16,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 22:56:16,110 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:16,111 INFO L218 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] [2024-11-11 22:56:16,111 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:16,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:16,115 INFO L85 PathProgramCache]: Analyzing trace with hash 101040065, now seen corresponding path program 1 times [2024-11-11 22:56:16,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:16,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708010953] [2024-11-11 22:56:16,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:16,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:16,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:16,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:16,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:56:16,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:16,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:56:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:16,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:56:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:16,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:56:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:16,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:56:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:16,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:56:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:16,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:16,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:16,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708010953] [2024-11-11 22:56:16,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708010953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:16,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:16,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 22:56:16,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701665470] [2024-11-11 22:56:16,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:16,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 22:56:16,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:16,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 22:56:16,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:56:16,590 INFO L87 Difference]: Start difference. First operand has 340 states, 289 states have (on average 1.5916955017301038) internal successors, (460), 295 states have internal predecessors, (460), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 22:56:17,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:17,580 INFO L93 Difference]: Finished difference Result 793 states and 1226 transitions. [2024-11-11 22:56:17,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:56:17,582 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-11-11 22:56:17,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:17,599 INFO L225 Difference]: With dead ends: 793 [2024-11-11 22:56:17,599 INFO L226 Difference]: Without dead ends: 465 [2024-11-11 22:56:17,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:56:17,608 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 623 mSDsluCounter, 1397 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 1692 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:17,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 1692 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 22:56:17,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-11-11 22:56:17,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 426. [2024-11-11 22:56:17,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 357 states have (on average 1.4761904761904763) internal successors, (527), 363 states have internal predecessors, (527), 45 states have call successors, (45), 21 states have call predecessors, (45), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2024-11-11 22:56:17,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 620 transitions. [2024-11-11 22:56:17,670 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 620 transitions. Word has length 65 [2024-11-11 22:56:17,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:17,671 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 620 transitions. [2024-11-11 22:56:17,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 22:56:17,671 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 620 transitions. [2024-11-11 22:56:17,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 22:56:17,674 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:17,674 INFO L218 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] [2024-11-11 22:56:17,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 22:56:17,674 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:17,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:17,675 INFO L85 PathProgramCache]: Analyzing trace with hash 504826016, now seen corresponding path program 1 times [2024-11-11 22:56:17,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:17,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053828082] [2024-11-11 22:56:17,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:17,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:17,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:17,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:17,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:17,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:56:17,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:17,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:56:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:17,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:56:17,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:17,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:56:17,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:17,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:56:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:17,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:56:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:17,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:17,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:17,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053828082] [2024-11-11 22:56:17,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053828082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:17,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:17,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 22:56:17,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090064626] [2024-11-11 22:56:17,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:17,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 22:56:17,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:17,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 22:56:17,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:56:17,864 INFO L87 Difference]: Start difference. First operand 426 states and 620 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 22:56:18,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:18,761 INFO L93 Difference]: Finished difference Result 773 states and 1097 transitions. [2024-11-11 22:56:18,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-11 22:56:18,761 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-11-11 22:56:18,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:18,765 INFO L225 Difference]: With dead ends: 773 [2024-11-11 22:56:18,765 INFO L226 Difference]: Without dead ends: 596 [2024-11-11 22:56:18,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-11 22:56:18,767 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 1238 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1264 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 1327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:18,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1264 Valid, 1438 Invalid, 1327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1150 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 22:56:18,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2024-11-11 22:56:18,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 522. [2024-11-11 22:56:18,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 433 states have (on average 1.4572748267898383) internal successors, (631), 441 states have internal predecessors, (631), 56 states have call successors, (56), 28 states have call predecessors, (56), 31 states have return successors, (67), 56 states have call predecessors, (67), 54 states have call successors, (67) [2024-11-11 22:56:18,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 754 transitions. [2024-11-11 22:56:18,820 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 754 transitions. Word has length 65 [2024-11-11 22:56:18,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:18,821 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 754 transitions. [2024-11-11 22:56:18,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 22:56:18,821 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 754 transitions. [2024-11-11 22:56:18,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 22:56:18,825 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:18,825 INFO L218 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] [2024-11-11 22:56:18,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 22:56:18,825 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:18,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:18,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1523760094, now seen corresponding path program 1 times [2024-11-11 22:56:18,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:18,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228066399] [2024-11-11 22:56:18,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:18,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:18,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:18,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:56:18,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:18,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:56:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:18,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:56:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:18,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:56:18,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:19,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:56:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:19,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:56:19,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:19,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:19,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:19,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228066399] [2024-11-11 22:56:19,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228066399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:19,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:19,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:56:19,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077471344] [2024-11-11 22:56:19,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:19,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:56:19,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:19,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:56:19,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:56:19,022 INFO L87 Difference]: Start difference. First operand 522 states and 754 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-11 22:56:20,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:20,460 INFO L93 Difference]: Finished difference Result 2217 states and 3109 transitions. [2024-11-11 22:56:20,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-11 22:56:20,460 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2024-11-11 22:56:20,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:20,468 INFO L225 Difference]: With dead ends: 2217 [2024-11-11 22:56:20,468 INFO L226 Difference]: Without dead ends: 1950 [2024-11-11 22:56:20,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2024-11-11 22:56:20,470 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 2302 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 1484 mSolverCounterSat, 471 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2316 SdHoareTripleChecker+Valid, 1604 SdHoareTripleChecker+Invalid, 1955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 471 IncrementalHoareTripleChecker+Valid, 1484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:20,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2316 Valid, 1604 Invalid, 1955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [471 Valid, 1484 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 22:56:20,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2024-11-11 22:56:20,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1657. [2024-11-11 22:56:20,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 1329 states have (on average 1.3686982693754703) internal successors, (1819), 1357 states have internal predecessors, (1819), 173 states have call successors, (173), 130 states have call predecessors, (173), 153 states have return successors, (251), 173 states have call predecessors, (251), 171 states have call successors, (251) [2024-11-11 22:56:20,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2243 transitions. [2024-11-11 22:56:20,550 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2243 transitions. Word has length 65 [2024-11-11 22:56:20,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:20,550 INFO L471 AbstractCegarLoop]: Abstraction has 1657 states and 2243 transitions. [2024-11-11 22:56:20,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-11 22:56:20,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2243 transitions. [2024-11-11 22:56:20,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 22:56:20,552 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:20,552 INFO L218 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] [2024-11-11 22:56:20,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 22:56:20,552 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:20,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:20,553 INFO L85 PathProgramCache]: Analyzing trace with hash -472311005, now seen corresponding path program 1 times [2024-11-11 22:56:20,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:20,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809794045] [2024-11-11 22:56:20,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:20,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:20,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:20,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:20,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:20,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:56:20,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:20,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:56:20,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:20,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:56:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:20,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:56:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:20,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:56:20,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:20,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:56:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:20,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:20,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:20,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809794045] [2024-11-11 22:56:20,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809794045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:20,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:20,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:56:20,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918378888] [2024-11-11 22:56:20,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:20,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:56:20,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:20,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:56:20,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:56:20,683 INFO L87 Difference]: Start difference. First operand 1657 states and 2243 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 22:56:21,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:21,450 INFO L93 Difference]: Finished difference Result 3317 states and 4493 transitions. [2024-11-11 22:56:21,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 22:56:21,451 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2024-11-11 22:56:21,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:21,458 INFO L225 Difference]: With dead ends: 3317 [2024-11-11 22:56:21,458 INFO L226 Difference]: Without dead ends: 1915 [2024-11-11 22:56:21,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:56:21,463 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 408 mSDsluCounter, 1666 mSDsCounter, 0 mSdLazyCounter, 1370 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 1954 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:21,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 1954 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1370 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 22:56:21,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1915 states. [2024-11-11 22:56:21,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1915 to 1702. [2024-11-11 22:56:21,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1702 states, 1365 states have (on average 1.3523809523809525) internal successors, (1846), 1393 states have internal predecessors, (1846), 173 states have call successors, (173), 130 states have call predecessors, (173), 162 states have return successors, (263), 182 states have call predecessors, (263), 171 states have call successors, (263) [2024-11-11 22:56:21,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 2282 transitions. [2024-11-11 22:56:21,547 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 2282 transitions. Word has length 65 [2024-11-11 22:56:21,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:21,550 INFO L471 AbstractCegarLoop]: Abstraction has 1702 states and 2282 transitions. [2024-11-11 22:56:21,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 22:56:21,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 2282 transitions. [2024-11-11 22:56:21,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 22:56:21,552 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:21,552 INFO L218 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] [2024-11-11 22:56:21,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 22:56:21,552 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:21,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:21,553 INFO L85 PathProgramCache]: Analyzing trace with hash 913892389, now seen corresponding path program 1 times [2024-11-11 22:56:21,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:21,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922089669] [2024-11-11 22:56:21,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:21,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:21,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:21,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:21,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:56:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:21,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:56:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:21,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:56:21,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:21,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:56:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:21,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:56:21,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:21,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:56:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:21,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:21,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:21,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922089669] [2024-11-11 22:56:21,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922089669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:21,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:21,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 22:56:21,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195490831] [2024-11-11 22:56:21,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:21,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 22:56:21,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:21,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 22:56:21,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:56:21,686 INFO L87 Difference]: Start difference. First operand 1702 states and 2282 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 22:56:22,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:22,618 INFO L93 Difference]: Finished difference Result 3234 states and 4282 transitions. [2024-11-11 22:56:22,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-11 22:56:22,619 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-11-11 22:56:22,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:22,627 INFO L225 Difference]: With dead ends: 3234 [2024-11-11 22:56:22,628 INFO L226 Difference]: Without dead ends: 2007 [2024-11-11 22:56:22,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2024-11-11 22:56:22,631 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 975 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 998 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 1323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:22,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [998 Valid, 1425 Invalid, 1323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 22:56:22,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2007 states. [2024-11-11 22:56:22,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2007 to 1680. [2024-11-11 22:56:22,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1680 states, 1351 states have (on average 1.3486306439674316) internal successors, (1822), 1373 states have internal predecessors, (1822), 173 states have call successors, (173), 130 states have call predecessors, (173), 154 states have return successors, (247), 180 states have call predecessors, (247), 171 states have call successors, (247) [2024-11-11 22:56:22,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 2242 transitions. [2024-11-11 22:56:22,709 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 2242 transitions. Word has length 65 [2024-11-11 22:56:22,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:22,710 INFO L471 AbstractCegarLoop]: Abstraction has 1680 states and 2242 transitions. [2024-11-11 22:56:22,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 22:56:22,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 2242 transitions. [2024-11-11 22:56:22,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 22:56:22,711 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:22,711 INFO L218 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] [2024-11-11 22:56:22,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 22:56:22,711 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:22,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:22,712 INFO L85 PathProgramCache]: Analyzing trace with hash 779878883, now seen corresponding path program 1 times [2024-11-11 22:56:22,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:22,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721119253] [2024-11-11 22:56:22,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:22,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:22,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:22,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:56:22,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:22,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:56:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:22,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:56:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:22,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:56:22,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:22,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:56:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:22,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:56:22,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:22,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:22,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:22,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721119253] [2024-11-11 22:56:22,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721119253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:22,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:22,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:56:22,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061609644] [2024-11-11 22:56:22,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:22,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:56:22,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:22,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:56:22,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:56:22,795 INFO L87 Difference]: Start difference. First operand 1680 states and 2242 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 22:56:23,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:23,438 INFO L93 Difference]: Finished difference Result 4818 states and 6356 transitions. [2024-11-11 22:56:23,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 22:56:23,439 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-11-11 22:56:23,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:23,451 INFO L225 Difference]: With dead ends: 4818 [2024-11-11 22:56:23,452 INFO L226 Difference]: Without dead ends: 3396 [2024-11-11 22:56:23,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-11 22:56:23,456 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 925 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 954 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:23,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [954 Valid, 1191 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 22:56:23,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3396 states. [2024-11-11 22:56:23,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3396 to 3124. [2024-11-11 22:56:23,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3124 states, 2464 states have (on average 1.3003246753246753) internal successors, (3204), 2515 states have internal predecessors, (3204), 338 states have call successors, (338), 253 states have call predecessors, (338), 320 states have return successors, (574), 362 states have call predecessors, (574), 336 states have call successors, (574) [2024-11-11 22:56:23,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 4116 transitions. [2024-11-11 22:56:23,618 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 4116 transitions. Word has length 65 [2024-11-11 22:56:23,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:23,618 INFO L471 AbstractCegarLoop]: Abstraction has 3124 states and 4116 transitions. [2024-11-11 22:56:23,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 22:56:23,619 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 4116 transitions. [2024-11-11 22:56:23,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-11 22:56:23,620 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:23,620 INFO L218 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] [2024-11-11 22:56:23,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 22:56:23,620 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:23,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:23,621 INFO L85 PathProgramCache]: Analyzing trace with hash -910592781, now seen corresponding path program 1 times [2024-11-11 22:56:23,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:23,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721816206] [2024-11-11 22:56:23,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:23,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:23,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:23,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:23,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:56:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:23,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:56:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:23,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:56:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:23,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:56:23,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:23,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:56:23,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:23,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:56:23,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:23,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:23,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:23,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721816206] [2024-11-11 22:56:23,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721816206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:23,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:23,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:56:23,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113418544] [2024-11-11 22:56:23,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:23,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:56:23,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:23,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:56:23,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:56:23,677 INFO L87 Difference]: Start difference. First operand 3124 states and 4116 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 22:56:24,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:24,399 INFO L93 Difference]: Finished difference Result 8356 states and 11026 transitions. [2024-11-11 22:56:24,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:56:24,400 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2024-11-11 22:56:24,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:24,418 INFO L225 Difference]: With dead ends: 8356 [2024-11-11 22:56:24,419 INFO L226 Difference]: Without dead ends: 5469 [2024-11-11 22:56:24,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:56:24,424 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 583 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:24,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 1198 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 22:56:24,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5469 states. [2024-11-11 22:56:24,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5469 to 4836. [2024-11-11 22:56:24,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4836 states, 3770 states have (on average 1.2854111405835544) internal successors, (4846), 3831 states have internal predecessors, (4846), 540 states have call successors, (540), 427 states have call predecessors, (540), 524 states have return successors, (926), 584 states have call predecessors, (926), 538 states have call successors, (926) [2024-11-11 22:56:24,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4836 states to 4836 states and 6312 transitions. [2024-11-11 22:56:24,683 INFO L78 Accepts]: Start accepts. Automaton has 4836 states and 6312 transitions. Word has length 66 [2024-11-11 22:56:24,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:24,683 INFO L471 AbstractCegarLoop]: Abstraction has 4836 states and 6312 transitions. [2024-11-11 22:56:24,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 22:56:24,683 INFO L276 IsEmpty]: Start isEmpty. Operand 4836 states and 6312 transitions. [2024-11-11 22:56:24,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-11 22:56:24,685 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:24,685 INFO L218 NwaCegarLoop]: trace histogram [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-11-11 22:56:24,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 22:56:24,686 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:24,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:24,687 INFO L85 PathProgramCache]: Analyzing trace with hash -659914751, now seen corresponding path program 1 times [2024-11-11 22:56:24,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:24,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005453542] [2024-11-11 22:56:24,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:24,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:24,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:24,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:24,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:24,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:56:24,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:24,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:56:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:24,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:56:24,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:24,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:56:24,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:24,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:56:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:24,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:56:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:24,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:24,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:24,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005453542] [2024-11-11 22:56:24,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005453542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:24,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:24,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:56:24,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379509799] [2024-11-11 22:56:24,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:24,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:56:24,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:24,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:56:24,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:56:24,758 INFO L87 Difference]: Start difference. First operand 4836 states and 6312 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-11 22:56:25,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:25,586 INFO L93 Difference]: Finished difference Result 6631 states and 8582 transitions. [2024-11-11 22:56:25,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 22:56:25,586 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2024-11-11 22:56:25,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:25,611 INFO L225 Difference]: With dead ends: 6631 [2024-11-11 22:56:25,612 INFO L226 Difference]: Without dead ends: 6628 [2024-11-11 22:56:25,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2024-11-11 22:56:25,616 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 1408 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1417 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:25,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1417 Valid, 1001 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 22:56:25,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6628 states. [2024-11-11 22:56:26,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6628 to 5913. [2024-11-11 22:56:26,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5913 states, 4588 states have (on average 1.2739755884917174) internal successors, (5845), 4659 states have internal predecessors, (5845), 671 states have call successors, (671), 541 states have call predecessors, (671), 652 states have return successors, (1134), 719 states have call predecessors, (1134), 670 states have call successors, (1134) [2024-11-11 22:56:26,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5913 states to 5913 states and 7650 transitions. [2024-11-11 22:56:26,026 INFO L78 Accepts]: Start accepts. Automaton has 5913 states and 7650 transitions. Word has length 73 [2024-11-11 22:56:26,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:26,026 INFO L471 AbstractCegarLoop]: Abstraction has 5913 states and 7650 transitions. [2024-11-11 22:56:26,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-11 22:56:26,026 INFO L276 IsEmpty]: Start isEmpty. Operand 5913 states and 7650 transitions. [2024-11-11 22:56:26,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-11 22:56:26,028 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:26,028 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2024-11-11 22:56:26,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 22:56:26,028 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:26,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:26,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1016478940, now seen corresponding path program 1 times [2024-11-11 22:56:26,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:26,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686380980] [2024-11-11 22:56:26,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:26,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:26,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:26,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:26,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:56:26,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:26,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:56:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:26,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:56:26,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:26,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:56:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:26,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:56:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:26,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:56:26,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:26,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:26,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:26,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686380980] [2024-11-11 22:56:26,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686380980] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:56:26,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445363440] [2024-11-11 22:56:26,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:26,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:56:26,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:56:26,141 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:56:26,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 22:56:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:26,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-11 22:56:26,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:56:26,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:26,410 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:56:26,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:26,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445363440] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 22:56:26,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 22:56:26,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2024-11-11 22:56:26,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374489219] [2024-11-11 22:56:26,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 22:56:26,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 22:56:26,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:26,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 22:56:26,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-11 22:56:26,498 INFO L87 Difference]: Start difference. First operand 5913 states and 7650 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-11 22:56:28,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:28,501 INFO L93 Difference]: Finished difference Result 13983 states and 17929 transitions. [2024-11-11 22:56:28,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-11 22:56:28,501 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2024-11-11 22:56:28,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:28,577 INFO L225 Difference]: With dead ends: 13983 [2024-11-11 22:56:28,578 INFO L226 Difference]: Without dead ends: 13980 [2024-11-11 22:56:28,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2024-11-11 22:56:28,587 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 2161 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 1371 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2223 SdHoareTripleChecker+Valid, 1512 SdHoareTripleChecker+Invalid, 1666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 1371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:28,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2223 Valid, 1512 Invalid, 1666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 1371 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 22:56:28,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13980 states. [2024-11-11 22:56:29,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13980 to 11273. [2024-11-11 22:56:29,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11273 states, 8743 states have (on average 1.2672995539288574) internal successors, (11080), 8875 states have internal predecessors, (11080), 1261 states have call successors, (1261), 1031 states have call predecessors, (1261), 1267 states have return successors, (2161), 1373 states have call predecessors, (2161), 1260 states have call successors, (2161) [2024-11-11 22:56:29,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11273 states to 11273 states and 14502 transitions. [2024-11-11 22:56:29,356 INFO L78 Accepts]: Start accepts. Automaton has 11273 states and 14502 transitions. Word has length 74 [2024-11-11 22:56:29,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:29,357 INFO L471 AbstractCegarLoop]: Abstraction has 11273 states and 14502 transitions. [2024-11-11 22:56:29,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-11 22:56:29,357 INFO L276 IsEmpty]: Start isEmpty. Operand 11273 states and 14502 transitions. [2024-11-11 22:56:29,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-11 22:56:29,359 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:29,359 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2024-11-11 22:56:29,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 22:56:29,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:56:29,559 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:29,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:29,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1213110593, now seen corresponding path program 2 times [2024-11-11 22:56:29,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:29,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470646289] [2024-11-11 22:56:29,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:29,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:29,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:29,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:29,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:56:29,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:29,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:56:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:29,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:56:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:29,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:56:29,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:29,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:56:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:29,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:56:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:29,609 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:29,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:29,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470646289] [2024-11-11 22:56:29,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470646289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:29,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:29,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:56:29,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494595368] [2024-11-11 22:56:29,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:29,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:56:29,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:29,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:56:29,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:56:29,613 INFO L87 Difference]: Start difference. First operand 11273 states and 14502 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-11 22:56:30,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:30,737 INFO L93 Difference]: Finished difference Result 18118 states and 23396 transitions. [2024-11-11 22:56:30,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 22:56:30,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 77 [2024-11-11 22:56:30,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:30,771 INFO L225 Difference]: With dead ends: 18118 [2024-11-11 22:56:30,772 INFO L226 Difference]: Without dead ends: 7994 [2024-11-11 22:56:30,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-11 22:56:30,799 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 831 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 1089 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:30,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 1089 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 22:56:30,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7994 states. [2024-11-11 22:56:31,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7994 to 7261. [2024-11-11 22:56:31,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7261 states, 5651 states have (on average 1.2450893647142098) internal successors, (7036), 5733 states have internal predecessors, (7036), 811 states have call successors, (811), 655 states have call predecessors, (811), 797 states have return successors, (1315), 879 states have call predecessors, (1315), 810 states have call successors, (1315) [2024-11-11 22:56:31,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7261 states to 7261 states and 9162 transitions. [2024-11-11 22:56:31,455 INFO L78 Accepts]: Start accepts. Automaton has 7261 states and 9162 transitions. Word has length 77 [2024-11-11 22:56:31,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:31,455 INFO L471 AbstractCegarLoop]: Abstraction has 7261 states and 9162 transitions. [2024-11-11 22:56:31,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-11 22:56:31,455 INFO L276 IsEmpty]: Start isEmpty. Operand 7261 states and 9162 transitions. [2024-11-11 22:56:31,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-11 22:56:31,458 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:31,458 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 22:56:31,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 22:56:31,458 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:31,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:31,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1106365746, now seen corresponding path program 1 times [2024-11-11 22:56:31,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:31,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572108643] [2024-11-11 22:56:31,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:31,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:31,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:31,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:31,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:56:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:31,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:56:31,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:31,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:56:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:31,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:56:31,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:31,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:56:31,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:31,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:56:31,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:31,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 22:56:31,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:31,538 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-11 22:56:31,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:31,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572108643] [2024-11-11 22:56:31,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572108643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:31,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:31,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 22:56:31,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646164004] [2024-11-11 22:56:31,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:31,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 22:56:31,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:31,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 22:56:31,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:56:31,539 INFO L87 Difference]: Start difference. First operand 7261 states and 9162 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 22:56:33,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:33,193 INFO L93 Difference]: Finished difference Result 21837 states and 27689 transitions. [2024-11-11 22:56:33,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-11 22:56:33,194 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2024-11-11 22:56:33,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:33,240 INFO L225 Difference]: With dead ends: 21837 [2024-11-11 22:56:33,240 INFO L226 Difference]: Without dead ends: 14837 [2024-11-11 22:56:33,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2024-11-11 22:56:33,258 INFO L435 NwaCegarLoop]: 306 mSDtfsCounter, 827 mSDsluCounter, 1486 mSDsCounter, 0 mSdLazyCounter, 1174 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 1174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:33,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 1792 Invalid, 1345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 1174 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 22:56:33,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14837 states. [2024-11-11 22:56:34,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14837 to 13681. [2024-11-11 22:56:34,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13681 states, 10495 states have (on average 1.2187708432586946) internal successors, (12791), 10685 states have internal predecessors, (12791), 1583 states have call successors, (1583), 1259 states have call predecessors, (1583), 1601 states have return successors, (2932), 1749 states have call predecessors, (2932), 1582 states have call successors, (2932) [2024-11-11 22:56:34,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13681 states to 13681 states and 17306 transitions. [2024-11-11 22:56:34,155 INFO L78 Accepts]: Start accepts. Automaton has 13681 states and 17306 transitions. Word has length 84 [2024-11-11 22:56:34,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:34,156 INFO L471 AbstractCegarLoop]: Abstraction has 13681 states and 17306 transitions. [2024-11-11 22:56:34,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 22:56:34,157 INFO L276 IsEmpty]: Start isEmpty. Operand 13681 states and 17306 transitions. [2024-11-11 22:56:34,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-11 22:56:34,161 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:34,161 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2024-11-11 22:56:34,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 22:56:34,162 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:34,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:34,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1598808737, now seen corresponding path program 1 times [2024-11-11 22:56:34,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:34,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109864830] [2024-11-11 22:56:34,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:34,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:34,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:34,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:56:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:34,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:56:34,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:34,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:56:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:34,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:56:34,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:34,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:56:34,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:34,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:56:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:34,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 22:56:34,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:34,250 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 22:56:34,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:34,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109864830] [2024-11-11 22:56:34,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109864830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:34,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:34,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:56:34,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23878095] [2024-11-11 22:56:34,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:34,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:56:34,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:34,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:56:34,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:56:34,251 INFO L87 Difference]: Start difference. First operand 13681 states and 17306 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 22:56:36,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:36,614 INFO L93 Difference]: Finished difference Result 27061 states and 34022 transitions. [2024-11-11 22:56:36,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-11 22:56:36,615 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 93 [2024-11-11 22:56:36,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:36,665 INFO L225 Difference]: With dead ends: 27061 [2024-11-11 22:56:36,665 INFO L226 Difference]: Without dead ends: 14536 [2024-11-11 22:56:36,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2024-11-11 22:56:36,693 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 1846 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1886 SdHoareTripleChecker+Valid, 1327 SdHoareTripleChecker+Invalid, 1585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:36,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1886 Valid, 1327 Invalid, 1585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 22:56:36,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14536 states. [2024-11-11 22:56:37,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14536 to 13555. [2024-11-11 22:56:37,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13555 states, 10399 states have (on average 1.2007885373593614) internal successors, (12487), 10607 states have internal predecessors, (12487), 1553 states have call successors, (1553), 1259 states have call predecessors, (1553), 1601 states have return successors, (2681), 1701 states have call predecessors, (2681), 1552 states have call successors, (2681) [2024-11-11 22:56:37,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13555 states to 13555 states and 16721 transitions. [2024-11-11 22:56:37,633 INFO L78 Accepts]: Start accepts. Automaton has 13555 states and 16721 transitions. Word has length 93 [2024-11-11 22:56:37,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:37,634 INFO L471 AbstractCegarLoop]: Abstraction has 13555 states and 16721 transitions. [2024-11-11 22:56:37,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 22:56:37,634 INFO L276 IsEmpty]: Start isEmpty. Operand 13555 states and 16721 transitions. [2024-11-11 22:56:37,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 22:56:37,641 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:37,641 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:37,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 22:56:37,641 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:37,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:37,642 INFO L85 PathProgramCache]: Analyzing trace with hash 2069972481, now seen corresponding path program 1 times [2024-11-11 22:56:37,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:37,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482283160] [2024-11-11 22:56:37,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:37,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:37,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:37,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 22:56:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:37,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:56:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:37,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 22:56:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:37,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 22:56:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:37,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:37,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:37,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482283160] [2024-11-11 22:56:37,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482283160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:37,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:37,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:56:37,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117185659] [2024-11-11 22:56:37,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:37,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:56:37,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:37,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:56:37,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:56:37,722 INFO L87 Difference]: Start difference. First operand 13555 states and 16721 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 3 states have internal predecessors, (102), 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-11-11 22:56:39,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:39,927 INFO L93 Difference]: Finished difference Result 13853 states and 17188 transitions. [2024-11-11 22:56:39,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:56:39,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 3 states have internal predecessors, (102), 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 112 [2024-11-11 22:56:39,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:39,963 INFO L225 Difference]: With dead ends: 13853 [2024-11-11 22:56:39,964 INFO L226 Difference]: Without dead ends: 13631 [2024-11-11 22:56:39,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:56:39,968 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 691 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:39,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 713 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 22:56:39,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13631 states. [2024-11-11 22:56:41,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13631 to 13555. [2024-11-11 22:56:41,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13555 states, 10399 states have (on average 1.2006923742667563) internal successors, (12486), 10607 states have internal predecessors, (12486), 1553 states have call successors, (1553), 1259 states have call predecessors, (1553), 1601 states have return successors, (2681), 1701 states have call predecessors, (2681), 1552 states have call successors, (2681) [2024-11-11 22:56:41,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13555 states to 13555 states and 16720 transitions. [2024-11-11 22:56:41,775 INFO L78 Accepts]: Start accepts. Automaton has 13555 states and 16720 transitions. Word has length 112 [2024-11-11 22:56:41,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:41,775 INFO L471 AbstractCegarLoop]: Abstraction has 13555 states and 16720 transitions. [2024-11-11 22:56:41,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 3 states have internal predecessors, (102), 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-11-11 22:56:41,776 INFO L276 IsEmpty]: Start isEmpty. Operand 13555 states and 16720 transitions. [2024-11-11 22:56:41,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 22:56:41,784 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:41,784 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:41,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 22:56:41,785 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:41,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:41,785 INFO L85 PathProgramCache]: Analyzing trace with hash -318591549, now seen corresponding path program 1 times [2024-11-11 22:56:41,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:41,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851649567] [2024-11-11 22:56:41,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:41,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:41,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:41,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:41,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 22:56:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:41,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:56:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:41,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 22:56:41,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:41,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 22:56:41,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:41,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:41,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:41,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851649567] [2024-11-11 22:56:41,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851649567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:41,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:41,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:56:41,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15129484] [2024-11-11 22:56:41,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:41,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:56:41,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:41,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:56:41,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:56:41,922 INFO L87 Difference]: Start difference. First operand 13555 states and 16720 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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-11-11 22:56:45,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:45,079 INFO L93 Difference]: Finished difference Result 14166 states and 17690 transitions. [2024-11-11 22:56:45,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:56:45,080 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2024-11-11 22:56:45,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:45,119 INFO L225 Difference]: With dead ends: 14166 [2024-11-11 22:56:45,119 INFO L226 Difference]: Without dead ends: 13946 [2024-11-11 22:56:45,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:56:45,125 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 1079 mSDsluCounter, 1385 mSDsCounter, 0 mSdLazyCounter, 2217 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1102 SdHoareTripleChecker+Valid, 1798 SdHoareTripleChecker+Invalid, 2305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 2217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:45,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1102 Valid, 1798 Invalid, 2305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 2217 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 22:56:45,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13946 states. [2024-11-11 22:56:46,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13946 to 13785. [2024-11-11 22:56:46,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13785 states, 10604 states have (on average 1.2074688796680497) internal successors, (12804), 10814 states have internal predecessors, (12804), 1570 states have call successors, (1570), 1265 states have call predecessors, (1570), 1609 states have return successors, (2705), 1719 states have call predecessors, (2705), 1569 states have call successors, (2705) [2024-11-11 22:56:46,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13785 states to 13785 states and 17079 transitions. [2024-11-11 22:56:46,688 INFO L78 Accepts]: Start accepts. Automaton has 13785 states and 17079 transitions. Word has length 112 [2024-11-11 22:56:46,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:46,688 INFO L471 AbstractCegarLoop]: Abstraction has 13785 states and 17079 transitions. [2024-11-11 22:56:46,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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-11-11 22:56:46,688 INFO L276 IsEmpty]: Start isEmpty. Operand 13785 states and 17079 transitions. [2024-11-11 22:56:46,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 22:56:46,695 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:46,696 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:46,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 22:56:46,696 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:46,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:46,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1937566463, now seen corresponding path program 1 times [2024-11-11 22:56:46,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:46,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336481339] [2024-11-11 22:56:46,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:46,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:46,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:46,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:46,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:46,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 22:56:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:46,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:56:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:46,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 22:56:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:46,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 22:56:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:46,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:46,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:46,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336481339] [2024-11-11 22:56:46,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336481339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:46,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:46,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:56:46,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942442808] [2024-11-11 22:56:46,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:46,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:56:46,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:46,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:56:46,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:56:46,803 INFO L87 Difference]: Start difference. First operand 13785 states and 17079 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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-11-11 22:56:49,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:49,665 INFO L93 Difference]: Finished difference Result 14946 states and 18903 transitions. [2024-11-11 22:56:49,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:56:49,665 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2024-11-11 22:56:49,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:49,707 INFO L225 Difference]: With dead ends: 14946 [2024-11-11 22:56:49,707 INFO L226 Difference]: Without dead ends: 14498 [2024-11-11 22:56:49,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:56:49,717 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 1063 mSDsluCounter, 1385 mSDsCounter, 0 mSdLazyCounter, 2299 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1086 SdHoareTripleChecker+Valid, 1796 SdHoareTripleChecker+Invalid, 2389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 2299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:49,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1086 Valid, 1796 Invalid, 2389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 2299 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 22:56:49,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14498 states. [2024-11-11 22:56:51,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14498 to 14209. [2024-11-11 22:56:51,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14209 states, 10984 states have (on average 1.218226511289148) internal successors, (13381), 11196 states have internal predecessors, (13381), 1600 states have call successors, (1600), 1277 states have call predecessors, (1600), 1623 states have return successors, (2745), 1751 states have call predecessors, (2745), 1599 states have call successors, (2745) [2024-11-11 22:56:51,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14209 states to 14209 states and 17726 transitions. [2024-11-11 22:56:51,388 INFO L78 Accepts]: Start accepts. Automaton has 14209 states and 17726 transitions. Word has length 112 [2024-11-11 22:56:51,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:51,389 INFO L471 AbstractCegarLoop]: Abstraction has 14209 states and 17726 transitions. [2024-11-11 22:56:51,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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-11-11 22:56:51,389 INFO L276 IsEmpty]: Start isEmpty. Operand 14209 states and 17726 transitions. [2024-11-11 22:56:51,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 22:56:51,396 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:51,396 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:51,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 22:56:51,397 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:51,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:51,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1473891843, now seen corresponding path program 1 times [2024-11-11 22:56:51,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:51,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642445185] [2024-11-11 22:56:51,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:51,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:51,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:51,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:51,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 22:56:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:51,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:56:51,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:51,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 22:56:51,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:51,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 22:56:51,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:51,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:51,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:51,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642445185] [2024-11-11 22:56:51,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642445185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:51,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:51,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:56:51,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366249105] [2024-11-11 22:56:51,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:51,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:56:51,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:51,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:56:51,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:56:51,511 INFO L87 Difference]: Start difference. First operand 14209 states and 17726 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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-11-11 22:56:54,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:54,802 INFO L93 Difference]: Finished difference Result 16472 states and 21270 transitions. [2024-11-11 22:56:54,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:56:54,802 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2024-11-11 22:56:54,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:54,848 INFO L225 Difference]: With dead ends: 16472 [2024-11-11 22:56:54,848 INFO L226 Difference]: Without dead ends: 15600 [2024-11-11 22:56:54,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:56:54,859 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 1063 mSDsluCounter, 1385 mSDsCounter, 0 mSdLazyCounter, 2310 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1086 SdHoareTripleChecker+Valid, 1799 SdHoareTripleChecker+Invalid, 2400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 2310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:54,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1086 Valid, 1799 Invalid, 2400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 2310 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 22:56:54,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15600 states. [2024-11-11 22:56:56,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15600 to 15059. [2024-11-11 22:56:56,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15059 states, 11746 states have (on average 1.2376128043589307) internal successors, (14537), 11962 states have internal predecessors, (14537), 1660 states have call successors, (1660), 1301 states have call predecessors, (1660), 1651 states have return successors, (2831), 1815 states have call predecessors, (2831), 1659 states have call successors, (2831) [2024-11-11 22:56:56,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15059 states to 15059 states and 19028 transitions. [2024-11-11 22:56:56,545 INFO L78 Accepts]: Start accepts. Automaton has 15059 states and 19028 transitions. Word has length 112 [2024-11-11 22:56:56,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:56,545 INFO L471 AbstractCegarLoop]: Abstraction has 15059 states and 19028 transitions. [2024-11-11 22:56:56,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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-11-11 22:56:56,546 INFO L276 IsEmpty]: Start isEmpty. Operand 15059 states and 19028 transitions. [2024-11-11 22:56:56,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 22:56:56,553 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:56,554 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:56,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 22:56:56,554 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:56,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:56,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1445391553, now seen corresponding path program 1 times [2024-11-11 22:56:56,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:56,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771024276] [2024-11-11 22:56:56,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:56,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:56,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:56,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:56,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 22:56:56,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:56,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:56:56,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:56,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 22:56:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:56,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 22:56:56,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:56,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:56,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:56,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771024276] [2024-11-11 22:56:56,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771024276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:56,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:56,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:56:56,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074764647] [2024-11-11 22:56:56,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:56,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:56:56,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:56,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:56:56,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:56:56,663 INFO L87 Difference]: Start difference. First operand 15059 states and 19028 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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-11-11 22:56:59,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:59,707 INFO L93 Difference]: Finished difference Result 19522 states and 26018 transitions. [2024-11-11 22:56:59,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:56:59,707 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2024-11-11 22:56:59,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:59,763 INFO L225 Difference]: With dead ends: 19522 [2024-11-11 22:56:59,763 INFO L226 Difference]: Without dead ends: 17800 [2024-11-11 22:56:59,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:56:59,775 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 1063 mSDsluCounter, 1385 mSDsCounter, 0 mSdLazyCounter, 2286 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1086 SdHoareTripleChecker+Valid, 1796 SdHoareTripleChecker+Invalid, 2376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 2286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:59,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1086 Valid, 1796 Invalid, 2376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 2286 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 22:56:59,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17800 states. [2024-11-11 22:57:01,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17800 to 16765. [2024-11-11 22:57:01,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16765 states, 13276 states have (on average 1.2697348598975595) internal successors, (16857), 13500 states have internal predecessors, (16857), 1780 states have call successors, (1780), 1349 states have call predecessors, (1780), 1707 states have return successors, (3021), 1943 states have call predecessors, (3021), 1779 states have call successors, (3021) [2024-11-11 22:57:01,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16765 states to 16765 states and 21658 transitions. [2024-11-11 22:57:01,583 INFO L78 Accepts]: Start accepts. Automaton has 16765 states and 21658 transitions. Word has length 112 [2024-11-11 22:57:01,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:57:01,583 INFO L471 AbstractCegarLoop]: Abstraction has 16765 states and 21658 transitions. [2024-11-11 22:57:01,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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-11-11 22:57:01,584 INFO L276 IsEmpty]: Start isEmpty. Operand 16765 states and 21658 transitions. [2024-11-11 22:57:01,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 22:57:01,592 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:57:01,592 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:57:01,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 22:57:01,592 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:57:01,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:57:01,593 INFO L85 PathProgramCache]: Analyzing trace with hash -495190461, now seen corresponding path program 1 times [2024-11-11 22:57:01,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:57:01,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517240986] [2024-11-11 22:57:01,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:57:01,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:57:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:01,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:57:01,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:01,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 22:57:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:01,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:57:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:01,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 22:57:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:01,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 22:57:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:01,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-11-11 22:57:01,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:57:01,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517240986] [2024-11-11 22:57:01,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517240986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:57:01,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:57:01,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:57:01,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983412381] [2024-11-11 22:57:01,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:57:01,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:57:01,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:57:01,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:57:01,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:57:01,697 INFO L87 Difference]: Start difference. First operand 16765 states and 21658 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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-11-11 22:57:04,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:57:04,871 INFO L93 Difference]: Finished difference Result 25620 states and 35570 transitions. [2024-11-11 22:57:04,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:57:04,872 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2024-11-11 22:57:04,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:57:04,930 INFO L225 Difference]: With dead ends: 25620 [2024-11-11 22:57:04,931 INFO L226 Difference]: Without dead ends: 22192 [2024-11-11 22:57:04,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:57:04,948 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 1063 mSDsluCounter, 1385 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1086 SdHoareTripleChecker+Valid, 1796 SdHoareTripleChecker+Invalid, 2367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:57:04,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1086 Valid, 1796 Invalid, 2367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 22:57:04,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22192 states. [2024-11-11 22:57:06,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22192 to 20191. [2024-11-11 22:57:06,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20191 states, 16350 states have (on average 1.3160244648318042) internal successors, (21517), 16590 states have internal predecessors, (21517), 2020 states have call successors, (2020), 1445 states have call predecessors, (2020), 1819 states have return successors, (3455), 2199 states have call predecessors, (3455), 2019 states have call successors, (3455) [2024-11-11 22:57:06,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20191 states to 20191 states and 26992 transitions. [2024-11-11 22:57:06,929 INFO L78 Accepts]: Start accepts. Automaton has 20191 states and 26992 transitions. Word has length 112 [2024-11-11 22:57:06,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:57:06,929 INFO L471 AbstractCegarLoop]: Abstraction has 20191 states and 26992 transitions. [2024-11-11 22:57:06,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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-11-11 22:57:06,929 INFO L276 IsEmpty]: Start isEmpty. Operand 20191 states and 26992 transitions. [2024-11-11 22:57:06,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 22:57:06,938 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:57:06,939 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:57:06,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 22:57:06,939 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:57:06,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:57:06,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1381872769, now seen corresponding path program 1 times [2024-11-11 22:57:06,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:57:06,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768432282] [2024-11-11 22:57:06,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:57:06,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:57:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:06,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:57:06,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:07,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 22:57:07,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:07,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:57:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:07,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 22:57:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:07,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 22:57:07,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:07,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:57:07,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:57:07,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768432282] [2024-11-11 22:57:07,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768432282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:57:07,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:57:07,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:57:07,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433254499] [2024-11-11 22:57:07,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:57:07,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:57:07,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:57:07,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:57:07,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:57:07,045 INFO L87 Difference]: Start difference. First operand 20191 states and 26992 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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-11-11 22:57:10,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:57:10,666 INFO L93 Difference]: Finished difference Result 37814 states and 54862 transitions. [2024-11-11 22:57:10,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:57:10,667 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2024-11-11 22:57:10,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:57:10,756 INFO L225 Difference]: With dead ends: 37814 [2024-11-11 22:57:10,756 INFO L226 Difference]: Without dead ends: 30960 [2024-11-11 22:57:10,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:57:10,776 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 1063 mSDsluCounter, 1385 mSDsCounter, 0 mSdLazyCounter, 2268 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1086 SdHoareTripleChecker+Valid, 1796 SdHoareTripleChecker+Invalid, 2358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 2268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:57:10,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1086 Valid, 1796 Invalid, 2358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 2268 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 22:57:10,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30960 states. [2024-11-11 22:57:13,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30960 to 27073. [2024-11-11 22:57:13,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27073 states, 22528 states have (on average 1.3707830255681819) internal successors, (30881), 22800 states have internal predecessors, (30881), 2500 states have call successors, (2500), 1637 states have call predecessors, (2500), 2043 states have return successors, (4485), 2711 states have call predecessors, (4485), 2499 states have call successors, (4485) [2024-11-11 22:57:13,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27073 states to 27073 states and 37866 transitions. [2024-11-11 22:57:13,147 INFO L78 Accepts]: Start accepts. Automaton has 27073 states and 37866 transitions. Word has length 112 [2024-11-11 22:57:13,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:57:13,147 INFO L471 AbstractCegarLoop]: Abstraction has 27073 states and 37866 transitions. [2024-11-11 22:57:13,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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-11-11 22:57:13,147 INFO L276 IsEmpty]: Start isEmpty. Operand 27073 states and 37866 transitions. [2024-11-11 22:57:13,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 22:57:13,160 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:57:13,164 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:57:13,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 22:57:13,164 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:57:13,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:57:13,165 INFO L85 PathProgramCache]: Analyzing trace with hash 611139203, now seen corresponding path program 1 times [2024-11-11 22:57:13,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:57:13,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24795068] [2024-11-11 22:57:13,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:57:13,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:57:13,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:13,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:57:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:13,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 22:57:13,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:13,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:57:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:13,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 22:57:13,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:13,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 22:57:13,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:13,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:57:13,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:57:13,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24795068] [2024-11-11 22:57:13,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24795068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:57:13,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:57:13,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:57:13,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015045272] [2024-11-11 22:57:13,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:57:13,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:57:13,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:57:13,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:57:13,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:57:13,286 INFO L87 Difference]: Start difference. First operand 27073 states and 37866 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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-11-11 22:57:18,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:57:18,021 INFO L93 Difference]: Finished difference Result 68152 states and 103004 transitions. [2024-11-11 22:57:18,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 22:57:18,021 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2024-11-11 22:57:18,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:57:18,163 INFO L225 Difference]: With dead ends: 68152 [2024-11-11 22:57:18,163 INFO L226 Difference]: Without dead ends: 54416 [2024-11-11 22:57:18,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:57:18,202 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 1132 mSDsluCounter, 1377 mSDsCounter, 0 mSdLazyCounter, 2672 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1154 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 2764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 2672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 22:57:18,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1154 Valid, 1789 Invalid, 2764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 2672 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 22:57:18,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54416 states. [2024-11-11 22:57:21,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54416 to 40707. [2024-11-11 22:57:21,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40707 states, 34818 states have (on average 1.4237750588775921) internal successors, (49573), 35154 states have internal predecessors, (49573), 3396 states have call successors, (3396), 2021 states have call predecessors, (3396), 2491 states have return successors, (6967), 3671 states have call predecessors, (6967), 3395 states have call successors, (6967) [2024-11-11 22:57:21,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40707 states to 40707 states and 59936 transitions. [2024-11-11 22:57:21,593 INFO L78 Accepts]: Start accepts. Automaton has 40707 states and 59936 transitions. Word has length 112 [2024-11-11 22:57:21,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:57:21,593 INFO L471 AbstractCegarLoop]: Abstraction has 40707 states and 59936 transitions. [2024-11-11 22:57:21,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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-11-11 22:57:21,593 INFO L276 IsEmpty]: Start isEmpty. Operand 40707 states and 59936 transitions. [2024-11-11 22:57:21,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 22:57:21,611 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:57:21,611 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:57:21,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 22:57:21,611 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:57:21,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:57:21,612 INFO L85 PathProgramCache]: Analyzing trace with hash -383554495, now seen corresponding path program 1 times [2024-11-11 22:57:21,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:57:21,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078739809] [2024-11-11 22:57:21,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:57:21,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:57:21,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:21,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:57:21,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:21,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 22:57:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:21,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:57:21,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:21,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 22:57:21,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:21,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 22:57:21,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:21,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:57:21,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:57:21,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078739809] [2024-11-11 22:57:21,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078739809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:57:21,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:57:21,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:57:21,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283442434] [2024-11-11 22:57:21,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:57:21,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:57:21,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:57:21,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:57:21,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:57:21,715 INFO L87 Difference]: Start difference. First operand 40707 states and 59936 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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-11-11 22:57:28,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:57:28,712 INFO L93 Difference]: Finished difference Result 118973 states and 186288 transitions. [2024-11-11 22:57:28,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 22:57:28,712 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2024-11-11 22:57:28,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:57:28,982 INFO L225 Difference]: With dead ends: 118973 [2024-11-11 22:57:28,982 INFO L226 Difference]: Without dead ends: 91603 [2024-11-11 22:57:29,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:57:29,052 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 1136 mSDsluCounter, 1356 mSDsCounter, 0 mSdLazyCounter, 2407 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1158 SdHoareTripleChecker+Valid, 1746 SdHoareTripleChecker+Invalid, 2501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 2407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:57:29,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1158 Valid, 1746 Invalid, 2501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 2407 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 22:57:29,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91603 states. [2024-11-11 22:57:34,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91603 to 68037. [2024-11-11 22:57:34,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68037 states, 59524 states have (on average 1.4661817082185338) internal successors, (87273), 59988 states have internal predecessors, (87273), 5124 states have call successors, (5124), 2789 states have call predecessors, (5124), 3387 states have return successors, (13325), 5527 states have call predecessors, (13325), 5123 states have call successors, (13325) [2024-11-11 22:57:35,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68037 states to 68037 states and 105722 transitions. [2024-11-11 22:57:35,034 INFO L78 Accepts]: Start accepts. Automaton has 68037 states and 105722 transitions. Word has length 112 [2024-11-11 22:57:35,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:57:35,035 INFO L471 AbstractCegarLoop]: Abstraction has 68037 states and 105722 transitions. [2024-11-11 22:57:35,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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-11-11 22:57:35,035 INFO L276 IsEmpty]: Start isEmpty. Operand 68037 states and 105722 transitions. [2024-11-11 22:57:35,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 22:57:35,061 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:57:35,062 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:57:35,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 22:57:35,062 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:57:35,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:57:35,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1952838015, now seen corresponding path program 1 times [2024-11-11 22:57:35,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:57:35,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024059303] [2024-11-11 22:57:35,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:57:35,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:57:35,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:35,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:57:35,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:35,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 22:57:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:35,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:57:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:35,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 22:57:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:35,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 22:57:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:35,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:57:35,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:57:35,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024059303] [2024-11-11 22:57:35,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024059303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:57:35,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:57:35,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:57:35,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433084595] [2024-11-11 22:57:35,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:57:35,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:57:35,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:57:35,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:57:35,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:57:35,173 INFO L87 Difference]: Start difference. First operand 68037 states and 105722 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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)