./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-2.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'b3322c0c768700658989b53a570d5dd58dc6c9ba5f33ff303fa538b570ca8619'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 b3322c0c768700658989b53a570d5dd58dc6c9ba5f33ff303fa538b570ca8619 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:46:11,546 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:46:11,628 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 01:46:11,633 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:46:11,635 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:46:11,663 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:46:11,665 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:46:11,665 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:46:11,665 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:46:11,666 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:46:11,666 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:46:11,666 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:46:11,666 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:46:11,666 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:46:11,667 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:46:11,667 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:46:11,667 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:46:11,667 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 01:46:11,667 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:46:11,667 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 01:46:11,667 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:46:11,667 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:46:11,667 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:46:11,667 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:46:11,667 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:46:11,667 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 01:46:11,668 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:46:11,668 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:46:11,668 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:46:11,668 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:46:11,668 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:46:11,668 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:46:11,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:46:11,668 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:46:11,668 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:46:11,668 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:46:11,668 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:46:11,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:46:11,668 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:46:11,669 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:46:11,669 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:46:11,669 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:46:11,669 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> b3322c0c768700658989b53a570d5dd58dc6c9ba5f33ff303fa538b570ca8619 [2024-11-07 01:46:11,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:46:11,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:46:11,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:46:11,964 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:46:11,964 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:46:11,965 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-2.c [2024-11-07 01:46:12,590 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:46:14,287 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:46:14,291 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-2.c [2024-11-07 01:46:14,311 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fb7640d81/46fab5c85c074b54989531d38fb61d31/FLAG6ee1f9408 [2024-11-07 01:46:14,332 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fb7640d81/46fab5c85c074b54989531d38fb61d31 [2024-11-07 01:46:14,335 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:46:14,336 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:46:14,337 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:46:14,337 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:46:14,341 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:46:14,341 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:46:14" (1/1) ... [2024-11-07 01:46:14,342 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b836593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:46:14, skipping insertion in model container [2024-11-07 01:46:14,342 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:46:14" (1/1) ... [2024-11-07 01:46:14,386 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:46:14,537 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-2.c[914,927] [2024-11-07 01:46:14,613 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-2.c[7115,7128] [2024-11-07 01:46:14,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:46:14,754 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:46:14,764 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-2.c[914,927] [2024-11-07 01:46:14,787 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-2.c[7115,7128] [2024-11-07 01:46:14,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:46:14,874 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:46:14,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:46:14 WrapperNode [2024-11-07 01:46:14,877 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:46:14,878 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:46:14,878 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:46:14,878 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:46:14,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:46:14" (1/1) ... [2024-11-07 01:46:14,903 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:46:14" (1/1) ... [2024-11-07 01:46:14,961 INFO L138 Inliner]: procedures = 75, calls = 90, calls flagged for inlining = 44, calls inlined = 44, statements flattened = 1008 [2024-11-07 01:46:14,962 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:46:14,962 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:46:14,963 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:46:14,963 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:46:14,971 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:46:14" (1/1) ... [2024-11-07 01:46:14,972 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:46:14" (1/1) ... [2024-11-07 01:46:14,983 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:46:14" (1/1) ... [2024-11-07 01:46:15,008 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-07 01:46:15,009 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:46:14" (1/1) ... [2024-11-07 01:46:15,009 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:46:14" (1/1) ... [2024-11-07 01:46:15,020 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:46:14" (1/1) ... [2024-11-07 01:46:15,040 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:46:14" (1/1) ... [2024-11-07 01:46:15,049 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:46:14" (1/1) ... [2024-11-07 01:46:15,056 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:46:14" (1/1) ... [2024-11-07 01:46:15,065 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:46:15,066 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:46:15,066 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:46:15,066 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:46:15,067 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:46:14" (1/1) ... [2024-11-07 01:46:15,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:46:15,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:46:15,099 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 01:46:15,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 01:46:15,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:46:15,122 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 01:46:15,122 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 01:46:15,123 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-07 01:46:15,123 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-07 01:46:15,123 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-07 01:46:15,123 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-07 01:46:15,123 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-07 01:46:15,123 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-07 01:46:15,123 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-07 01:46:15,124 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-07 01:46:15,124 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-07 01:46:15,124 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-07 01:46:15,124 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-07 01:46:15,124 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-07 01:46:15,124 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-07 01:46:15,124 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-07 01:46:15,125 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-07 01:46:15,125 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-07 01:46:15,125 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-07 01:46:15,125 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-07 01:46:15,125 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-07 01:46:15,125 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-07 01:46:15,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:46:15,126 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-07 01:46:15,126 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-07 01:46:15,126 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-07 01:46:15,126 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-07 01:46:15,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:46:15,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:46:15,127 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-07 01:46:15,127 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-07 01:46:15,241 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:46:15,243 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:46:16,293 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2024-11-07 01:46:16,293 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:46:16,324 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:46:16,327 INFO L316 CfgBuilder]: Removed 18 assume(true) statements. [2024-11-07 01:46:16,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:46:16 BoogieIcfgContainer [2024-11-07 01:46:16,328 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:46:16,330 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:46:16,332 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:46:16,337 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:46:16,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:46:14" (1/3) ... [2024-11-07 01:46:16,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb3361e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:46:16, skipping insertion in model container [2024-11-07 01:46:16,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:46:14" (2/3) ... [2024-11-07 01:46:16,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb3361e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:46:16, skipping insertion in model container [2024-11-07 01:46:16,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:46:16" (3/3) ... [2024-11-07 01:46:16,340 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.11.cil-2.c [2024-11-07 01:46:16,355 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:46:16,356 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 01:46:16,439 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:46:16,450 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;@c468fdd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:46:16,450 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 01:46:16,459 INFO L276 IsEmpty]: Start isEmpty. Operand has 470 states, 414 states have (on average 1.6183574879227054) internal successors, (670), 420 states have internal predecessors, (670), 39 states have call successors, (39), 14 states have call predecessors, (39), 14 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-07 01:46:16,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:46:16,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:16,470 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:46:16,471 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:16,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:16,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1642433864, now seen corresponding path program 1 times [2024-11-07 01:46:16,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:16,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504589247] [2024-11-07 01:46:16,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:16,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:16,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:16,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:17,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:46:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:17,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:46:17,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:17,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:17,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:17,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:17,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:17,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:17,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:17,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:46:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:17,159 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-07 01:46:17,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:17,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504589247] [2024-11-07 01:46:17,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504589247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:17,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:17,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:46:17,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120265119] [2024-11-07 01:46:17,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:17,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:46:17,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:17,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:46:17,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:46:17,197 INFO L87 Difference]: Start difference. First operand has 470 states, 414 states have (on average 1.6183574879227054) internal successors, (670), 420 states have internal predecessors, (670), 39 states have call successors, (39), 14 states have call predecessors, (39), 14 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) 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-07 01:46:18,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:18,781 INFO L93 Difference]: Finished difference Result 1048 states and 1656 transitions. [2024-11-07 01:46:18,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:46:18,783 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-07 01:46:18,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:18,798 INFO L225 Difference]: With dead ends: 1048 [2024-11-07 01:46:18,798 INFO L226 Difference]: Without dead ends: 595 [2024-11-07 01:46:18,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:46:18,811 INFO L432 NwaCegarLoop]: 405 mSDtfsCounter, 1143 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 1267 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1148 SdHoareTripleChecker+Valid, 1749 SdHoareTripleChecker+Invalid, 1439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 1267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:18,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1148 Valid, 1749 Invalid, 1439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 1267 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 01:46:18,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2024-11-07 01:46:18,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 556. [2024-11-07 01:46:18,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 482 states have (on average 1.508298755186722) internal successors, (727), 488 states have internal predecessors, (727), 50 states have call successors, (50), 21 states have call predecessors, (50), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) [2024-11-07 01:46:18,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 830 transitions. [2024-11-07 01:46:18,931 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 830 transitions. Word has length 65 [2024-11-07 01:46:18,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:18,932 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 830 transitions. [2024-11-07 01:46:18,932 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-07 01:46:18,933 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 830 transitions. [2024-11-07 01:46:18,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:46:18,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:18,937 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:46:18,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:46:18,938 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:18,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:18,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1238647913, now seen corresponding path program 1 times [2024-11-07 01:46:18,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:18,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126140951] [2024-11-07 01:46:18,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:18,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:18,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:19,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:19,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:19,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:46:19,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:19,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:46:19,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:19,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:19,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:19,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:19,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:19,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:19,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:19,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:46:19,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:19,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-07 01:46:19,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:19,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126140951] [2024-11-07 01:46:19,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126140951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:19,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:19,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:46:19,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517137125] [2024-11-07 01:46:19,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:19,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:46:19,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:19,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:46:19,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:46:19,290 INFO L87 Difference]: Start difference. First operand 556 states and 830 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-07 01:46:20,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:20,743 INFO L93 Difference]: Finished difference Result 903 states and 1307 transitions. [2024-11-07 01:46:20,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 01:46:20,743 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-07 01:46:20,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:20,752 INFO L225 Difference]: With dead ends: 903 [2024-11-07 01:46:20,755 INFO L226 Difference]: Without dead ends: 726 [2024-11-07 01:46:20,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-07 01:46:20,759 INFO L432 NwaCegarLoop]: 429 mSDtfsCounter, 1764 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 1488 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1794 SdHoareTripleChecker+Valid, 1943 SdHoareTripleChecker+Invalid, 1676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 1488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:20,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1794 Valid, 1943 Invalid, 1676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 1488 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 01:46:20,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2024-11-07 01:46:20,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 652. [2024-11-07 01:46:20,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 558 states have (on average 1.489247311827957) internal successors, (831), 566 states have internal predecessors, (831), 61 states have call successors, (61), 28 states have call predecessors, (61), 31 states have return successors, (72), 61 states have call predecessors, (72), 59 states have call successors, (72) [2024-11-07 01:46:20,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 964 transitions. [2024-11-07 01:46:20,866 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 964 transitions. Word has length 65 [2024-11-07 01:46:20,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:20,867 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 964 transitions. [2024-11-07 01:46:20,867 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-07 01:46:20,868 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 964 transitions. [2024-11-07 01:46:20,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:46:20,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:20,873 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:46:20,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:46:20,873 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:20,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:20,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1027733273, now seen corresponding path program 1 times [2024-11-07 01:46:20,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:20,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693703614] [2024-11-07 01:46:20,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:20,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:20,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:20,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:20,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:46:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:20,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:46:20,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:21,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:21,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:21,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:21,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:21,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:46:21,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:21,087 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-07 01:46:21,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:21,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693703614] [2024-11-07 01:46:21,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693703614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:21,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:21,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:46:21,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954029818] [2024-11-07 01:46:21,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:21,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:46:21,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:21,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:46:21,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:46:21,090 INFO L87 Difference]: Start difference. First operand 652 states and 964 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-07 01:46:22,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:22,437 INFO L93 Difference]: Finished difference Result 951 states and 1375 transitions. [2024-11-07 01:46:22,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:46:22,438 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-07 01:46:22,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:22,445 INFO L225 Difference]: With dead ends: 951 [2024-11-07 01:46:22,445 INFO L226 Difference]: Without dead ends: 684 [2024-11-07 01:46:22,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-07 01:46:22,449 INFO L432 NwaCegarLoop]: 398 mSDtfsCounter, 906 mSDsluCounter, 2067 mSDsCounter, 0 mSdLazyCounter, 1833 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 2465 SdHoareTripleChecker+Invalid, 1961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:22,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 2465 Invalid, 1961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1833 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 01:46:22,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2024-11-07 01:46:22,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 657. [2024-11-07 01:46:22,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 562 states have (on average 1.4822064056939501) internal successors, (833), 570 states have internal predecessors, (833), 61 states have call successors, (61), 28 states have call predecessors, (61), 32 states have return successors, (73), 62 states have call predecessors, (73), 59 states have call successors, (73) [2024-11-07 01:46:22,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 967 transitions. [2024-11-07 01:46:22,493 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 967 transitions. Word has length 65 [2024-11-07 01:46:22,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:22,493 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 967 transitions. [2024-11-07 01:46:22,494 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-07 01:46:22,494 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 967 transitions. [2024-11-07 01:46:22,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:46:22,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:22,496 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:46:22,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:46:22,496 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:22,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:22,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1626025, now seen corresponding path program 1 times [2024-11-07 01:46:22,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:22,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437429454] [2024-11-07 01:46:22,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:22,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:22,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:22,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:22,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:22,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:46:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:22,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:46:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:22,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:22,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:22,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:22,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:46:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:22,689 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-07 01:46:22,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:22,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437429454] [2024-11-07 01:46:22,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437429454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:22,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:22,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:46:22,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184974409] [2024-11-07 01:46:22,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:22,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:46:22,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:22,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:46:22,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:46:22,694 INFO L87 Difference]: Start difference. First operand 657 states and 967 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-07 01:46:24,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:24,916 INFO L93 Difference]: Finished difference Result 2319 states and 3239 transitions. [2024-11-07 01:46:24,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-07 01:46:24,917 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-07 01:46:24,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:24,936 INFO L225 Difference]: With dead ends: 2319 [2024-11-07 01:46:24,936 INFO L226 Difference]: Without dead ends: 2047 [2024-11-07 01:46:24,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2024-11-07 01:46:24,942 INFO L432 NwaCegarLoop]: 522 mSDtfsCounter, 2496 mSDsluCounter, 2055 mSDsCounter, 0 mSdLazyCounter, 2093 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2510 SdHoareTripleChecker+Valid, 2577 SdHoareTripleChecker+Invalid, 2489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 2093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:24,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2510 Valid, 2577 Invalid, 2489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 2093 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 01:46:24,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states. [2024-11-07 01:46:25,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 1797. [2024-11-07 01:46:25,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1797 states, 1462 states have (on average 1.377564979480164) internal successors, (2014), 1490 states have internal predecessors, (2014), 178 states have call successors, (178), 130 states have call predecessors, (178), 155 states have return successors, (259), 180 states have call predecessors, (259), 176 states have call successors, (259) [2024-11-07 01:46:25,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2451 transitions. [2024-11-07 01:46:25,111 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2451 transitions. Word has length 65 [2024-11-07 01:46:25,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:25,111 INFO L471 AbstractCegarLoop]: Abstraction has 1797 states and 2451 transitions. [2024-11-07 01:46:25,112 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-07 01:46:25,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2451 transitions. [2024-11-07 01:46:25,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:46:25,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:25,113 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:46:25,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:46:25,114 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:25,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:25,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1049823064, now seen corresponding path program 1 times [2024-11-07 01:46:25,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:25,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798175887] [2024-11-07 01:46:25,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:25,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:25,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:25,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:25,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:46:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:25,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:46:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:25,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:25,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:25,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:25,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:25,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:25,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:46:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:25,273 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-07 01:46:25,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:25,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798175887] [2024-11-07 01:46:25,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798175887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:25,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:25,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:46:25,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207741441] [2024-11-07 01:46:25,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:25,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:46:25,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:25,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:46:25,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:46:25,276 INFO L87 Difference]: Start difference. First operand 1797 states and 2451 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-07 01:46:26,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:26,578 INFO L93 Difference]: Finished difference Result 3394 states and 4570 transitions. [2024-11-07 01:46:26,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 01:46:26,579 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-07 01:46:26,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:26,590 INFO L225 Difference]: With dead ends: 3394 [2024-11-07 01:46:26,590 INFO L226 Difference]: Without dead ends: 1982 [2024-11-07 01:46:26,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:46:26,598 INFO L432 NwaCegarLoop]: 397 mSDtfsCounter, 609 mSDsluCounter, 2386 mSDsCounter, 0 mSdLazyCounter, 1883 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 2783 SdHoareTripleChecker+Invalid, 1968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:26,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 2783 Invalid, 1968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1883 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:46:26,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2024-11-07 01:46:26,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1842. [2024-11-07 01:46:26,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1842 states, 1498 states have (on average 1.3624833110814418) internal successors, (2041), 1526 states have internal predecessors, (2041), 178 states have call successors, (178), 130 states have call predecessors, (178), 164 states have return successors, (271), 189 states have call predecessors, (271), 176 states have call successors, (271) [2024-11-07 01:46:26,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2490 transitions. [2024-11-07 01:46:26,720 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2490 transitions. Word has length 65 [2024-11-07 01:46:26,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:26,721 INFO L471 AbstractCegarLoop]: Abstraction has 1842 states and 2490 transitions. [2024-11-07 01:46:26,721 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-07 01:46:26,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2490 transitions. [2024-11-07 01:46:26,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:46:26,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:26,723 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:46:26,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:46:26,724 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:26,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:26,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1858940838, now seen corresponding path program 1 times [2024-11-07 01:46:26,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:26,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205494266] [2024-11-07 01:46:26,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:26,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:26,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:26,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:26,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:46:26,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:26,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:46:26,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:26,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:26,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:26,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:26,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:26,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:46:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:26,944 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-07 01:46:26,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:26,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205494266] [2024-11-07 01:46:26,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205494266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:26,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:26,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:46:26,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982827726] [2024-11-07 01:46:26,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:26,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:46:26,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:26,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:46:26,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:46:26,947 INFO L87 Difference]: Start difference. First operand 1842 states and 2490 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-07 01:46:28,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:28,092 INFO L93 Difference]: Finished difference Result 3277 states and 4329 transitions. [2024-11-07 01:46:28,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 01:46:28,093 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-07 01:46:28,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:28,105 INFO L225 Difference]: With dead ends: 3277 [2024-11-07 01:46:28,105 INFO L226 Difference]: Without dead ends: 2040 [2024-11-07 01:46:28,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-11-07 01:46:28,110 INFO L432 NwaCegarLoop]: 368 mSDtfsCounter, 1701 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 1421 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1729 SdHoareTripleChecker+Valid, 1710 SdHoareTripleChecker+Invalid, 1614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 1421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:28,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1729 Valid, 1710 Invalid, 1614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 1421 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:46:28,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2040 states. [2024-11-07 01:46:28,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2040 to 1820. [2024-11-07 01:46:28,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1820 states, 1484 states have (on average 1.3591644204851752) internal successors, (2017), 1506 states have internal predecessors, (2017), 178 states have call successors, (178), 130 states have call predecessors, (178), 156 states have return successors, (255), 187 states have call predecessors, (255), 176 states have call successors, (255) [2024-11-07 01:46:28,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1820 states to 1820 states and 2450 transitions. [2024-11-07 01:46:28,282 INFO L78 Accepts]: Start accepts. Automaton has 1820 states and 2450 transitions. Word has length 65 [2024-11-07 01:46:28,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:28,283 INFO L471 AbstractCegarLoop]: Abstraction has 1820 states and 2450 transitions. [2024-11-07 01:46:28,283 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-07 01:46:28,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 2450 transitions. [2024-11-07 01:46:28,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:46:28,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:28,288 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:46:28,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 01:46:28,289 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:28,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:28,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1992954344, now seen corresponding path program 1 times [2024-11-07 01:46:28,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:28,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875376109] [2024-11-07 01:46:28,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:28,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:28,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:28,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:46:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:28,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:46:28,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:28,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:28,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:28,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:28,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:28,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:28,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:46:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:28,415 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-07 01:46:28,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:28,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875376109] [2024-11-07 01:46:28,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875376109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:28,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:28,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:46:28,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046726826] [2024-11-07 01:46:28,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:28,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:46:28,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:28,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:46:28,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:46:28,417 INFO L87 Difference]: Start difference. First operand 1820 states and 2450 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-07 01:46:29,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:29,273 INFO L93 Difference]: Finished difference Result 4895 states and 6429 transitions. [2024-11-07 01:46:29,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 01:46:29,274 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-07 01:46:29,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:29,289 INFO L225 Difference]: With dead ends: 4895 [2024-11-07 01:46:29,289 INFO L226 Difference]: Without dead ends: 3463 [2024-11-07 01:46:29,293 INFO L431 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-07 01:46:29,294 INFO L432 NwaCegarLoop]: 364 mSDtfsCounter, 1675 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1709 SdHoareTripleChecker+Valid, 1374 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:29,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1709 Valid, 1374 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 01:46:29,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3463 states. [2024-11-07 01:46:29,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3463 to 3191. [2024-11-07 01:46:29,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3191 states, 2550 states have (on average 1.3074509803921568) internal successors, (3334), 2593 states have internal predecessors, (3334), 330 states have call successors, (330), 253 states have call predecessors, (330), 309 states have return successors, (527), 351 states have call predecessors, (527), 328 states have call successors, (527) [2024-11-07 01:46:29,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3191 states to 3191 states and 4191 transitions. [2024-11-07 01:46:29,506 INFO L78 Accepts]: Start accepts. Automaton has 3191 states and 4191 transitions. Word has length 65 [2024-11-07 01:46:29,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:29,506 INFO L471 AbstractCegarLoop]: Abstraction has 3191 states and 4191 transitions. [2024-11-07 01:46:29,507 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-07 01:46:29,507 INFO L276 IsEmpty]: Start isEmpty. Operand 3191 states and 4191 transitions. [2024-11-07 01:46:29,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 01:46:29,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:29,512 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:46:29,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 01:46:29,512 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:29,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:29,513 INFO L85 PathProgramCache]: Analyzing trace with hash -969448573, now seen corresponding path program 1 times [2024-11-07 01:46:29,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:29,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509442906] [2024-11-07 01:46:29,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:29,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:29,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:29,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:29,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:46:29,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:29,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:46:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:29,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:29,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:29,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:29,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:29,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:46:29,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:29,599 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-07 01:46:29,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:29,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509442906] [2024-11-07 01:46:29,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509442906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:29,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:29,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:46:29,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860401047] [2024-11-07 01:46:29,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:29,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:46:29,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:29,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:46:29,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:46:29,600 INFO L87 Difference]: Start difference. First operand 3191 states and 4191 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-07 01:46:30,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:30,726 INFO L93 Difference]: Finished difference Result 8209 states and 10705 transitions. [2024-11-07 01:46:30,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:46:30,727 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-07 01:46:30,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:30,752 INFO L225 Difference]: With dead ends: 8209 [2024-11-07 01:46:30,752 INFO L226 Difference]: Without dead ends: 5385 [2024-11-07 01:46:30,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:46:30,760 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 790 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 1711 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:30,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 1711 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:46:30,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5385 states. [2024-11-07 01:46:31,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5385 to 4869. [2024-11-07 01:46:31,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4869 states, 3835 states have (on average 1.2865710560625816) internal successors, (4934), 3885 states have internal predecessors, (4934), 524 states have call successors, (524), 427 states have call predecessors, (524), 508 states have return successors, (848), 563 states have call predecessors, (848), 522 states have call successors, (848) [2024-11-07 01:46:31,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4869 states to 4869 states and 6306 transitions. [2024-11-07 01:46:31,131 INFO L78 Accepts]: Start accepts. Automaton has 4869 states and 6306 transitions. Word has length 66 [2024-11-07 01:46:31,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:31,132 INFO L471 AbstractCegarLoop]: Abstraction has 4869 states and 6306 transitions. [2024-11-07 01:46:31,132 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-07 01:46:31,132 INFO L276 IsEmpty]: Start isEmpty. Operand 4869 states and 6306 transitions. [2024-11-07 01:46:31,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 01:46:31,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:31,135 INFO L215 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-07 01:46:31,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 01:46:31,135 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:31,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:31,136 INFO L85 PathProgramCache]: Analyzing trace with hash -966948426, now seen corresponding path program 1 times [2024-11-07 01:46:31,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:31,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335564871] [2024-11-07 01:46:31,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:31,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:31,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:31,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:31,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:46:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:31,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:46:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:31,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:31,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:31,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:31,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:31,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:46:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:31,252 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-07 01:46:31,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:31,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335564871] [2024-11-07 01:46:31,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335564871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:31,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:31,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:46:31,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677417460] [2024-11-07 01:46:31,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:31,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:46:31,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:31,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:46:31,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:46:31,255 INFO L87 Difference]: Start difference. First operand 4869 states and 6306 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-07 01:46:32,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:32,453 INFO L93 Difference]: Finished difference Result 6499 states and 8308 transitions. [2024-11-07 01:46:32,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 01:46:32,454 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-07 01:46:32,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:32,488 INFO L225 Difference]: With dead ends: 6499 [2024-11-07 01:46:32,488 INFO L226 Difference]: Without dead ends: 6496 [2024-11-07 01:46:32,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2024-11-07 01:46:32,495 INFO L432 NwaCegarLoop]: 401 mSDtfsCounter, 2341 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2350 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:32,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2350 Valid, 1084 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:46:32,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6496 states. [2024-11-07 01:46:32,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6496 to 5923. [2024-11-07 01:46:32,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5923 states, 4638 states have (on average 1.2729624838292368) internal successors, (5904), 4697 states have internal predecessors, (5904), 650 states have call successors, (650), 541 states have call predecessors, (650), 633 states have return successors, (1041), 691 states have call predecessors, (1041), 649 states have call successors, (1041) [2024-11-07 01:46:32,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5923 states to 5923 states and 7595 transitions. [2024-11-07 01:46:32,973 INFO L78 Accepts]: Start accepts. Automaton has 5923 states and 7595 transitions. Word has length 73 [2024-11-07 01:46:32,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:32,975 INFO L471 AbstractCegarLoop]: Abstraction has 5923 states and 7595 transitions. [2024-11-07 01:46:32,975 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-07 01:46:32,975 INFO L276 IsEmpty]: Start isEmpty. Operand 5923 states and 7595 transitions. [2024-11-07 01:46:32,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-07 01:46:32,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:32,977 INFO L215 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-07 01:46:32,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 01:46:32,977 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:32,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:32,978 INFO L85 PathProgramCache]: Analyzing trace with hash 87997932, now seen corresponding path program 1 times [2024-11-07 01:46:32,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:32,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504909524] [2024-11-07 01:46:32,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:32,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:32,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:33,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:33,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:46:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:33,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:46:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:33,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:33,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:33,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:33,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:33,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:33,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:46:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:33,213 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-07 01:46:33,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:33,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504909524] [2024-11-07 01:46:33,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504909524] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:46:33,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920636730] [2024-11-07 01:46:33,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:33,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:46:33,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:46:33,220 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:46:33,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 01:46:33,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:33,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 01:46:33,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:46:33,633 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-07 01:46:33,633 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:46:33,733 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-07 01:46:33,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920636730] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:46:33,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 01:46:33,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2024-11-07 01:46:33,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255764998] [2024-11-07 01:46:33,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 01:46:33,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 01:46:33,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:33,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 01:46:33,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-07 01:46:33,736 INFO L87 Difference]: Start difference. First operand 5923 states and 7595 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-07 01:46:36,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:36,397 INFO L93 Difference]: Finished difference Result 13569 states and 17123 transitions. [2024-11-07 01:46:36,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-07 01:46:36,398 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-07 01:46:36,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:36,469 INFO L225 Difference]: With dead ends: 13569 [2024-11-07 01:46:36,469 INFO L226 Difference]: Without dead ends: 13566 [2024-11-07 01:46:36,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2024-11-07 01:46:36,476 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 1838 mSDsluCounter, 2323 mSDsCounter, 0 mSdLazyCounter, 2304 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1906 SdHoareTripleChecker+Valid, 2810 SdHoareTripleChecker+Invalid, 2476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 2304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:36,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1906 Valid, 2810 Invalid, 2476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 2304 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 01:46:36,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13566 states. [2024-11-07 01:46:37,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13566 to 11181. [2024-11-07 01:46:37,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11181 states, 8730 states have (on average 1.261512027491409) internal successors, (11013), 8841 states have internal predecessors, (11013), 1216 states have call successors, (1216), 1031 states have call predecessors, (1216), 1233 states have return successors, (1980), 1315 states have call predecessors, (1980), 1215 states have call successors, (1980) [2024-11-07 01:46:37,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11181 states to 11181 states and 14209 transitions. [2024-11-07 01:46:37,393 INFO L78 Accepts]: Start accepts. Automaton has 11181 states and 14209 transitions. Word has length 74 [2024-11-07 01:46:37,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:37,393 INFO L471 AbstractCegarLoop]: Abstraction has 11181 states and 14209 transitions. [2024-11-07 01:46:37,394 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-07 01:46:37,394 INFO L276 IsEmpty]: Start isEmpty. Operand 11181 states and 14209 transitions. [2024-11-07 01:46:37,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 01:46:37,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:37,397 INFO L215 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-07 01:46:37,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 01:46:37,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-07 01:46:37,600 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:37,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:37,601 INFO L85 PathProgramCache]: Analyzing trace with hash 55714230, now seen corresponding path program 2 times [2024-11-07 01:46:37,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:37,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709630839] [2024-11-07 01:46:37,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:37,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:37,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:37,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:37,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:46:37,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:37,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:46:37,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:37,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:37,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:37,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:37,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:46:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:37,679 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-07 01:46:37,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:37,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709630839] [2024-11-07 01:46:37,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709630839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:37,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:37,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:46:37,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148343768] [2024-11-07 01:46:37,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:37,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:46:37,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:37,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:46:37,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:46:37,681 INFO L87 Difference]: Start difference. First operand 11181 states and 14209 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-07 01:46:39,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:39,084 INFO L93 Difference]: Finished difference Result 17724 states and 22551 transitions. [2024-11-07 01:46:39,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 01:46:39,084 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-07 01:46:39,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:39,116 INFO L225 Difference]: With dead ends: 17724 [2024-11-07 01:46:39,117 INFO L226 Difference]: Without dead ends: 7786 [2024-11-07 01:46:39,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-07 01:46:39,146 INFO L432 NwaCegarLoop]: 429 mSDtfsCounter, 1247 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1281 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:39,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1281 Valid, 1498 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:46:39,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7786 states. [2024-11-07 01:46:39,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7786 to 7234. [2024-11-07 01:46:39,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7234 states, 5677 states have (on average 1.2423815395455347) internal successors, (7053), 5744 states have internal predecessors, (7053), 783 states have call successors, (783), 655 states have call predecessors, (783), 772 states have return successors, (1199), 841 states have call predecessors, (1199), 782 states have call successors, (1199) [2024-11-07 01:46:39,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7234 states to 7234 states and 9035 transitions. [2024-11-07 01:46:39,922 INFO L78 Accepts]: Start accepts. Automaton has 7234 states and 9035 transitions. Word has length 77 [2024-11-07 01:46:39,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:39,923 INFO L471 AbstractCegarLoop]: Abstraction has 7234 states and 9035 transitions. [2024-11-07 01:46:39,923 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-07 01:46:39,923 INFO L276 IsEmpty]: Start isEmpty. Operand 7234 states and 9035 transitions. [2024-11-07 01:46:39,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-07 01:46:39,927 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:39,928 INFO L215 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-07 01:46:39,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 01:46:39,928 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:39,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:39,928 INFO L85 PathProgramCache]: Analyzing trace with hash -710750594, now seen corresponding path program 1 times [2024-11-07 01:46:39,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:39,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835892075] [2024-11-07 01:46:39,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:39,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:39,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:40,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:40,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:46:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:40,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:46:40,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:40,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:40,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:40,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:40,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:40,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:40,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:46:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:40,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 01:46:40,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:40,055 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-07 01:46:40,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:40,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835892075] [2024-11-07 01:46:40,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835892075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:40,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:40,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:46:40,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448231581] [2024-11-07 01:46:40,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:40,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:46:40,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:40,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:46:40,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:46:40,057 INFO L87 Difference]: Start difference. First operand 7234 states and 9035 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-07 01:46:41,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:41,860 INFO L93 Difference]: Finished difference Result 21108 states and 26252 transitions. [2024-11-07 01:46:41,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 01:46:41,861 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-07 01:46:41,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:41,933 INFO L225 Difference]: With dead ends: 21108 [2024-11-07 01:46:41,933 INFO L226 Difference]: Without dead ends: 14265 [2024-11-07 01:46:41,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-11-07 01:46:41,960 INFO L432 NwaCegarLoop]: 416 mSDtfsCounter, 1025 mSDsluCounter, 1749 mSDsCounter, 0 mSdLazyCounter, 1406 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1041 SdHoareTripleChecker+Valid, 2165 SdHoareTripleChecker+Invalid, 1585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 1406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:41,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1041 Valid, 2165 Invalid, 1585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 1406 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:46:41,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14265 states. [2024-11-07 01:46:43,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14265 to 13406. [2024-11-07 01:46:43,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13406 states, 10353 states have (on average 1.21124311793683) internal successors, (12540), 10526 states have internal predecessors, (12540), 1499 states have call successors, (1499), 1259 states have call predecessors, (1499), 1552 states have return successors, (2602), 1633 states have call predecessors, (2602), 1498 states have call successors, (2602) [2024-11-07 01:46:43,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13406 states to 13406 states and 16641 transitions. [2024-11-07 01:46:43,122 INFO L78 Accepts]: Start accepts. Automaton has 13406 states and 16641 transitions. Word has length 84 [2024-11-07 01:46:43,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:43,123 INFO L471 AbstractCegarLoop]: Abstraction has 13406 states and 16641 transitions. [2024-11-07 01:46:43,123 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-07 01:46:43,123 INFO L276 IsEmpty]: Start isEmpty. Operand 13406 states and 16641 transitions. [2024-11-07 01:46:43,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 01:46:43,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:43,131 INFO L215 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-07 01:46:43,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 01:46:43,131 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:43,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:43,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1088395180, now seen corresponding path program 1 times [2024-11-07 01:46:43,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:43,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186337453] [2024-11-07 01:46:43,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:43,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:43,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:43,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:46:43,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:43,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:46:43,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:43,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:43,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:43,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:43,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:43,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:43,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:43,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:46:43,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:43,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 01:46:43,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:43,303 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-07 01:46:43,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:43,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186337453] [2024-11-07 01:46:43,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186337453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:43,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:43,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:46:43,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886251735] [2024-11-07 01:46:43,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:43,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:46:43,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:43,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:46:43,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:46:43,306 INFO L87 Difference]: Start difference. First operand 13406 states and 16641 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-07 01:46:45,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:45,618 INFO L93 Difference]: Finished difference Result 24280 states and 29960 transitions. [2024-11-07 01:46:45,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-07 01:46:45,618 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-07 01:46:45,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:45,676 INFO L225 Difference]: With dead ends: 24280 [2024-11-07 01:46:45,676 INFO L226 Difference]: Without dead ends: 11881 [2024-11-07 01:46:45,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2024-11-07 01:46:45,705 INFO L432 NwaCegarLoop]: 401 mSDtfsCounter, 1946 mSDsluCounter, 1787 mSDsCounter, 0 mSdLazyCounter, 1599 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1991 SdHoareTripleChecker+Valid, 2188 SdHoareTripleChecker+Invalid, 1904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 1599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:45,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1991 Valid, 2188 Invalid, 1904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 1599 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 01:46:45,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11881 states. [2024-11-07 01:46:46,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11881 to 10981. [2024-11-07 01:46:46,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10981 states, 8519 states have (on average 1.2033102476816528) internal successors, (10251), 8659 states have internal predecessors, (10251), 1200 states have call successors, (1200), 1008 states have call predecessors, (1200), 1260 states have return successors, (1934), 1323 states have call predecessors, (1934), 1199 states have call successors, (1934) [2024-11-07 01:46:46,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10981 states to 10981 states and 13385 transitions. [2024-11-07 01:46:46,605 INFO L78 Accepts]: Start accepts. Automaton has 10981 states and 13385 transitions. Word has length 93 [2024-11-07 01:46:46,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:46,606 INFO L471 AbstractCegarLoop]: Abstraction has 10981 states and 13385 transitions. [2024-11-07 01:46:46,606 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-07 01:46:46,606 INFO L276 IsEmpty]: Start isEmpty. Operand 10981 states and 13385 transitions. [2024-11-07 01:46:46,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-07 01:46:46,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:46,618 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:46:46,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 01:46:46,619 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:46,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:46,619 INFO L85 PathProgramCache]: Analyzing trace with hash 2115425522, now seen corresponding path program 1 times [2024-11-07 01:46:46,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:46,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155630021] [2024-11-07 01:46:46,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:46,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:46,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:46,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:46,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:46:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:46,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:46:46,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:46,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:46,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:46,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:46,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:46,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:46:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:46,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 01:46:46,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:46,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 01:46:46,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:46,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 01:46:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:46,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 01:46:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:46,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:46,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:46,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:46,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:46:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:46,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 01:46:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:46,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 01:46:46,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:46,798 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-07 01:46:46,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:46,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155630021] [2024-11-07 01:46:46,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155630021] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:46:46,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582466688] [2024-11-07 01:46:46,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:46,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:46:46,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:46:46,803 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:46:46,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 01:46:46,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:46,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 01:46:46,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:46:46,995 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-07 01:46:46,995 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:46:46,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582466688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:46,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 01:46:46,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2024-11-07 01:46:46,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136552014] [2024-11-07 01:46:46,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:46,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:46:46,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:46,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:46:46,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 01:46:46,998 INFO L87 Difference]: Start difference. First operand 10981 states and 13385 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 01:46:47,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:47,374 INFO L93 Difference]: Finished difference Result 15841 states and 19202 transitions. [2024-11-07 01:46:47,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 01:46:47,375 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2024-11-07 01:46:47,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:47,413 INFO L225 Difference]: With dead ends: 15841 [2024-11-07 01:46:47,413 INFO L226 Difference]: Without dead ends: 5259 [2024-11-07 01:46:47,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 01:46:47,439 INFO L432 NwaCegarLoop]: 693 mSDtfsCounter, 0 mSDsluCounter, 2763 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3456 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:47,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3456 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:46:47,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5259 states. [2024-11-07 01:46:47,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5259 to 5105. [2024-11-07 01:46:47,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5105 states, 4084 states have (on average 1.2039666993143976) internal successors, (4917), 4122 states have internal predecessors, (4917), 502 states have call successors, (502), 402 states have call predecessors, (502), 517 states have return successors, (774), 581 states have call predecessors, (774), 501 states have call successors, (774) [2024-11-07 01:46:47,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5105 states to 5105 states and 6193 transitions. [2024-11-07 01:46:47,795 INFO L78 Accepts]: Start accepts. Automaton has 5105 states and 6193 transitions. Word has length 145 [2024-11-07 01:46:47,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:47,796 INFO L471 AbstractCegarLoop]: Abstraction has 5105 states and 6193 transitions. [2024-11-07 01:46:47,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 01:46:47,796 INFO L276 IsEmpty]: Start isEmpty. Operand 5105 states and 6193 transitions. [2024-11-07 01:46:47,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-07 01:46:47,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:47,805 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:46:47,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 01:46:48,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:46:48,006 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:48,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:48,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1007068518, now seen corresponding path program 1 times [2024-11-07 01:46:48,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:48,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525247337] [2024-11-07 01:46:48,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:48,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:48,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:48,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:48,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:48,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:46:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:48,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:46:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:48,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:48,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:48,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:48,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:46:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:48,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 01:46:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:48,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 01:46:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:48,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 01:46:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:48,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 01:46:48,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:48,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:48,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:48,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 01:46:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:48,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 01:46:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:48,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 01:46:48,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:48,122 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-07 01:46:48,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:48,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525247337] [2024-11-07 01:46:48,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525247337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:48,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:48,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:46:48,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132368327] [2024-11-07 01:46:48,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:48,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:46:48,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:48,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:46:48,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:46:48,124 INFO L87 Difference]: Start difference. First operand 5105 states and 6193 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-07 01:46:49,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:49,183 INFO L93 Difference]: Finished difference Result 5653 states and 6811 transitions. [2024-11-07 01:46:49,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:46:49,184 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 147 [2024-11-07 01:46:49,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:49,208 INFO L225 Difference]: With dead ends: 5653 [2024-11-07 01:46:49,208 INFO L226 Difference]: Without dead ends: 4904 [2024-11-07 01:46:49,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-07 01:46:49,213 INFO L432 NwaCegarLoop]: 390 mSDtfsCounter, 716 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:49,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 1625 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 01:46:49,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4904 states. [2024-11-07 01:46:49,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4904 to 4680. [2024-11-07 01:46:49,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4680 states, 3755 states have (on average 1.2082556591211717) internal successors, (4537), 3790 states have internal predecessors, (4537), 456 states have call successors, (456), 362 states have call predecessors, (456), 467 states have return successors, (710), 528 states have call predecessors, (710), 455 states have call successors, (710) [2024-11-07 01:46:49,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4680 states to 4680 states and 5703 transitions. [2024-11-07 01:46:49,564 INFO L78 Accepts]: Start accepts. Automaton has 4680 states and 5703 transitions. Word has length 147 [2024-11-07 01:46:49,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:49,565 INFO L471 AbstractCegarLoop]: Abstraction has 4680 states and 5703 transitions. [2024-11-07 01:46:49,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-07 01:46:49,565 INFO L276 IsEmpty]: Start isEmpty. Operand 4680 states and 5703 transitions. [2024-11-07 01:46:49,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-07 01:46:49,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:49,574 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:46:49,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 01:46:49,574 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:49,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:49,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1996247621, now seen corresponding path program 1 times [2024-11-07 01:46:49,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:49,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435993677] [2024-11-07 01:46:49,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:49,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:49,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:49,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:49,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 01:46:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:49,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:46:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:49,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:49,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:49,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 01:46:49,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:49,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:46:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:49,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 01:46:49,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:49,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 01:46:49,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:49,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 01:46:49,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:49,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 01:46:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:49,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:49,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:49,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 01:46:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:49,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 01:46:49,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:49,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 01:46:49,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:49,722 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 01:46:49,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:49,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435993677] [2024-11-07 01:46:49,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435993677] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:46:49,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290081968] [2024-11-07 01:46:49,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:49,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:46:49,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:46:49,726 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:46:49,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 01:46:49,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:49,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 01:46:49,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:46:49,994 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-07 01:46:49,995 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:46:49,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290081968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:49,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 01:46:49,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-07 01:46:49,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075645256] [2024-11-07 01:46:49,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:49,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:46:49,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:49,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:46:49,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:46:49,996 INFO L87 Difference]: Start difference. First operand 4680 states and 5703 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 01:46:50,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:50,255 INFO L93 Difference]: Finished difference Result 6516 states and 7863 transitions. [2024-11-07 01:46:50,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:46:50,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 158 [2024-11-07 01:46:50,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:50,275 INFO L225 Difference]: With dead ends: 6516 [2024-11-07 01:46:50,275 INFO L226 Difference]: Without dead ends: 2476 [2024-11-07 01:46:50,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:46:50,283 INFO L432 NwaCegarLoop]: 691 mSDtfsCounter, 603 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:50,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 796 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:46:50,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2476 states. [2024-11-07 01:46:50,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2476 to 2476. [2024-11-07 01:46:50,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2476 states, 2021 states have (on average 1.2261256803562592) internal successors, (2478), 2040 states have internal predecessors, (2478), 227 states have call successors, (227), 174 states have call predecessors, (227), 226 states have return successors, (328), 262 states have call predecessors, (328), 226 states have call successors, (328) [2024-11-07 01:46:50,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 3033 transitions. [2024-11-07 01:46:50,457 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 3033 transitions. Word has length 158 [2024-11-07 01:46:50,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:50,457 INFO L471 AbstractCegarLoop]: Abstraction has 2476 states and 3033 transitions. [2024-11-07 01:46:50,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 01:46:50,457 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 3033 transitions. [2024-11-07 01:46:50,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-07 01:46:50,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:50,463 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:46:50,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-07 01:46:50,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:46:50,668 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:50,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:50,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1820731308, now seen corresponding path program 1 times [2024-11-07 01:46:50,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:50,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402933562] [2024-11-07 01:46:50,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:50,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:50,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:50,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:50,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:46:50,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:50,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:46:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:50,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:50,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:50,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:50,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:50,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:50,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:46:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:50,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:46:50,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:50,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 01:46:50,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:50,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 01:46:50,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:50,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:46:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:50,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:50,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:50,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:50,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 01:46:50,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:50,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-07 01:46:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:50,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 01:46:50,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:50,823 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-07 01:46:50,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:50,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402933562] [2024-11-07 01:46:50,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402933562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:50,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:50,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:46:50,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764886401] [2024-11-07 01:46:50,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:50,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:46:50,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:50,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:46:50,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:46:50,825 INFO L87 Difference]: Start difference. First operand 2476 states and 3033 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-07 01:46:51,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:51,810 INFO L93 Difference]: Finished difference Result 4340 states and 5243 transitions. [2024-11-07 01:46:51,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 01:46:51,811 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 159 [2024-11-07 01:46:51,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:51,824 INFO L225 Difference]: With dead ends: 4340 [2024-11-07 01:46:51,825 INFO L226 Difference]: Without dead ends: 2579 [2024-11-07 01:46:51,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:46:51,828 INFO L432 NwaCegarLoop]: 416 mSDtfsCounter, 934 mSDsluCounter, 1352 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 1768 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:51,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [935 Valid, 1768 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1162 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:46:51,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2579 states. [2024-11-07 01:46:51,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2579 to 2035. [2024-11-07 01:46:51,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2035 states, 1672 states have (on average 1.2446172248803828) internal successors, (2081), 1690 states have internal predecessors, (2081), 183 states have call successors, (183), 138 states have call predecessors, (183), 178 states have return successors, (260), 207 states have call predecessors, (260), 182 states have call successors, (260) [2024-11-07 01:46:51,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 2524 transitions. [2024-11-07 01:46:51,985 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 2524 transitions. Word has length 159 [2024-11-07 01:46:51,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:51,986 INFO L471 AbstractCegarLoop]: Abstraction has 2035 states and 2524 transitions. [2024-11-07 01:46:51,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-07 01:46:51,986 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 2524 transitions. [2024-11-07 01:46:51,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-07 01:46:51,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:51,989 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:46:51,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 01:46:51,990 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:51,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:51,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1730507581, now seen corresponding path program 1 times [2024-11-07 01:46:51,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:51,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320954463] [2024-11-07 01:46:51,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:51,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:52,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:52,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:46:52,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:52,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:46:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:52,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:52,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:52,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:52,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:52,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:52,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:46:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:52,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:46:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:52,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 01:46:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:52,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 01:46:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:52,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 01:46:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:52,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:52,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:52,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:52,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:52,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 01:46:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:52,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 01:46:52,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:52,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 01:46:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:52,231 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 01:46:52,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:52,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320954463] [2024-11-07 01:46:52,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320954463] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:46:52,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926596207] [2024-11-07 01:46:52,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:52,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:46:52,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:46:52,234 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:46:52,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 01:46:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:52,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 01:46:52,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:46:52,537 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-07 01:46:52,538 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:46:52,806 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-07 01:46:52,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926596207] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:46:52,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 01:46:52,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2024-11-07 01:46:52,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434092119] [2024-11-07 01:46:52,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 01:46:52,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 01:46:52,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:52,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 01:46:52,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-07 01:46:52,810 INFO L87 Difference]: Start difference. First operand 2035 states and 2524 transitions. Second operand has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 12 states have internal predecessors, (246), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2024-11-07 01:46:54,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:54,265 INFO L93 Difference]: Finished difference Result 4070 states and 5002 transitions. [2024-11-07 01:46:54,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-07 01:46:54,266 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 12 states have internal predecessors, (246), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) Word has length 162 [2024-11-07 01:46:54,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:54,278 INFO L225 Difference]: With dead ends: 4070 [2024-11-07 01:46:54,278 INFO L226 Difference]: Without dead ends: 2322 [2024-11-07 01:46:54,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 357 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2024-11-07 01:46:54,283 INFO L432 NwaCegarLoop]: 356 mSDtfsCounter, 1946 mSDsluCounter, 2545 mSDsCounter, 0 mSdLazyCounter, 2410 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1975 SdHoareTripleChecker+Valid, 2901 SdHoareTripleChecker+Invalid, 2683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 2410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:54,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1975 Valid, 2901 Invalid, 2683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 2410 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 01:46:54,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2322 states. [2024-11-07 01:46:54,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2322 to 2122. [2024-11-07 01:46:54,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2122 states, 1717 states have (on average 1.2201514269073965) internal successors, (2095), 1740 states have internal predecessors, (2095), 205 states have call successors, (205), 162 states have call predecessors, (205), 198 states have return successors, (311), 220 states have call predecessors, (311), 204 states have call successors, (311) [2024-11-07 01:46:54,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 2611 transitions. [2024-11-07 01:46:54,466 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 2611 transitions. Word has length 162 [2024-11-07 01:46:54,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:54,466 INFO L471 AbstractCegarLoop]: Abstraction has 2122 states and 2611 transitions. [2024-11-07 01:46:54,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 12 states have internal predecessors, (246), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2024-11-07 01:46:54,467 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 2611 transitions. [2024-11-07 01:46:54,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-07 01:46:54,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:54,470 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:46:54,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 01:46:54,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-07 01:46:54,671 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:54,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:54,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1725657124, now seen corresponding path program 1 times [2024-11-07 01:46:54,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:54,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861455062] [2024-11-07 01:46:54,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:54,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:54,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:54,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:54,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 01:46:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:54,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:46:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:54,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:54,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:54,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:54,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:54,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 01:46:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:54,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:46:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:54,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 01:46:54,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:54,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:46:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:54,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 01:46:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:54,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 01:46:54,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:54,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 01:46:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:54,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:54,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:54,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 01:46:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:54,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 01:46:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:54,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:46:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:54,813 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-07 01:46:54,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:54,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861455062] [2024-11-07 01:46:54,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861455062] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:46:54,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884035847] [2024-11-07 01:46:54,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:54,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:46:54,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:46:54,818 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:46:54,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-07 01:46:54,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:54,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 01:46:54,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:46:55,012 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-11-07 01:46:55,012 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:46:55,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884035847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:55,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 01:46:55,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-07 01:46:55,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501466272] [2024-11-07 01:46:55,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:55,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:46:55,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:55,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:46:55,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-07 01:46:55,015 INFO L87 Difference]: Start difference. First operand 2122 states and 2611 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 01:46:55,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:55,612 INFO L93 Difference]: Finished difference Result 3767 states and 4534 transitions. [2024-11-07 01:46:55,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:46:55,612 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 179 [2024-11-07 01:46:55,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:55,622 INFO L225 Difference]: With dead ends: 3767 [2024-11-07 01:46:55,622 INFO L226 Difference]: Without dead ends: 1839 [2024-11-07 01:46:55,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-07 01:46:55,625 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 938 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:55,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [970 Valid, 1052 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:46:55,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2024-11-07 01:46:55,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1802. [2024-11-07 01:46:55,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1802 states, 1473 states have (on average 1.2253903598099118) internal successors, (1805), 1487 states have internal predecessors, (1805), 170 states have call successors, (170), 130 states have call predecessors, (170), 157 states have return successors, (239), 185 states have call predecessors, (239), 169 states have call successors, (239) [2024-11-07 01:46:55,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 2214 transitions. [2024-11-07 01:46:55,778 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 2214 transitions. Word has length 179 [2024-11-07 01:46:55,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:55,778 INFO L471 AbstractCegarLoop]: Abstraction has 1802 states and 2214 transitions. [2024-11-07 01:46:55,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 01:46:55,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2214 transitions. [2024-11-07 01:46:55,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 01:46:55,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:55,781 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:46:55,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-07 01:46:55,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:46:55,982 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:55,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:55,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1316332046, now seen corresponding path program 1 times [2024-11-07 01:46:55,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:55,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933585865] [2024-11-07 01:46:55,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:55,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:56,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:56,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:56,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:46:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:56,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:46:56,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:56,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 01:46:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:56,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:46:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:56,152 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-07 01:46:56,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:56,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933585865] [2024-11-07 01:46:56,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933585865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:56,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:56,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:46:56,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569891116] [2024-11-07 01:46:56,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:56,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:46:56,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:56,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:46:56,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:46:56,155 INFO L87 Difference]: Start difference. First operand 1802 states and 2214 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 3 states have internal predecessors, (157), 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-07 01:46:57,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:57,828 INFO L93 Difference]: Finished difference Result 2290 states and 2996 transitions. [2024-11-07 01:46:57,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:46:57,829 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 3 states have internal predecessors, (157), 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 167 [2024-11-07 01:46:57,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:57,837 INFO L225 Difference]: With dead ends: 2290 [2024-11-07 01:46:57,837 INFO L226 Difference]: Without dead ends: 1933 [2024-11-07 01:46:57,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:46:57,838 INFO L432 NwaCegarLoop]: 406 mSDtfsCounter, 1072 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1095 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:57,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1095 Valid, 960 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1099 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 01:46:57,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2024-11-07 01:46:58,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1802. [2024-11-07 01:46:58,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1802 states, 1473 states have (on average 1.2247114731839783) internal successors, (1804), 1487 states have internal predecessors, (1804), 170 states have call successors, (170), 130 states have call predecessors, (170), 157 states have return successors, (239), 185 states have call predecessors, (239), 169 states have call successors, (239) [2024-11-07 01:46:58,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 2213 transitions. [2024-11-07 01:46:58,153 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 2213 transitions. Word has length 167 [2024-11-07 01:46:58,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:58,155 INFO L471 AbstractCegarLoop]: Abstraction has 1802 states and 2213 transitions. [2024-11-07 01:46:58,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 3 states have internal predecessors, (157), 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-07 01:46:58,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2213 transitions. [2024-11-07 01:46:58,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 01:46:58,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:58,159 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:46:58,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 01:46:58,161 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:58,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:58,161 INFO L85 PathProgramCache]: Analyzing trace with hash 878896820, now seen corresponding path program 1 times [2024-11-07 01:46:58,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:58,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967553165] [2024-11-07 01:46:58,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:58,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:58,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:58,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:46:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:58,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:46:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:58,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 01:46:58,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:58,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:46:58,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:58,322 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-07 01:46:58,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:58,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967553165] [2024-11-07 01:46:58,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967553165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:58,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:58,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:46:58,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840381513] [2024-11-07 01:46:58,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:58,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:46:58,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:58,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:46:58,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:46:58,324 INFO L87 Difference]: Start difference. First operand 1802 states and 2213 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 3 states have internal predecessors, (157), 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-07 01:47:00,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:00,220 INFO L93 Difference]: Finished difference Result 2282 states and 2979 transitions. [2024-11-07 01:47:00,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:47:00,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 3 states have internal predecessors, (157), 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 167 [2024-11-07 01:47:00,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:00,230 INFO L225 Difference]: With dead ends: 2282 [2024-11-07 01:47:00,230 INFO L226 Difference]: Without dead ends: 1933 [2024-11-07 01:47:00,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:47:00,232 INFO L432 NwaCegarLoop]: 405 mSDtfsCounter, 1063 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1086 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:00,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1086 Valid, 958 Invalid, 1182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1098 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 01:47:00,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2024-11-07 01:47:00,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1802. [2024-11-07 01:47:00,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1802 states, 1473 states have (on average 1.2240325865580448) internal successors, (1803), 1487 states have internal predecessors, (1803), 170 states have call successors, (170), 130 states have call predecessors, (170), 157 states have return successors, (239), 185 states have call predecessors, (239), 169 states have call successors, (239) [2024-11-07 01:47:00,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 2212 transitions. [2024-11-07 01:47:00,516 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 2212 transitions. Word has length 167 [2024-11-07 01:47:00,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:00,517 INFO L471 AbstractCegarLoop]: Abstraction has 1802 states and 2212 transitions. [2024-11-07 01:47:00,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 3 states have internal predecessors, (157), 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-07 01:47:00,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2212 transitions. [2024-11-07 01:47:00,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 01:47:00,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:00,519 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:47:00,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 01:47:00,519 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:00,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:00,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1802064246, now seen corresponding path program 1 times [2024-11-07 01:47:00,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:00,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460908257] [2024-11-07 01:47:00,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:00,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:00,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:00,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:00,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:47:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:00,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:47:00,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:00,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 01:47:00,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:00,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:47:00,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:00,735 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-07 01:47:00,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:00,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460908257] [2024-11-07 01:47:00,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460908257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:00,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:00,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:47:00,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319523324] [2024-11-07 01:47:00,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:00,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:47:00,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:00,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:47:00,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:47:00,737 INFO L87 Difference]: Start difference. First operand 1802 states and 2212 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 4 states have internal predecessors, (157), 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-07 01:47:03,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:03,216 INFO L93 Difference]: Finished difference Result 2770 states and 3763 transitions. [2024-11-07 01:47:03,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:47:03,217 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 4 states have internal predecessors, (157), 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 167 [2024-11-07 01:47:03,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:03,228 INFO L225 Difference]: With dead ends: 2770 [2024-11-07 01:47:03,228 INFO L226 Difference]: Without dead ends: 2425 [2024-11-07 01:47:03,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:47:03,231 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 1672 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 2257 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1700 SdHoareTripleChecker+Valid, 1450 SdHoareTripleChecker+Invalid, 2395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 2257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:03,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1700 Valid, 1450 Invalid, 2395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 2257 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 01:47:03,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2425 states. [2024-11-07 01:47:03,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2425 to 2164. [2024-11-07 01:47:03,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2164 states, 1808 states have (on average 1.288716814159292) internal successors, (2330), 1823 states have internal predecessors, (2330), 190 states have call successors, (190), 136 states have call predecessors, (190), 164 states have return successors, (262), 205 states have call predecessors, (262), 189 states have call successors, (262) [2024-11-07 01:47:03,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2164 states to 2164 states and 2782 transitions. [2024-11-07 01:47:03,448 INFO L78 Accepts]: Start accepts. Automaton has 2164 states and 2782 transitions. Word has length 167 [2024-11-07 01:47:03,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:03,449 INFO L471 AbstractCegarLoop]: Abstraction has 2164 states and 2782 transitions. [2024-11-07 01:47:03,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 4 states have internal predecessors, (157), 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-07 01:47:03,449 INFO L276 IsEmpty]: Start isEmpty. Operand 2164 states and 2782 transitions. [2024-11-07 01:47:03,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 01:47:03,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:03,450 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:47:03,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 01:47:03,450 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:03,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:03,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1493316870, now seen corresponding path program 1 times [2024-11-07 01:47:03,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:03,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644688840] [2024-11-07 01:47:03,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:03,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:03,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:03,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:47:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:03,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:47:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:03,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 01:47:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:03,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:47:03,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:03,679 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-07 01:47:03,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:03,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644688840] [2024-11-07 01:47:03,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644688840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:03,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:03,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:47:03,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015177372] [2024-11-07 01:47:03,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:03,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:47:03,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:03,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:47:03,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:47:03,680 INFO L87 Difference]: Start difference. First operand 2164 states and 2782 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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-07 01:47:06,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:06,993 INFO L93 Difference]: Finished difference Result 3642 states and 5152 transitions. [2024-11-07 01:47:06,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:47:06,993 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2024-11-07 01:47:06,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:07,006 INFO L225 Difference]: With dead ends: 3642 [2024-11-07 01:47:07,006 INFO L226 Difference]: Without dead ends: 2935 [2024-11-07 01:47:07,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:47:07,009 INFO L432 NwaCegarLoop]: 601 mSDtfsCounter, 1713 mSDsluCounter, 2057 mSDsCounter, 0 mSdLazyCounter, 3549 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1741 SdHoareTripleChecker+Valid, 2658 SdHoareTripleChecker+Invalid, 3642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 3549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:07,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1741 Valid, 2658 Invalid, 3642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 3549 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-07 01:47:07,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2024-11-07 01:47:07,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 2501. [2024-11-07 01:47:07,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2501 states, 2118 states have (on average 1.3253068932955618) internal successors, (2807), 2134 states have internal predecessors, (2807), 210 states have call successors, (210), 142 states have call predecessors, (210), 171 states have return successors, (284), 226 states have call predecessors, (284), 209 states have call successors, (284) [2024-11-07 01:47:07,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2501 states to 2501 states and 3301 transitions. [2024-11-07 01:47:07,353 INFO L78 Accepts]: Start accepts. Automaton has 2501 states and 3301 transitions. Word has length 167 [2024-11-07 01:47:07,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:07,353 INFO L471 AbstractCegarLoop]: Abstraction has 2501 states and 3301 transitions. [2024-11-07 01:47:07,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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-07 01:47:07,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2501 states and 3301 transitions. [2024-11-07 01:47:07,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 01:47:07,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:07,355 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:47:07,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 01:47:07,355 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:07,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:07,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1155029320, now seen corresponding path program 1 times [2024-11-07 01:47:07,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:07,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692138522] [2024-11-07 01:47:07,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:07,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:07,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:07,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:47:07,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:07,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:47:07,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:07,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 01:47:07,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:07,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:47:07,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:07,561 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-07 01:47:07,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:07,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692138522] [2024-11-07 01:47:07,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692138522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:07,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:07,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:47:07,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367639280] [2024-11-07 01:47:07,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:07,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:47:07,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:07,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:47:07,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:47:07,562 INFO L87 Difference]: Start difference. First operand 2501 states and 3301 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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-07 01:47:09,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:09,470 INFO L93 Difference]: Finished difference Result 3995 states and 5709 transitions. [2024-11-07 01:47:09,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:47:09,471 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2024-11-07 01:47:09,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:09,482 INFO L225 Difference]: With dead ends: 3995 [2024-11-07 01:47:09,482 INFO L226 Difference]: Without dead ends: 2951 [2024-11-07 01:47:09,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:47:09,485 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 1282 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 1882 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1311 SdHoareTripleChecker+Valid, 1472 SdHoareTripleChecker+Invalid, 1979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:09,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1311 Valid, 1472 Invalid, 1979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1882 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 01:47:09,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2024-11-07 01:47:09,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2501. [2024-11-07 01:47:09,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2501 states, 2118 states have (on average 1.323890462700661) internal successors, (2804), 2134 states have internal predecessors, (2804), 210 states have call successors, (210), 142 states have call predecessors, (210), 171 states have return successors, (284), 226 states have call predecessors, (284), 209 states have call successors, (284) [2024-11-07 01:47:09,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2501 states to 2501 states and 3298 transitions. [2024-11-07 01:47:09,723 INFO L78 Accepts]: Start accepts. Automaton has 2501 states and 3298 transitions. Word has length 167 [2024-11-07 01:47:09,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:09,723 INFO L471 AbstractCegarLoop]: Abstraction has 2501 states and 3298 transitions. [2024-11-07 01:47:09,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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-07 01:47:09,723 INFO L276 IsEmpty]: Start isEmpty. Operand 2501 states and 3298 transitions. [2024-11-07 01:47:09,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 01:47:09,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:09,724 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:47:09,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 01:47:09,724 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:09,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:09,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1695458826, now seen corresponding path program 1 times [2024-11-07 01:47:09,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:09,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264790594] [2024-11-07 01:47:09,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:09,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:09,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:09,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:09,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:09,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:47:09,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:09,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:47:09,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:09,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 01:47:09,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:09,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:47:09,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:09,956 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-07 01:47:09,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:09,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264790594] [2024-11-07 01:47:09,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264790594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:09,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:09,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:47:09,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119076445] [2024-11-07 01:47:09,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:09,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:47:09,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:09,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:47:09,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:47:09,959 INFO L87 Difference]: Start difference. First operand 2501 states and 3298 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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-07 01:47:11,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:11,565 INFO L93 Difference]: Finished difference Result 3991 states and 5692 transitions. [2024-11-07 01:47:11,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:47:11,565 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2024-11-07 01:47:11,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:11,575 INFO L225 Difference]: With dead ends: 3991 [2024-11-07 01:47:11,576 INFO L226 Difference]: Without dead ends: 2947 [2024-11-07 01:47:11,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:47:11,578 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 1485 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 1698 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 1835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:11,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1514 Valid, 1228 Invalid, 1835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1698 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 01:47:11,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2947 states. [2024-11-07 01:47:11,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2947 to 2501. [2024-11-07 01:47:11,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2501 states, 2118 states have (on average 1.3224740321057602) internal successors, (2801), 2134 states have internal predecessors, (2801), 210 states have call successors, (210), 142 states have call predecessors, (210), 171 states have return successors, (284), 226 states have call predecessors, (284), 209 states have call successors, (284) [2024-11-07 01:47:11,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2501 states to 2501 states and 3295 transitions. [2024-11-07 01:47:11,890 INFO L78 Accepts]: Start accepts. Automaton has 2501 states and 3295 transitions. Word has length 167 [2024-11-07 01:47:11,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:11,891 INFO L471 AbstractCegarLoop]: Abstraction has 2501 states and 3295 transitions. [2024-11-07 01:47:11,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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-07 01:47:11,891 INFO L276 IsEmpty]: Start isEmpty. Operand 2501 states and 3295 transitions. [2024-11-07 01:47:11,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 01:47:11,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:11,893 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:47:11,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 01:47:11,893 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:11,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:11,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1851439368, now seen corresponding path program 1 times [2024-11-07 01:47:11,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:11,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781874185] [2024-11-07 01:47:11,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:11,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:11,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:11,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:12,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:47:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:12,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:47:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:12,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 01:47:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:12,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:47:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:12,113 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-07 01:47:12,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:12,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781874185] [2024-11-07 01:47:12,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781874185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:12,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:12,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:47:12,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801088842] [2024-11-07 01:47:12,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:12,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:47:12,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:12,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:47:12,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:47:12,115 INFO L87 Difference]: Start difference. First operand 2501 states and 3295 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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-07 01:47:15,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:15,512 INFO L93 Difference]: Finished difference Result 4919 states and 7139 transitions. [2024-11-07 01:47:15,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:47:15,512 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2024-11-07 01:47:15,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:15,527 INFO L225 Difference]: With dead ends: 4919 [2024-11-07 01:47:15,527 INFO L226 Difference]: Without dead ends: 3875 [2024-11-07 01:47:15,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:47:15,532 INFO L432 NwaCegarLoop]: 599 mSDtfsCounter, 1691 mSDsluCounter, 2057 mSDsCounter, 0 mSdLazyCounter, 3485 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1719 SdHoareTripleChecker+Valid, 2656 SdHoareTripleChecker+Invalid, 3580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 3485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:15,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1719 Valid, 2656 Invalid, 3580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 3485 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-07 01:47:15,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3875 states. [2024-11-07 01:47:15,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3875 to 3185. [2024-11-07 01:47:15,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3185 states, 2748 states have (on average 1.3704512372634643) internal successors, (3766), 2766 states have internal predecessors, (3766), 250 states have call successors, (250), 154 states have call predecessors, (250), 185 states have return successors, (332), 268 states have call predecessors, (332), 249 states have call successors, (332) [2024-11-07 01:47:15,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3185 states to 3185 states and 4348 transitions. [2024-11-07 01:47:16,007 INFO L78 Accepts]: Start accepts. Automaton has 3185 states and 4348 transitions. Word has length 167 [2024-11-07 01:47:16,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:16,008 INFO L471 AbstractCegarLoop]: Abstraction has 3185 states and 4348 transitions. [2024-11-07 01:47:16,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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-07 01:47:16,008 INFO L276 IsEmpty]: Start isEmpty. Operand 3185 states and 4348 transitions. [2024-11-07 01:47:16,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 01:47:16,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:16,010 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:47:16,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-07 01:47:16,011 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:16,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:16,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1440829002, now seen corresponding path program 1 times [2024-11-07 01:47:16,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:16,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247792651] [2024-11-07 01:47:16,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:16,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:16,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:16,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:16,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:47:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:16,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:47:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:16,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 01:47:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:16,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:47:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:16,218 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-07 01:47:16,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:16,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247792651] [2024-11-07 01:47:16,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247792651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:16,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:16,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:47:16,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108159968] [2024-11-07 01:47:16,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:16,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:47:16,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:16,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:47:16,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:47:16,220 INFO L87 Difference]: Start difference. First operand 3185 states and 4348 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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-07 01:47:17,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:17,914 INFO L93 Difference]: Finished difference Result 5591 states and 8181 transitions. [2024-11-07 01:47:17,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:47:17,915 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2024-11-07 01:47:17,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:17,931 INFO L225 Difference]: With dead ends: 5591 [2024-11-07 01:47:17,931 INFO L226 Difference]: Without dead ends: 3863 [2024-11-07 01:47:17,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:47:17,936 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 1484 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 1676 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1513 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 1813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:17,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1513 Valid, 1228 Invalid, 1813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1676 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 01:47:17,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3863 states. [2024-11-07 01:47:18,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3863 to 3185. [2024-11-07 01:47:18,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3185 states, 2748 states have (on average 1.3686317321688501) internal successors, (3761), 2766 states have internal predecessors, (3761), 250 states have call successors, (250), 154 states have call predecessors, (250), 185 states have return successors, (332), 268 states have call predecessors, (332), 249 states have call successors, (332) [2024-11-07 01:47:18,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3185 states to 3185 states and 4343 transitions. [2024-11-07 01:47:18,354 INFO L78 Accepts]: Start accepts. Automaton has 3185 states and 4343 transitions. Word has length 167 [2024-11-07 01:47:18,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:18,355 INFO L471 AbstractCegarLoop]: Abstraction has 3185 states and 4343 transitions. [2024-11-07 01:47:18,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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-07 01:47:18,355 INFO L276 IsEmpty]: Start isEmpty. Operand 3185 states and 4343 transitions. [2024-11-07 01:47:18,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 01:47:18,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:18,357 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:47:18,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-07 01:47:18,358 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:18,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:18,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1066268472, now seen corresponding path program 1 times [2024-11-07 01:47:18,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:18,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330787081] [2024-11-07 01:47:18,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:18,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:18,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:18,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:47:18,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:18,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:47:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:18,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 01:47:18,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:18,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:47:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:18,564 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-07 01:47:18,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:18,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330787081] [2024-11-07 01:47:18,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330787081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:18,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:18,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:47:18,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955879986] [2024-11-07 01:47:18,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:18,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:47:18,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:18,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:47:18,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:47:18,566 INFO L87 Difference]: Start difference. First operand 3185 states and 4343 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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-07 01:47:21,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:21,844 INFO L93 Difference]: Finished difference Result 7395 states and 10976 transitions. [2024-11-07 01:47:21,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:47:21,844 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2024-11-07 01:47:21,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:21,861 INFO L225 Difference]: With dead ends: 7395 [2024-11-07 01:47:21,861 INFO L226 Difference]: Without dead ends: 5667 [2024-11-07 01:47:21,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:47:21,866 INFO L432 NwaCegarLoop]: 599 mSDtfsCounter, 1683 mSDsluCounter, 2057 mSDsCounter, 0 mSdLazyCounter, 3447 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1711 SdHoareTripleChecker+Valid, 2656 SdHoareTripleChecker+Invalid, 3542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 3447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:21,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1711 Valid, 2656 Invalid, 3542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 3447 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-07 01:47:21,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5667 states. [2024-11-07 01:47:22,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5667 to 4555. [2024-11-07 01:47:22,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4555 states, 4010 states have (on average 1.4177057356608478) internal successors, (5685), 4032 states have internal predecessors, (5685), 330 states have call successors, (330), 178 states have call predecessors, (330), 213 states have return successors, (434), 352 states have call predecessors, (434), 329 states have call successors, (434) [2024-11-07 01:47:22,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4555 states to 4555 states and 6449 transitions. [2024-11-07 01:47:22,326 INFO L78 Accepts]: Start accepts. Automaton has 4555 states and 6449 transitions. Word has length 167 [2024-11-07 01:47:22,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:22,326 INFO L471 AbstractCegarLoop]: Abstraction has 4555 states and 6449 transitions. [2024-11-07 01:47:22,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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-07 01:47:22,326 INFO L276 IsEmpty]: Start isEmpty. Operand 4555 states and 6449 transitions. [2024-11-07 01:47:22,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 01:47:22,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:22,328 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:47:22,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-07 01:47:22,329 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:22,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:22,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1069614730, now seen corresponding path program 1 times [2024-11-07 01:47:22,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:22,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385938355] [2024-11-07 01:47:22,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:22,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:22,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:22,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:47:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:22,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:47:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:22,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 01:47:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:22,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:47:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:22,491 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-07 01:47:22,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:22,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385938355] [2024-11-07 01:47:22,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385938355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:22,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:22,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:47:22,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940433130] [2024-11-07 01:47:22,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:22,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:47:22,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:22,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:47:22,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:47:22,493 INFO L87 Difference]: Start difference. First operand 4555 states and 6449 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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)